Issue No. 09 - September (2005 vol. 54)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2005.148
Sartaj Sahni , IEEE
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 in ,  for the construction of minimum energy broadcast trees. Extensive simulations performed by us show that this coupling improves network lifetime significantly (between 48.3 percent and 328.9 percent) when compared with network lifetime using the base greedy heuristics in isolation.
Index Terms- Wireless networks, minimum energy broadcast trees, network lifetime.
S. Sahni and J. Park, "Maximum Lifetime Broadcasting in Wireless Networks," in IEEE Transactions on Computers, vol. 54, no. , pp. 1081-1090, 2005.