CFP last date
20 January 2025
Reseach Article

Multicast Routing with Minimum Energy Cost in Ad Hoc Wireless Networks

Published on March 2012 by Abhishek Pandey, Lok Ranjan Das
2nd National Conference on Innovative Paradigms in Engineering and Technology (NCIPET 2013)
Foundation of Computer Science USA
NCIPET - Number 12
March 2012
Authors: Abhishek Pandey, Lok Ranjan Das
cced7844-a5cb-4938-9165-bc2f4098fa02

Abhishek Pandey, Lok Ranjan Das . Multicast Routing with Minimum Energy Cost in Ad Hoc Wireless Networks. 2nd National Conference on Innovative Paradigms in Engineering and Technology (NCIPET 2013). NCIPET, 12 (March 2012), 39-43.

@article{
author = { Abhishek Pandey, Lok Ranjan Das },
title = { Multicast Routing with Minimum Energy Cost in Ad Hoc Wireless Networks },
journal = { 2nd National Conference on Innovative Paradigms in Engineering and Technology (NCIPET 2013) },
issue_date = { March 2012 },
volume = { NCIPET },
number = { 12 },
month = { March },
year = { 2012 },
issn = 0975-8887,
pages = { 39-43 },
numpages = 5,
url = { /proceedings/ncipet/number12/5284-1096/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 2nd National Conference on Innovative Paradigms in Engineering and Technology (NCIPET 2013)
%A Abhishek Pandey
%A Lok Ranjan Das
%T Multicast Routing with Minimum Energy Cost in Ad Hoc Wireless Networks
%J 2nd National Conference on Innovative Paradigms in Engineering and Technology (NCIPET 2013)
%@ 0975-8887
%V NCIPET
%N 12
%P 39-43
%D 2012
%I International Journal of Computer Applications
Abstract

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network and a multicast request, to find a multicast tree such that the total energy cost of the multicast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove the problem is NP-hard, and then propose three heuristic algorithms, namely Steiner tree based heuristic, Node-Join-Tree and Tree-Join-Tree greedy algorithms. Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms.

References
  1. Volkan Rodoplu and Teresa Meng, “Minimum Energy Mobile Wireless Networks”, IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, Aug 1999, pp.1333-1344.
  2. Ram Ramanathan and Regina Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment”, IEEE INFOCOM 2000, Tel-Aviv, Mar 2000, pp. 404-413.
  3. Roger Wattenhofer, Li Li, Paramvir Bahl and Yi-Min Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks”, IEEE INFOCOM 2001, Alaska, USA, April, 2001.
  4. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, “Algorithm for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks”, Mobile Networks and Applications 6, 2001, pp. 251-263.
  5. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, “On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks”, IEEE Infocom’2000.
  6. J. E. Wieselthier, G. D. Nguyen and A. Ephremides, “Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Mobile Networks and Applications 7, 2002, pp. 481-492.
  7. P. J. Wan, G. Calinescu, X. Y. Li and O. Frieder, “ Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks”, IEEE Infocom’2001.
  8. Maggie Xiaoyan Cheng, Jianhua Sun, Manki Min, Ding-Zhu Du, "Energy Efficient Broadcast and Multicast Routing in Ad Hoc Wireless Networks", 22nd IEEE International Performance, Computing, and Communications Conference, Phoenix, Arizona, USA, 2003.
  9. Omer Egecioglu and Teofilo F. Gonzalez, “Minimum-Energy Broadcast in Simple Graphs with Limited Node Power”, In Proc. IASED International Conference on Parallel and Distributed Computing and Systems (PDCS 2001), Anaheim, CA, August 2001, pp. 334-338.
  10. M. Cagalj, JP Hubaux, C. Enz, “Minimum-Energy Broadcast in All- wireless Networks: NP-Completeness and Distribution Issues”, MOBICOM’02.
  11. W. Liang, “Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks”, MOBIHOC’02.
  12. Deying Li, Xiaohua Jia and Hai Liu, “Energy Efficient Broadcast Routing in Ad Hoc Wireless Networks”, IEEE Trans. On Mobile Computing, vol.3, no.1, 2004.
  13. D. S. Hochbaum, Approximation Algorithms for NP-hard Problems, PWS Publishing Company, 1997.
  14. L. Zosin, S. Khuller, “On Directed Steiner Trees”, Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp.59-63
Index Terms

Computer Science
Information Sciences

Keywords

Minimum energy cost Multicast tree Total energy cost Transmission range Greedy algorithm