By Topic

G-REMiT: An algorithm for building energy efficient multicast trees 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)
Bin Wang ; Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA ; S. K. S. Gupta

In this paper, we propose a distributed algorithm called G-REMiT for building an energy efficient multicast tree in a wireless ad hoc network (WANET). G-REMiT employs a more realistic energy consumption model for wireless communication which takes into account not only the energy losses due to radio propagation but also the energy losses in the transceiver electronics. We evaluate the performance of the protocol using two energy consumption model: long range radio and short range radio. We show that for long range radio model, G-REMiT algorithm can achieve better performance than other proposals such as MLU, MLiMST and MIP, and the energy overhead of for executing G-REMiT is negligible compared with the total energy consumption for the multicast communication. For short range radio, we find that existing energy saving scheme by adjusting node's transmission power is not suitable.

Published in:

Network Computing and Applications, 2003. NCA 2003. Second IEEE International Symposium on

Date of Conference:

16-18 April 2003