Welcome to the InfoSci Platform
Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting

Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting

Serkan Çiftlikli, Figen Öztoprak, Özgür Erçetin, Kerem Bülbül
Copyright: © 2009 |Volume: 1 |Issue: 2 |Pages: 20
ISSN: 1941-8663|EISSN: 1941-8671|ISSN: 1941-8663|EISBN13: 9781615203772|EISSN: 1941-8671|DOI: 10.4018/jitn.2009040104
Cite Article Cite Article

MLA

Çiftlikli, Serkan, et al. "Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting." IJITN vol.1, no.2 2009: pp.46-65. http://doi.org/10.4018/jitn.2009040104

APA

Çiftlikli, S., Öztoprak, F., Erçetin, Ö., & Bülbül, K. (2009). Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting. International Journal of Interdisciplinary Telecommunications and Networking (IJITN), 1(2), 46-65. http://doi.org/10.4018/jitn.2009040104

Chicago

Çiftlikli, Serkan, et al. "Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting," International Journal of Interdisciplinary Telecommunications and Networking (IJITN) 1, no.2: 46-65. http://doi.org/10.4018/jitn.2009040104

Export Reference

Mendeley
Favorite Full-Issue Download

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

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.