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

Song Guo; Oliver Yang

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 proceeding › Conference article published in proceeding or book › Academic research › peer-review

34 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 language	English
Title of host publication	IEEE International Performance, Computing and Communications Conference, Proceedings
Pages	637-642
Number of pages	6
Publication status	Published - 1 Jun 2004
Externally published	Yes
Event	23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 - Phoenix, AZ., United States Duration: 15 Apr 2004 → 17 Apr 2004

Conference

Conference	23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004
Country/Territory	United States
City	Phoenix, AZ.
Period	15/04/04 → 17/04/04

ASJC Scopus subject areas

Media Technology

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Cite this

@inproceedings{69259e6369864494a59780cea9515bc2,

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

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.",

author = "Song Guo and Oliver Yang",

year = "2004",

month = jun,

day = "1",

language = "English",

pages = "637--642",

booktitle = "IEEE International Performance, Computing and Communications Conference, Proceedings",

note = "23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 ; Conference date: 15-04-2004 Through 17-04-2004",

}

Guo, S & Yang, O 2004, A dynamic multicast tree reconstruction algorithm for minimum-energy multicasting in wireless ad hoc networks. in IEEE International Performance, Computing and Communications Conference, Proceedings. pp. 637-642, 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004, Phoenix, AZ., United States, 15/04/04.

A dynamic multicast tree reconstruction algorithm for minimum-energy multicasting in wireless ad hoc networks. / Guo, Song; Yang, Oliver.

IEEE International Performance, Computing and Communications Conference, Proceedings. 2004. p. 637-642.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

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

AU - Guo, Song

AU - Yang, Oliver

PY - 2004/6/1

Y1 - 2004/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=2442490882&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

SP - 637

EP - 642

BT - IEEE International Performance, Computing and Communications Conference, Proceedings

T2 - 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004

Y2 - 15 April 2004 through 17 April 2004

ER -

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

Abstract

Conference

ASJC Scopus subject areas

UN SDGs

Other files and links

Fingerprint

Cite this