CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

The Effect of Number of Hops per Path on Remind Energy in MANETs Routing Protocols

by Khafaei Taleb, Khafaie Behzad
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 43 - Number 24
Year of Publication: 2012
Authors: Khafaei Taleb, Khafaie Behzad
10.5120/6438-8848

Khafaei Taleb, Khafaie Behzad . The Effect of Number of Hops per Path on Remind Energy in MANETs Routing Protocols. International Journal of Computer Applications. 43, 24 ( April 2012), 23-28. DOI=10.5120/6438-8848

@article{ 10.5120/6438-8848,
author = { Khafaei Taleb, Khafaie Behzad },
title = { The Effect of Number of Hops per Path on Remind Energy in MANETs Routing Protocols },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 43 },
number = { 24 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 23-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume43/number24/6438-8848/ },
doi = { 10.5120/6438-8848 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:34:12.484447+05:30
%A Khafaei Taleb
%A Khafaie Behzad
%T The Effect of Number of Hops per Path on Remind Energy in MANETs Routing Protocols
%J International Journal of Computer Applications
%@ 0975-8887
%V 43
%N 24
%P 23-28
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In mobile ad hoc networks (MANETs), routing protocol acting the most important role. In the last decade, Ad hoc On-demand Distance Vector (AODV) routing protocol becomes the attention of focused research on MANETs worldwide. AODV and most of the on demand ad hoc routing protocols use single route reply along reverse path. Rapid change of topology causes that the route reply could not reach to the source node. This increases communication delay and power consumption as well as decrease in packet delivery ratio. To avoid these problems, a Reverse AODV (RAODV) was proposed which tries multiple route replies. Remained energy in RAODV is higher than AODV; even it has sent more data packets to destination. A simulation study is presented to compare number of hops in selected path along rout reply of these two protocols. Results shows in RAODV the data packets meet fewer hops in chosen path and this will effect on remind energy in RAODV to be higher than AODV.

References
  1. E. Perkins C. and M. Royer E. 1999, "Ad hoc on-demand distance vector routing," in Second IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), pp. 90-100.
  2. A. Nasipuri and R. Das S. 1999. "On-demand multi-path routing for mobile ad hoc network," in IEEE ICCCN'99, pp. 64-70.
  3. Li Zhi and K wok wong Yu K. 2005. "A new multipath routing approach to enhancing TCP security in ad hoc wireless networks," in International conference on parallel processing workshops, pp. 372-379.
  4. Y. Kim, J. Jung, S. Lee, and C. Kim 2006. "A Belt-Zone Method for Decreasing Control Message in Ad Hoc Networks," in International Conference on Computational Science and Application, pp. 64-72.
  5. Chonggun Kim, ElmurodTalipov, and ByoungchulAhn. 2006. "A Reverse AODV Routing Protocol in Ad Hoc Mobile Networks," in EUC Workshop, pp. 522-531.
  6. B. R. Arun Kumar, C. Reddy Lokanatha, and S. HiremathPrakash, "Mobile Ad Hoc Networks: Issues, Research Trends and Experiments," International Engineering & Technology Journal of Communication Techniques, vol. 2, no. 2, 2008, pp. 057-063.
  7. JayakumarGeetha and GenapathyGopinath, "Performance Comparison of Mobile Ad Hoc Network Routing Protocol," International Journal of Computer Science and Security, vol. 7, no. 11, 2007, pp. 77-84.
  8. HadiSargolzaey, AyyoubAkbariMoghanjoughi, and SabiraKhatun, "A Review and Comparison of Reliable Unicast Routing Protocols for Mobile Ad Hoc Networks," International Journal of Computer Science and Network Security, vol. 9, no. 1, 2009, pp. 186-196.
  9. Gorantala Krishna, 2006. Routing in Mobile Ad Hoc Networks. Sweden: Umea University.
  10. MeghanathanNatrajan, "A Location Prediction-Based Reactive Routing Protocol to Minimize the Number of Rout Discoveries and Hop Count per Path in Mobile Ad Hoc Networks," The Computer Journal, vol. 52, no. 4, 2009, pp. 461-482.
  11. M. Royer Elizabeth, Barbara Santa, and Toh Chai Keong, 1999. "A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks," IEEE Personal Communications, pp. 46-55.
  12. E. M. Royer and Charles E. Perkins. 1999 "Multicast Operation of the Ad-hoc On-Demand Distance Vector Routing Algorithm," in International Conference on Mobile Computing and Networking.
  13. E. Perkins C. and Bhagwat P. 1994. "Highly Dynamic Destination-Sequenced Distance-Vector (DSDV) Routing for Mobile Computers," in ACM SIGCOMM, London, pp. 234-244.
  14. P. Johnsson, T. Learsson, N. Hedman, B. Mielezarek, and M. Degermark. 1999. "Scenario-Based Performance Analysis of Routing Protocol for Mobile Ad Hoc Networks," in International Conference on Mobile Computing and Networking, pp. 195-206.
  15. BroustisIoannise, JakllariGentain, Repantis Thomas, and Molle Mart. 2006. "A Comprehensive Comparison of Routing Protocol for Larg-Scale Wireless MANETs," 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, pp. 951-956.
  16. R. Dube, C. D. Rais, K. Y. Wang, and S. K. Tripathi, "Signal Stability-Based Adaptive (SSA) Routing for Ad Hoc Mobile Networks," IEEE Personal Communications Magazine, vol. 4, no. 1, 1997, pp. 36-45.
  17. NS, The UCB/LBNL/VINT Network Simulator (NS), http://www. isi. edu/nsnam/ns/, 2004.
Index Terms

Computer Science
Information Sciences

Keywords

Number Of Hops In Path Remind Energy Aodv Routing Protocol Raodv Routing Protocol