Shopping Cart | Login | Register | Language: English

Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting

Volume 1, Issue 2. Copyright © 2009. 20 pages.
OnDemand Article PDF Download
Download link provided immediately after order completion
$37.50
Available. Instant access upon order completion.
DOI: 10.4018/jitn.2009040104
Sample PDFCite

MLA

Çiftlikli, Serkan, Figen Öztoprak, Özgür Erçetin and Kerem Bülbül. "Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting." IJITN 1.2 (2009): 46-65. Web. 23 Aug. 2014. doi: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. doi:10.4018/jitn.2009040104

Chicago

Çiftlikli, Serkan, Figen Öztoprak, Özgür Erçetin and Kerem Bülbül. "Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting," International Journal of Interdisciplinary Telecommunications and Networking (IJITN) 1 (2009): 2, accessed (August 23, 2014), doi:10.4018/jitn.2009040104

Export Reference

Mendeley
Favorite
Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting
Access on Platform
Browse by Subject
Top

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.
Top

Complete Article List

Search this Journal: Reset
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