By Topic

DMIP3S: distributed algorithms for power-conserving multicasting in static 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
$31 $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

5 Author(s)
Dazhen Pan ; Comput. Sci. & Eng. Dept., State Univ. of New York at Buffalo, Amherst, MA, USA ; Mavinkurve, P. ; Ngo, H.Q. ; Verma, V.
more authors

In a static wireless ad hoc network, given a distinguished source node, and a subset of nodes called multicast group members, the minimum-energy multicast problem is to assign appropriate power levels to nodes in the network so that all group members are reachable from the source, and the total power usage is as small as possible. Computing effective power assignments and the multicast trees in a distributed manner is a major challenge. We devise two distributed algorithms for this problem. The central idea is called incremental power with potential power saving (IP3S). One algorithm, called DMIP3S (distributed multicast IP3S), is for small multicast groups and the other one, called P-DIP3S (pruning version of distributed IP3S), is for larger groups. Extensive simulations show that our distributed algorithms work even better than most known centralized ones. As far as we know, these are the first distributed algorithms for this problem.

Published in:

High Performance Switching and Routing, 2004. HPSR. 2004 Workshop on

Date of Conference:

2004