Cart (Loading....) | Create Account
Close category search window

LEMA: Localized Energy-Efficient Multicast Algorithm based on Geographic Routing

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

2 Author(s)
Sanchez, J.A. ; Dept. Inf. & Comms. Eng., Murcia Univ. ; Ruiz, P.M.

Most usage scenarios for ad hoc and sensor networks require some degree of one-to-many or many-to-many interactions. In particular, for the case of sensor networks there is a number of scenarios in which a node has to send the same data to multiple destinations. Given that sensor networks have very limited resources, multicasting is a very interesting approach to deliver the same data packet to multiple destinations while reducing the amount of bandwidth and power consumption. In this paper, we present LEMA (localized energy-efficient multicast algorithm), a new energy-efficient multicast routing protocol based on geographic routing. The protocol is localized, as long as nodes currently routing multicast data packets are only required to know the coordinates of the destinations (locally obtained from the data packet to route) and the positions of its next hops. The protocol uses a localized source routing scheme to reach next hops which, unlike traditional geographic routing schemes, allows for the use of neighbors not providing advance to reduce the overall energy consumption. Our simulation results show that for networks with enough density the protocol is able to outperform even well-known centralized heuristics such as minimum incremental power (MIP) as well as shortest path tree (SPT) based on energy. For low-density networks, the protocol is still competitive for most scenarios

Published in:

Local Computer Networks, Proceedings 2006 31st IEEE Conference on

Date of Conference:

14-16 Nov. 2006

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.