Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
ON ENERGY EFFICIENCY AND NETWORK CONNECTIVITY OF MOBILE AD HOC NETWORKS
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Maximizing Battery Life Routing in Wireless Ad Hoc Networks
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9
Maximum Lifetime Broadcasting in Wireless Networks
IEEE Transactions on Computers
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
In this paper we focus on the problem of constructing an optimal broadcast tree rooted at a given source node that maximizes the network lifetime from the view point of number of messages broadcasted during the network lifetime. We define the network lifetime as the lifetime of the node in the network which exhausts its energy at the earliest. We propose improvements over the broadcast incremental power (BIP) protocol in two phases (algorithms). The first algorithm assumes that the network is heterogeneous with different devices having different initial battery energy level and the second one assumes the network to be composed of devices with equal initial energies. These algorithms build upon the broadcast nature of the wireless communication environment -- a message broadcasted from a given node reaches all the nodes that are within the sphere defined by the transmitting range of the node as radius. We have also provided the simulation results to testify our claims. The results further prove the superior performance of the proposed improved BIP algorithm.