Email this article 
Open Access
Subscription or Fee Access
Implementation of Performance Evaluation Methodologies for the Ad-hoc On-Demand Distance Vector Routing Protocols
Abstract
Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues into account. Subsequent proposals used strong cryptographic methods to secure the routing information. In this paper, we give the comparison SAODV and TAODV, two MANET routing protocols, which address routing security through cryptographic and trust-based means respectively. In this work, we have compared the SAODV and TAODV protocols for securing ad-hoc network routing. We presented the results of implementation and evaluation of both protocols. The expected difference between the two protocols was shown to be consistent with this real world scenario. It shows that SAODV is indeed a significantly more expensive than TAOAV protocol. These experiments showed that there is significant room between the two protocols for a secure hybrid protocol to be developed which takes advantage of the strongest points of both.
Keywords
References
Jared Cordasco and Susanne Wetze, “Cryptographic vs. Trust-based Methods for MANET Routing Security”, December 2007
C. E. Perkins and E. M. Royer, “Ad-hoc On-Demand Distance Vector Routing. Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications”, page 90, 1999.
C. N.-R. Baruch Awerbuch, David Holmer and H. Rubens. An on-demand secure routing protocol
S. Buchegger and J.-Y. L. Boudec. Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks. In Proceedings of the Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing. IEEE Computer Society, January 2002.
M Y. Hu, D. Johnson, and A. Perrig. SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. Ad Hoc Networks, I:175–192, 2003.
S. Marti, T. J. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Mobile Computing and Networking, 2000.
A. Perrig, R. Szewczyk, V. Wen, D. E. Culler, and J. D. Tygar. SPINS: security protocols for sensor netoworks. In Mobile Computing and Networking, 2001.
S. Yi, P. Naldurg, and R. Kravets. Security-aware ad hoc routing for wireless networks. In MobiHoc ’01: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, pages 299–302, New York, NY, USA, 2001. ACM Press.
M. G. Zapata and N. Asokan. Securing ad hoc routing protocols. In WiSE ’02: Proceedings of the ACM workshop on Wireless security. ACM Press, 2002.
L. Zhou and Z. J. Haas. Securing ad hoc networks. IEEE Network, 13(6):24–30, 1999.
M. Jakobsson, S. Wetzel, and B. Yener. Stealth attacks on ad hoc wireless networks. In Proceedings of VTC, 2003, 2003.
K. Meka, M. Virendra, and S. Upadhyaya, “Trust Based Routing Decisions in Mobile Ad-hoc Networks”, 2006
C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, pages 234–244, 1994.
D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.
N. Pissinou, T. Ghosh, and K. Makki. Collaborative trust-based secure routing in multihop ad hoc networks. In NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, 2004.
T. Ghosh, N. Pissinou, and K. Makki. Collaborative trust-based secure routing against colluding malicious nodes in multi-hop ad hoc networks. In LCN ’04: Proceedings of the 29th Annual IEEE
X. Li, M. Lyu, and J. Liu. A trust model based routing protocol for secure ad hoc networks. In Proceedings of the Aerospace Conference, 2004
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.