CFP last date
20 May 2024
Reseach Article

Article:Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT

by R. S. Mangrulkar, Pallavi V Chavan, S. N. Dagadkar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Number 10
Year of Publication: 2010
Authors: R. S. Mangrulkar, Pallavi V Chavan, S. N. Dagadkar
10.5120/1282-1657

R. S. Mangrulkar, Pallavi V Chavan, S. N. Dagadkar . Article:Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT. International Journal of Computer Applications. 7, 10 ( October 2010), 36-39. DOI=10.5120/1282-1657

@article{ 10.5120/1282-1657,
author = { R. S. Mangrulkar, Pallavi V Chavan, S. N. Dagadkar },
title = { Article:Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT },
journal = { International Journal of Computer Applications },
issue_date = { October 2010 },
volume = { 7 },
number = { 10 },
month = { October },
year = { 2010 },
issn = { 0975-8887 },
pages = { 36-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume7/number10/1282-1657/ },
doi = { 10.5120/1282-1657 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:55:58.594802+05:30
%A R. S. Mangrulkar
%A Pallavi V Chavan
%A S. N. Dagadkar
%T Article:Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT
%J International Journal of Computer Applications
%@ 0975-8887
%V 7
%N 10
%P 36-39
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

An ad-hoc network comprises of mobile nodes that cooperate with each other using wireless connections to route both data and control packets within the network. They are characterized by the use of wireless links, dynamically changing topology, multi-hop connectivity and decentralized routing mechanism and decision-making. The performance of Ad-hoc On Demand Vector (AODV) protocols has been modified by including the source route accumulation feature. As low transmission power of each ad-hoc node limits its communication range, the nodes must assist and trust each other in forwarding packets from one node to another. However, this implied trust relationship can be threatened by malicious nodes that may fabricate, modify or disrupt the orderly exchange of packets. Security demands that all packets be authenticated before being used. A particularly hard problem is to provide efficient broadcast authentication, which is important mechanism for MaNet. In this paper, we propose a routing algorithm which adds a field in request packet which stores trust value indicating node trust on neighbour. Based on level of trust factor, the routing information will be transmitted depending upon highest trust value among all. This not only saves the node’s power by avoiding unnecessary transmitting control information but also in terms of bandwidth (channel utilization), which is very important in case of MaNet. The malicious node can attack on the control packet and misbehave in the network .The malicious node, which may or may not be trusted node. In this paper, we use trusted path irrespective of shortest or longest path which can be used for communication in the network. We are able to calculate route trust value on the complete reply path which can be utilized by source node for next forthcoming communication in the network.

References
  1. P Narayan, V R. Syrotiuk ,“Evaluation of the AODV and DSR Routing Protocols Using the MERIT Tool,” in the proceeding or ADHOC-NOW in the year of 2004.
  2. B. Murthi, “AODV routing protocol” in book on mobile communication , 2000.
  3. Ariadne, “A Secure On-Demand Routing Protocol for Ad-Hoc Networks” in the proceeding of MOBICOM, 2003.
  4. G. Theodorakopoulos and J. S. Baras , “Trust evaluation in ad-hoc networks,” in Proceedings of the ACM Workshop on Wireless Security (WiSE’04) , Oct. 2004.
  5. M. Virendra, M. Jadliwala, M. Chandrasekaran, S. Upadhyaya , “Quantifying Trust in Ad-Hoc Networks” in the Proceedings of IEEE international Conference on Integration of Knowledge Intensive Multi- Agent systems (KIMAS), 2005.
  6. Y. L. Sun, Z. Han, W. Yu and K. J. R. Liu ,“A Trust Evaluation Framework in Distributed Networks: Vulnerability Analysis and Defense against Attacks” in the proceeding of IEEE INFOCOM , 2006.
  7. A. Perrig, J. Stankovic,D. Wagner ,“ Security in Wireless Sensor Networks” in the proceeding of Communication of the ACM, June 2005.
  8. Kamal Deep Mekaetal ,“ Trust Based Routing Decisions In Mobile Ad Hoc Networks,” in the proceeding of The Second Secure Knowledge Management Workshop (SKM),2006.
  9. Zheng Yan and Peng Zhang, “Trust Evaluation Based Security Solution in Ad-hoc Networks” 2000.
  10. “An implementation study of the AODV routing protocol” by
  11. Elizabeth. M. Royer and Charles. E. Pekins. , “Ad hoc on-demand distance vector routing” 2000.
  12. X. Li, M. R. Lyu, J. Liu ,“A Trust Model Based Routing Protocol for Secure Ad Hoc Networks” in the Proceedings of IEEE Aerospace Conference (IEEEAC)in the year of 2004.
  13. M. G. Zapata and N. Asokan, “Securing Ad hoc Routing Protocol” in the proceeding of 3rd ACM workshop on Wireless Security in the year of 2002.
  14. Most of the NS2 source code is in c++, www.isi.edu.
  15. A. Pirzada, C. McDonald ,“Establishing Trust In Pure Ad-hoc Networks”, in the Proceedings of the 27th conference on Australasian computer science, 2004.
Index Terms

Computer Science
Information Sciences

Keywords

Ad-hoc AODV Route trust MaNet Malicious node