A dynamic multicast tree reconstruction algorithm for minimum-energy multicasting in wireless ad hoc networks

Song Guo, Oliver Yang

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

31 Citations (Scopus)

Abstract

In wireless ad hoc networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery operated. In this paper, we consider wireless ad hoc networks that use omni-directional antennas and have limited energy resources. We focus on the problem of minimum-energy multicast, for which it is well known that the broadcast nature of the radio transmission can be exploited to optimize energy consumption. In order to handle larger networks, we present a dynamic multicast tree reconstruction heuristic algorithm called MIDP (Multicast Incremental-Decremental Power), which provides a near optimal solution in polynomial-time. The experiment results show that our algorithm compares well with other proposals.
Original languageEnglish
Title of host publicationIEEE International Performance, Computing and Communications Conference, Proceedings
Pages637-642
Number of pages6
Publication statusPublished - 1 Jun 2004
Externally publishedYes
Event23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 - Phoenix, AZ., United States
Duration: 15 Apr 200417 Apr 2004

Conference

Conference23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004
CountryUnited States
CityPhoenix, AZ.
Period15/04/0417/04/04

ASJC Scopus subject areas

  • Media Technology

Cite this