We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Reseach Article

Minimum Energy Multicast Routing in Mobile Ad-hoc Network

by Mrunali S. Sonwalkar, Ramanna S. Havinal
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 64 - Number 22
Year of Publication: 2013
Authors: Mrunali S. Sonwalkar, Ramanna S. Havinal
10.5120/10781-5762

Mrunali S. Sonwalkar, Ramanna S. Havinal . Minimum Energy Multicast Routing in Mobile Ad-hoc Network. International Journal of Computer Applications. 64, 22 ( February 2013), 52-57. DOI=10.5120/10781-5762

@article{ 10.5120/10781-5762,
author = { Mrunali S. Sonwalkar, Ramanna S. Havinal },
title = { Minimum Energy Multicast Routing in Mobile Ad-hoc Network },
journal = { International Journal of Computer Applications },
issue_date = { February 2013 },
volume = { 64 },
number = { 22 },
month = { February },
year = { 2013 },
issn = { 0975-8887 },
pages = { 52-57 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume64/number22/10781-5762/ },
doi = { 10.5120/10781-5762 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:17:23.587137+05:30
%A Mrunali S. Sonwalkar
%A Ramanna S. Havinal
%T Minimum Energy Multicast Routing in Mobile Ad-hoc Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 64
%N 22
%P 52-57
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes. It can be constructed anywhere without any infrastructure. The mobile nodes are equipped with energy-limited batteries. An important issue in such a network is to minimize the total energy consumption for each operation. In MANET each node acts as a store and forward station for routing packets. As the nodes are highly dynamic, maintaining routes become a greater challenge. Multicasting is one of the fundamental mechanism, which can be typically implemented by creating a multicast tree. It is achieved by forming minimum spanning tree between the source nodes and other mobile nodes in the network and then data is transmitted over this minimum path. In this paper we are focusing on designing energy efficient routing algorithms for creating minimum spanning tree. It first uses AODV as basic protocol, then we are designing a distributed algorithm for finding the approximate distance between nodes. We have conducted experiments by simulations to evaluate the performance of the proposed algorithm and compare it with the basic AODV. The experimental results demonstrate that the proposed algorithm significantly reduces energy consumption, delay and improves throughput and packet delivery ratio.

References
  1. Osamah S. Badarneh and Michel Kadoch "Multicast Routing Protocols in Mobile Ad Hoc Networks: A Comparative Survey and Taxonomy" EURASIP Journal on Wireless Communications and Networking Vol. 2009.
  2. V. Ramesh, Dr. P. Subbaiah N. Sandeep Chaitanya K. Sangeetha Supriya4 "An efficient energy management scheme for mobile ad-hoc networks". International Journal Of Research And Reviews In Computer Science (Ijrrcs) Vol. 1, No. 4, December 2010.
  3. Weifa Liang, Senior Member, IEEE "Approximate minimum-energy multicasting in wireless ad hoc networks" IEEE Transactions On Mobile Computing, Vol. 5, No. 4, April 2006.
  4. Weifa Liang, Senior Member, IEEE, Richard Brent, Fellow, IEEE, Yinlong Xu, and Qingshan Wang "Minimum-energy all-to-all multicasting in wireless ad hoc networks" IEEE Transactions On Wireless Communications, Vol. 8, No. 10, October 2009.
  5. Yongwook Choi, Maleq Khan, V. S. Anil Kumar, and Gopal Pandurangan," Energy-optimal distributed algorithms for minimum spanning trees" IEEE Journal On Selected Areas In Communications, Vol. 27, No. 7, September 2009.
  6. Hassan Artail, and Khaleel Mershad "MDPF: Minimum Distance Packet Forwarding for Search Applications in Mobile Ad Hoc Networks" IEEE Transactions On Mobile Computing, Vol. 8, No. 10, October 2009
  7. Maleq Khan, Gopal Pandurangan, S. Anil Kumar "Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Networks" IEEE Transactions On Parallel And Distributed Systems.
  8. Luo Junhai , Xue Liu, Ye Danxia Research on "Multicast Routing Protocols For Mobile Ad-Hoc Networks".
  9. Yongwook Choi, Maleq Khan, V. S. Anil Kumar, and Gopal Pandurangan, "Energy-Optimal Distributed Algorithms for Minimum Spanning Trees" IEEE Journal On Selected Areas In Communications, Vol. 27, No. 7, September 2009.
  10. S. Preethi, B. Ramachandran. "Energy Efficient Routing Protocols for Mobile Ad Hoc Networks".
  11. Zhang Yi , Feng Li, Chen Wei , Zhu Lina, "Power-Aware Routing Algorithm based on Mobile Agents (PARAMA) in Mobile Ad Hoc Networks" The 2008 International Conference on Embedded Software and Systems Symposia (ICESS2008).
Index Terms

Computer Science
Information Sciences

Keywords

MANET energy conservation delay throughput multicasting minimum spanning tree distributed algorithm