Maximum lifetime broadcasting in wireless networks

Authors:
J. Park;S. Sahni
Affiliations:
Dept. of Comput. & Inf. Sci. & Eng., Florida Univ., Gainesville, FL, USA;Dept. of Comput. & Inf. Sci. & Eng., Florida Univ., Gainesville, FL, USA
Venue:
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
Year:
2005

Citing 0
Cited 3

An analysis of the lifetime of OLSR networks

Ad Hoc Networks
Improved approximation bounds for maximum lifetime problems in wireless ad-hoc network

ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Energy efficient networking via dynamic relay node selection in wireless networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Summary form only given. We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree that maximizes the critical energy of the network following the broadcast is developed. Additionally, we propose two new greedy heuristics to construct minimum energy broadcast trees. We show how our maximum critical energy algorithm may be coupled with our proposed greedy heuristics as well as with the greedy heuristics proposed earlier in the literature for the construction of minimum energy broadcast trees. Extensive simulations performed by us show that this coupling improves network lifetime significantly (between 48.3% and 328.9%) when compared with network lifetime using the base greedy heuristics in isolation.