An Efficient Method for Tracking Nodes (EMTN) In Mobile Ad Hoc Networks
|
10.5120/1552-2069 |
Anuradha Banerjee and Dr. Paramartha Dutta. Article:An Efficient Method for Tracking Nodes (EMTN) In Mobile Ad Hoc Networks. International Journal of Computer Applications 11(2):38–41, December 2010. Published By Foundation of Computer Science. BibTeX
@article{key:article,
author = {Anuradha Banerjee and Dr. Paramartha Dutta},
title = {Article:An Efficient Method for Tracking Nodes (EMTN) In Mobile Ad Hoc Networks},
journal = {International Journal of Computer Applications},
year = {2010},
volume = {11},
number = {2},
pages = {38--41},
month = {December},
note = {Published By Foundation of Computer Science}
}
Abstract
In this article, we propose a simple as well as efficient method of tracking nodes (EMTN) in mobile ad hoc networks. During the process of route discovery, source node of a communication session floods ROUTE_REQUEST packets to find a suitable route to the desired destination. EMTN aims at reducing the number of ROUTE_REQUESTS at each hop. This generates great performance enhancement especially in dense networks. Simulation results show that EMTN significantly increases the packet delivery ratio while decreasing the cost of messages and consumption of energy of network nodes at the cost of a bit extra bandwidth.
Reference
- C.E. Parkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector (DSDV) mobile computers, ACM Computer Communications Review, Vol. 24 No. 4, ACM SIGCOMM ‘94
- Murthy, S. and J.J. Garcia-Luna-Aceves, An Efficient Routing Protocol for Wireless Networks, ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183-197
- M. Gerla and T. W. Chen, “Global State Routing : A new routing scheme for Ad-Hoc wireless networks”, Proc. IEEE ICC '98
- http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.8231
- D. Johnson, D. A. Maltz, Dynamic source routing in ad hoc wireless networks, in Mobile Computing (T. Imielinski and H. Korth, eds.), Kluwer Acad. Publ., 1996)
- C.E. Perkins and E.M. Royer. Ad hoc on demand Distance Vector routing, mobile computing systems and applications, 1999. Proceedings. WMCSA ’99. Second IEEE Workshop on, 1999, pp.90 - 100
- M. S. Corson and A. Ephremides, A Distributed Algorithm for Mobile Wireless Networks, Wireless Networks, Vol. 1, pp. 61 – 81, 1995
- N. Meghanathan, “Energy Consumption Analysis of the Stable Path and Minimum Hop Path Routing Strategies for Mobile Ad hoc Networks,” International Journal of Computer Science and Network Security, Vol. 7, No. 10, pp. 30 – 39, October 2007
- N. Meghanathan, A Beaconless Node Velocity-based Stable Path Routing Protocol for Mobile Ad hoc Networks, Proceedings of the IEEE Sarnoff Symposium Conference, Princeton, NJ, March 30- April 1, 2009
- W. Su, S-J. Lee and M. Gerla, Mobility Prediction and Routing in Ad hoc Wireless Networks, International Journal of Network Management, Vol. 11, No. 1, pp. 3-30, 2001
- Pallavi Khatri, Monika Rajput, Alankar Shastri and Keshav Solanki, Performance study of ad hoc reactive routing protocols, Journal of Computer Science, vol. 6, no. 10, pp. 1130 – 1135, 2010
- www.isi.edu/nsnam/ns