| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Performance Comparison of Trust-Based Reactive Routing Protocols
June 2006 (vol. 5 no. 6)
pp. 695-710
Ad hoc networks, due to their improvised nature, are frequently established in insecure environments and hence become susceptible to attacks. These attacks are launched by participating malicious nodes against different network services. Routing protocols, which act as the binding force in these networks, are a common target of these nodes. A number of secure routing protocols have recently been proposed, which make use of cryptographic algorithms to secure the routes. However, in doing so, these protocols entail a number of prerequisites during both the network establishment and operation phases. In contrast, trust-based routing protocols locate trusted rather than secure routes in the network by observing the sincerity in participation by other nodes. These protocols thus permit rapid deployment along with a dynamically adaptive operation, which conforms with the current network situation. In this paper, we evaluate the performance of three trust-based reactive routing protocols in a network with varying number of malicious nodes. With the help of exhaustive simulations, we demonstrate that the performance of the three protocols varies significantly even under similar attack, traffic, and mobility conditions. However, each trust-based routing protocol has its own peculiar advantage making it suitable for application in a particular extemporized environment.
[1] 695 E.M. Royer and C.K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Comm. Magazine, vol. 6, no. 2, pp. 46-55, 1999.[2] S. Corson and J. Macker, “Mobile Ad Hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations,” IETF MANET, RFC 2501, 1999.[3] Y.C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proc. Eighth Ann. Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 12-23, 2002.[4] B. Dahill, B.N. Levine, E. Royer, and C. Shields, “A Secure Routing Protocol for Ad Hoc Networks,” Proc. Int'l Conf. Network Protocols (ICNP), pp. 78-87, 2002.[5] A.A. Pirzada and C. McDonald, “Secure Routing Protocols for Mobile Ad Hoc Wireless Networks,” Advanced Wired and Wireless Networks, 2004.[6] A.A. Pirzada and C. McDonald, “Establishing Trust in Pure Ad Hoc Networks,” Proc. 27th Australasian Computer Science Conf. (ACSC), vol. 26, pp. 47-54, 2004.[7] A.A. Pirzada and C. McDonald, “Kerberos Assisted Authentication in Mobile Ad Hoc Networks,” Proc. 27th Australasian Computer Science Conf. (ACSC), vol. 26, pp. 41-46, 2004.[8] D. Denning, “A New Paradigm for Trusted Systems,” Proc. ACM New Security Paradigms Workshop, pp. 36-41, 1993.[9] A.A. Pirzada, A. Datta, and C. McDonald, “Propagating Trust in Ad Hoc Networks for Reliable Routing,” Proc. Int'l Workshop Wireless Ad Hoc Networks (IWWAN), 2004.[10] A.A. Pirzada, A. Datta, and C. McDonald, “Trust Based Routing for Ad Hoc Wireless Networks,” Proc. IEEE Int'l Conf. Networks (ICON '04), pp. 326-330 2004.[11] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc. Sixth Ann. Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 255-265, 2000.[12] D.B. Johnson, D.A. Maltz, and Y. Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR),” IETF MANET, Internet Draft, 2003.[13] S. Buchegger and J. Boudec, “Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes— Fairness in Distributed Ad Hoc NeTworks,” Proc. IEEE/ACM Workshop Mobile Ad Hoc Networking and Computing (MobiHOC), pp. 226-236, 2002.[14] F. Stajano and R. Anderson, “The Resurrecting Duckling: Security Issues for Ad Hoc Wireless Networks,” Proc. Seventh Int'l Workshop Security Protocols, pp. 172-194, 1999.[15] S. Garfinkel, PGP: Pretty Good Privacy. O'Reilly and Assoc., 1995.[16] P. Michiardi and R. Molva, “CORE: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks,” Proc. IFIP TC6/TC11 Sixth Joint Working Conf. Comm. and Multimedia Security, pp. 107-121, 2002.[17] L. Buttyan and J. Hubaux, “Enforcing Service Availability in Mobile Ad Hoc WANs,” Proc. IEEE/ACM Workshop Mobile Ad Hoc Networking and Computing (MobiHOC), pp. 87-96, 2000.[18] L. Buttyan and J. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks,” Proc. ACM/Kluwer Mobile Networks and Applications (MONET), vol. 8, pp. 579-592, 2003.[19] C. Perkins, E. Belding-Royer, and S. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing,” IETF RFC 3591, 2003.[20] S.J. Lee and M. Gerla, “AODV-BR: Backup Routing in Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), pp. 1311-1316, 2000.[21] M.K. Marina and S.R. Das, “On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks,” Proc. Ninth Int'l Conf. Network Protocols (ICNP), pp. 14-23, 2001.[22] A. Nasipuri and S. Das, “On-Demand Multipath Routing for Mobile Ad Hoc Networks,” Proc. Eight Int'l Conf. Computer Comm. and Networks, pp. 64-70, 1999.[23] Y.C. Hu and D.B. Johnson, “Caching Strategies in On-Demand Routing Protocols for Wireless Ad Hoc Networks,” Proc. Sixth Ann. Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 231-242, 2000.[24] V. Park and S. Corson, “Temporally Ordered Routing Algorithm (TORA) Version 1 Functional Specification,” IETF MANET, Internet Draft, 2001.[25] E. Gafni and D. Bertsekas, “Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology,” IEEE Trans. Comm., vol. 29, no. 1, pp. 11-18, 1981.[26] M.S. Corson and A. Ephremides, “Lightweight Mobile Routing Protocol (LMR), A Distributed Routing Algorithm for Mobile Wireless Networks,” Wireless Networks, 1995.[27] S. Corson, S. Papademetriou, P. Papadopoulos, V. Park, and A. Qayyum, “Internet MANET Encapsulation Protocol (IMEP) specification,” IETF MANET, Internet Draft, 1999.[28] J. Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. Fourth Ann. Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 85-97, 1998.[29] A.A. Pirzada and C. McDonald, “Reliable Routing in Ad Hoc Networks Using Direct Trust Mechanisms,” Advances in Ad Hoc and Sensor Networks, Springer, 2006.[30] E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numerische Mathematik, pp. 83-89, 1959.[31] NS “The Network Simulator,” http://www.isi.edu/nsnamns/, 1989.[32] IEEE-Standard, “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications 802.11,” 1997.[33] A.S. Tanenbaum, Computer Networks, fourth ed. Prentice Hall, 2002.[34] W.H. Yuen and R.D. Yates, “Inter-Relationships of Performance Metrics and System Parameters in Mobile Ad Hoc Networks,” Proc. IEEE Military Comm. Conf. (MILCOM), vol. 1, pp. 519-524, 2002.[35] L. Feeney, “An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks,” Mobile Networks and Applications, vol. 6, no. 3, pp. 239-249, 2001.[36] Y.-B. Ko and N. Vaidya, “GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks,” Proc. Int'l Conf. Network Protocols (ICNP), pp. 240-250, 2000.
Index Terms:
Trust, security, ad hoc, network, protocol.
Citation:
Asad Amir Pirzada, Chris McDonald, Amitava Datta, "Performance Comparison of Trust-Based Reactive Routing Protocols," IEEE Transactions on Mobile Computing, vol. 5, no. 6, pp. 695-710, June 2006, doi:10.1109/TMC.2006.83