By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Song Guo ; Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont., Canada ; O. Yang

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.

Published in:

Performance, Computing, and Communications, 2004 IEEE International Conference on

Date of Conference: