On maximizing lifetime of multicast trees in wireless ad hoc networks

B. Wang, Sandeep Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

67 Scopus citations

Abstract

We present a distributed algorithm called L-REMiTfor 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 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 BIP/MIP and EWMA algorithms.

Original languageEnglish (US)
Title of host publicationProceedings - 2003 International Conference on Parallel Processing, ICPP 2003
EditorsP. Sadayappan, Chu-Sing Yang
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages333-340
Number of pages8
ISBN (Electronic)0769520170
DOIs
StatePublished - Jan 1 2003
Event2003 International Conference on Parallel Processing, ICPP 2003 - Kaohsiung, Taiwan, Province of China
Duration: Oct 6 2003Oct 9 2003

Publication series

NameProceedings of the International Conference on Parallel Processing
Volume2003-January
ISSN (Print)0190-3918

Other

Other2003 International Conference on Parallel Processing, ICPP 2003
CountryTaiwan, Province of China
CityKaohsiung
Period10/6/0310/9/03

Keywords

  • Ad hoc networks
  • Batteries
  • Broadcasting
  • Distributed algorithms
  • Energy efficiency
  • Intelligent networks
  • Mobile ad hoc networks
  • Multicast algorithms
  • Multicast protocols
  • Partitioning algorithms

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'On maximizing lifetime of multicast trees in wireless ad hoc networks'. Together they form a unique fingerprint.

  • Cite this

    Wang, B., & Gupta, S. (2003). On maximizing lifetime of multicast trees in wireless ad hoc networks. In P. Sadayappan, & C-S. Yang (Eds.), Proceedings - 2003 International Conference on Parallel Processing, ICPP 2003 (pp. 333-340). [1240596] (Proceedings of the International Conference on Parallel Processing; Vol. 2003-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPP.2003.1240596