Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting

Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting

Serkan Çiftlikli (Sabanci University, Turkey), Figen Öztoprak (Sabanci University, Turkey), Özgür Erçetin (Sabanci University, Turkey) and Kerem Bülbül (Sabanci University, Turkey)
DOI: 10.4018/jitn.2009040104
OnDemand PDF Download:
No Current Special Offers


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(n3) from O(n2?) in a network of size n, it provides up to 50% improvement in total expended power compared to DLS.

Complete Article List

Search this Journal:
Open Access Articles
Volume 14: 4 Issues (2022): Forthcoming, Available for Pre-Order
Volume 13: 4 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing