Rajiv K. Nekkanti
ABSTRACT
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already proposed, they are not efficient, in the sense that, they use the same kind of encryption algorithms (mostly high level) for every bit of routing information they pass from one intermediate node to another in the routing path. This consumes lot of energy/power as well as time. Our routing algorithm basically behaves depending upon the trust one node has on its neighbor. The trust factor and the level of security assigned to the information flow decide what level of encryption is applied to the current routing information at a source/intermediate node. In other words, above a certain level of trust level, there is no need for the source/intermediate node to perform high level encryption on the routing information as it completely trusts the neighboring node. So based on level of trust factor, the routing information will be low-level, medium level, high level encrypted, the low-level being normal AODV. This not only saves the node's power by avoiding unnecessary encoding, but also in terms of time, which is very much valuable in cases of emergencies where the information is as valuable as the time.
- NS-2 with Wireless and Mobility Extensions, available via website http://www.monarch.cs.cmu.eduGoogle Scholar
- http://moment.cs.ucsb.edu/AODV/aodv.htmlGoogle Scholar
- S. J. Lee, M. Gerla and C. K Toh. A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Netwroks, IEEE Network, Jul. 1999 Google ScholarDigital Library
- D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonymns, Communications of the ACM, 24(2):84--88, 1981 Google ScholarDigital Library
- M. K. Marina and S. R. Das. Ad Hoc On-demand Multipath Distance Vector Routing. In ICNP, Pages 14--23, 2001. Google ScholarDigital Library
- Onion Routing, http://www.onion-router.net/Google Scholar
- P. Papadimitratos and Z. Haas. Secure Routing for Mobile Ad Hoc Networks. Ins SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), 2002.Google Scholar
- S, Yi, P. Naldurg, R. Kavets. Security-Aware Ad Hoc Routing for Wireless Networks. Technical Reprt, UIUCDCS-R-2001-2241, UILU-ENG-2001-1748. Google ScholarDigital Library
- L. Zhou and Z. Hass. Securing Ad Hoc Networks. IEEE Network Magazine, 13(6), November, December 1999.Google Scholar
- Y. Zhang and W. Lee. Intrusion Detection in Wireless Ad-Hoc Networks, MOBICOM 2000. Google ScholarDigital Library
- S. Zhu, S. Xu, S. Setia, S. Jajodia. LHAP: A Lightweight Hop-by-Hop Authentication Protocol for Ad-Hoc Networks. George Mason University and University of California at Irvine.Google Scholar
- Marina Dupcinov, Srdjan Krco. Routing in ad hoc Networks, Technical Report, Applied Research Lab, EEI, Ericsson, Ireland, 2002.Google Scholar
- David B. Johnson, David A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, 1996.Google ScholarCross Ref
- Yin-Chun Hu, Adrian Perrig, David B. Johnson. Ariadne: A Secure On-Demand Routing Protocol for Ad-Hoc Networks, MOBICOM 2002. Google ScholarDigital Library
- J. Kong, Xiaoyan Hong. ANODR: Anonymous On Demand Routing with Untraceable Routes for Mobile Ad-Hoc Networks. MOBIHOC, June 2003. Google ScholarDigital Library
- Tom Goff, B. Nael, Abu-Ghazaleh, Dhananjay. S. Phatak and Ridvan Kahvecioglu, Preemptive Routing in Ad Hoc Networks. ACM SIGMOBILE, July, 2001. Google ScholarDigital Library
- J. Broch, D. A. Maltz, D. B. Johnson, Y-C. Hu, J. Jetcheva, A Performance Copmaprioson of Mulit-Hop Wireless Ad Hoc Routing Protocols, In the Proceedings of the 4th International Conference on Mobile Computing and Networking, ACM MOBICOM '98, pp. 85--97, Oct 1998. Google ScholarDigital Library
- Trust based adaptive on demand ad hoc routing protocol
Recommendations
Salvaging route reply for on-demand routing protocols in mobile ad-hoc networks
MSWiM '05: Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systemsOn-demand routing protocols are preferred in mobile ad hoc networks where resources such as energy and bandwidth are constrained. In these protocols, a source discovers a route to a destination typically by flooding the entire or a part of the network ...
Design of Redundant New Ad-Hoc On-Demand Distance Vector (NAODV) Routing Protocol Based on Congestion and Survival Control
In this paper a new ad-hoc on-demand distance vector (NAODV) routing protocol for mobile ad-hoc networks is presented. This takes into account local congestion of the network when choosing the route (selecting only the largest or shortest number of hops ...
Trust based secure routing in AODV routing protocol
IMSAA'09: Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applicationsMANET is a highly challenged network environment due to its special characteristics such as decentralization, dynamic topology and neighbor based routing. Each node in this network relays its neighbors for routing and message forwarding. Cooperation ...
Comments