LEMA: Localized energy-efficient multicast algorithm based on geographic routing

Proceedings - Conference on Local Computer Networks, LCN

Volumn , Issue , 2006, Pages 3-12

  Sanchez, Juan A ^a   Ruiz, Pedro M ^a  

^a UNIVERSITY OF MURCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PACKETS; ENERGY CONSUMPTION.; ENERGY EFFICIENT; GEOGRAPHIC ROUTING; LIMITED RESOURCES; LOCAL COMPUTER; LOCALIZED ENERGY-EFFICIENT MULTICAST ALGORITHM; LOW-DENSITY NETWORKS; MINIMUM INCREMENTAL POWER; MULTICAST DATA PACKETS; MULTICAST ROUTING PROTOCOLS; MULTIPLE DESTINATIONS; POWER CONSUMPTION (CE); SHORTEST-PATH-TREE (SPT); SIMULATION RESULTS; SOURCE ROUTING; USAGE SCENARIOS;

AD HOC NETWORKS; BOOLEAN FUNCTIONS; CONSERVATION; DETECTORS; ELECTRIC LOAD FORECASTING; ENERGY CONSERVATION; ENERGY EFFICIENCY; ENERGY POLICY; HEURISTIC PROGRAMMING; INTERNET; MULTICASTING; NETWORK PROTOCOLS; NETWORK ROUTING; PLASMA WAVES; ROUTING ALGORITHMS; ROUTING PROTOCOLS; SENSOR NETWORKS; SENSORS; TELECOMMUNICATION NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

COMPUTER NETWORKS;

EID: 46149116349     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LCN.2006.322092     Document Type: Conference Paper

References (14)

1. Finn, G. G., Routing and addressing problems in large metropolitan-scale internetworks, Tech. Rep. ISI/RR-87-180, Information Sciences Institute, Mar. 1987.
2. Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J., Routing with guaranteed delivery in ad hoc wireless networks, ACM Wireless Networks, Vol. 7, no. 6, November 2001, pp. 609-616
3. Brad karp and H.T.Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless networks, in Proceedings of the sixth annual ACM/IEEE International Conference on Mobile computing and networking (MobiCom '00), Boston, Massachusetts, August 2000, pp. 243-254
4. Ivan Stojmenovic and Xu Lin, Power aware localized routing in wireless networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 11, November 2001, 1122-1133
5. Jeffrey E. Wieselthier, Gam D. Nguyen and Anthony Ephremides, Energy-Efficient Broadcast and Multicast Trees in Wireless Networks, Mobile Networks and Applications, Vol. 7, 481-492, 2002
6. T. Ballardie, P. Francis, and J. Crowcroft, Core Based Trees (CBT) - An architecture for scalable inter-domain multicast routing, in Proceedings of ACM SIGCOMM'93, San Francisco, CA, October 1993, pp.85-95.
7. C.-C. Chiang, M. Geria, and L. Zhang, Adaptive Shared Tree Multicast in Mobile Wireless Networks, in Proceedings of GLOBECOM '98, pp. 1817-1822, November 1998.
8. M. Mauve, H.Füßler, J. Widmer, T. Lang, Position-Based Multicast Routing for Mobile Ad-Hoc Networks, TR-03-004, Department of Computer Science, University of Mannheim, March, 2003.
9. M. Transier, H. Füßler, J. Widmer, Martin Mauve and Wolfgang Effelsberg, Scalable Position-Based Multicast for Mobile Ad-hoc Networks, First International Workshop on Broadband Wireless Multimedia: Algorithms, Architectures and Applications (BroadWim 2004),San Jose, CA, USA, 2004
10. R.-M. Karp, Reducibility among combinatorial problems, in Complexity of computer computations, Plenum Press, New York, 1975, pp.85103.
11. L. Kou, G. Markowsky, and L. Berman A fast algorithm for Steiner trees. Acta Informatica, no. 15, vol. 2, 1981, pp. 141145.
12. J. Plesnik The complexity of designing a network with minimum diameter, in Networks, no. 11, 1981, pp. 7785.
13. Bin Wang and Sandeep K. S. Gupta G-REMiT: An Algorithm for Building Energy Efficient of Multicast Trees in Wireless Ad Hoc Networks, in Proceedings of NCA'03, 2003
14. J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, in Proceedings of the American Mathematics Society, vol. 7(1), pp.4850, 1956.