Name
Abstract | ||
|---|---|---|
In this article, we investigate two different distributed algorithms for constructing a minimum power broadcast tree with a maximum depth. which corresponds to the maximum tolerable end-to-end delay in the network. Distributed Tree Expansion (DTE) is based on an implementation of a distributed minimum spanning tree algorithm in which the tree grows at each iteration by adding a node that can cover the maximum number of currently uncovered nodes in the network with minimum incremental transmission power and without violating the delay constraint. In Distributed Link Substitution (DLS), given a feasible broadcast tree, the solution is improved by replacing expensive transmissions by transmissions at lower power levels while reserving the feasibility of the tree with respect to the delay bound. Although DTE increases the message complexity to O(n(3)) from O(n(2)Delta.) in a network of size n, it provides up to 50% improvement in total expended power compared to DLS. [Article copies are available for purchase from InfoSci-on-Demand.com] |
Year | DOI | Venue |
|---|---|---|
2009 | 10.4018/jitn.2009040104 | INTERNATIONAL JOURNAL OF INTERDISCIPLINARY TELECOMMUNICATIONS AND NETWORKING |
Keywords | Field | DocType |
Delay Bound, Distributed Systems, Energy Efficient Broadcasting, Networks, Quality-of-Service, Wireless Technologies | Broadcasting,Network delay,Distributed minimum spanning tree,Computer science,Computer network,Quality of service,Real-time computing,Distributed algorithm,Wireless broadcasting,Bounded function | Journal |
Volume | Issue | ISSN |
1 | 2 | 1941-8663 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Serkan Çiftlikli | 1 | 0 | 0.34 |
| Figen Öztoprak | 2 | 17 | 3.33 |
| Özgür Erçetin | 3 | 146 | 22.96 |
| Kerem Bulbul | 4 | 71 | 9.69 |