On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks

This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multicast tree is the duration from the formation of the tree to the time when the first node fails due to battery energy exhaustion. L-REMiT assumes that the energy consumed to forward a packet is proportional to the forwarding distance and that WANET nodes can dynamically adjust their transmission power. The task of extending the lifetime of a multicast tree is formulated as the task of extending the lifetime of bottleneck nodes in the tree. The number of multicast packets which a bottleneck node can forward, as determined by its residual battery energy and the distance of its farthest child node, is minimum over all the nodes in the multicast tree. Lifetime of a bottleneck node is improved by reassigning its farthest children to other nodes in the tree with the goal of improving the lifetime of the multicast tr...

• Type: Conference
• Year: 2003
• Where: ICPP
• Authors: Bin Wang, Sandeep K. S. Gupta
• Keywords: Bottleneck Node, Distributed And Parallel Computing, ICPP 2003, Multicast Tree, Source-based Multicast Tree