Extending the lifetime of multicast trees in WANETs

Bin Wang, Sandeep Gupta

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

This paper presents a distributed algorithm called L-REMiT for enhancing 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 channel characteristics, 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 that a bottleneck node can forward, as determined by its residual battery energy and the distance of its farthest child node, is the minimum over all the nodes in the multicast tree. The 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 tree. Nodes only require information from their neighbors for refining the tree in a distributed manner. Simulation results show that L-REMiT has low overhead and performs better than the BIP/MIP and EWMA algorithms.

Original languageEnglish (US)
Pages (from-to)425-447
Number of pages23
JournalJournal of Information Science and Engineering
Volume20
Issue number3
StatePublished - May 1 2004

Keywords

  • Ad hoc network
  • Broadcast tree
  • Distributed algorithm
  • Multicast tree
  • Tree lifetime
  • Wireless network

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Extending the lifetime of multicast trees in WANETs'. Together they form a unique fingerprint.

  • Cite this