A distributed min-max tree algorithm for maximum-lifetime multicast in resource-limited wireless ad hoc networks

Song Guo, Victor M. Leung

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

We consider the problem of maximizing the multicast lifetime in multihop wireless networks in which each node is static and has limited energy, bandwidth, memory, and computation capabilities. Unlike most multicast algorithms that use centralized greedy algorithms, our algorithm can construct a global optimal maximum lifetime multicast tree in a distributed manner. It has a low complexity of O(λu) for both memory and computation requirements at each node u, where λu is the degree of node u. The simulation results have shown that it has an expected linear communication complexity under different network sizes and multicast group sizes. This means that our distributed algorithm is also scalable in terms of communication overhead and it is very useful for large-scale energy and bandwidth constrained multihop wireless networks like sensor networks.
Original languageEnglish
Title of host publication2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006
Pages673-677
Number of pages5
Volume2
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006 - Reston, VA, United States
Duration: 25 Sep 200628 Sep 2006

Conference

Conference2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006
Country/TerritoryUnited States
CityReston, VA
Period25/09/0628/09/06

Keywords

  • Distributed algorithm
  • Maximum-lifetime multicast
  • Wireless ad hoc networks

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this