ABSTRACT
An ad hoc wireless network is an autonomous self-organizing system ofmobile nodes connected by wireless links where nodes not in directrange can communicate via intermediate nodes. A common technique usedin routing protocols for ad hoc wireless networks is to establish therouting paths on-demand, as opposed to continually maintaining acomplete routing table. A significant concern in routing is theability to function in the presence of byzantine failures whichinclude nodes that drop, modify, or mis-route packets in an attempt todisrupt the routing service.We propose an on-demand routing protocol for ad hoc wireless networks that provides resilience to byzantine failures caused by individual or colluding nodes. Our adaptive probing technique detects a malicious link after log n faults have occurred, where n is the length of the path. These links are then avoided by multiplicatively increasing their weights and by using an on-demand route discovery protocol that finds a least weight path to the destination.
- J. Kurose and K. Ross, Computer Networking, a top down approach featuring the Internet. Addison-Wesley Longman, 2000. Google ScholarDigital Library
- C. E. Perkins and E. M. Royer, Ad hoc Networking, ch. Ad hoc On-Demand Distance Vector Routing. Addison-Wesley, 2000.Google Scholar
- D. B. Johnson, D. A. Maltz, and J. Broch, DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. in Ad Hoc Networking, ch. 5, pp. 139--172. Addison-Wesley, 2001. Google ScholarDigital Library
- Y.-C. Hu, A. Perrig, and D. B. Johnson, "Ariadne: A secure on-demand routing protocol for ad hoc networks," in The 8th ACM International Conference on Mobile Computing and Networking, September 2002. To appear. Google ScholarDigital Library
- J.-P. Hubaux, L. Buttyan, and S. Capkun, "The quest for security in mobile ad hoc networks," in The 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing, October 2001. Google ScholarDigital Library
- P. Zimmermann, The Official PGP User's Guide. MIT Press, 1995. Google ScholarDigital Library
- L. Zhou and Z. Haas, "Securing ad hoc networks," IEEE Network Magazine, vol. 13, November/December 1999.Google Scholar
- M. Brown, D. Cheung, D. Hankerson, J. Hernandez, M. Kirkup, and A. Menezes., "PGP in constrained wireless devices," in The 9th USENIX Security Symposium, USENIX, August 2000. Google ScholarDigital Library
- S. Yi, P. Naldurg, and R. Kravets, "Security-aware ad hoc routing for wireless networks," in The 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing, October 2001. Google ScholarDigital Library
- R. Hauser, T. Przygienda, , and G. Tsudik, "Reducing the cost of security in link-state routing," in Symposium of Network and Distributed Systems Security, 1997. Google ScholarDigital Library
- P. Papadimitratos and Z. Haas, "Secure routing for mobile ad hoc networks," in SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, pp. 27--31, January 2002.Google Scholar
- The Keyed-Hash Message Authentication Code (HMAC). No. FIPS 198, National Institute for Standards and Technology (NIST), 2002. http://csrc.nist.gov/publications/fips/index.html.Google Scholar
- Y.-C. Hu, D. B. Johnson, and A. Perrig, "SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks," in The 4th IEEE Workshop on Mobile Computing Systems and Applications, IEEE, June 2002. Google ScholarDigital Library
- C. E. 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, 1994. Google ScholarDigital Library
- A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient and secure source authentication for multicast," in Network and Distributed System Security Symposium, February 2001.Google Scholar
- B. Dahill, B. Levine, C. Shields, and E. Royer, "A secure routing protocol for ad hoc networks," Tech. Rep. 01-37, Department of Computer Science, University of Massachusetts, August 2001. Google ScholarDigital Library
- P. F. Syverson, D. M. Goldschlag, and M. G. Reed, "Anonymous connections and onion routing," in IEEE Symposium on Security and Privacy, 1997. Google ScholarDigital Library
- S. Marti, T. Giuli, K. Lai, and M. Baker, "Mitigating routing misbehavior in mobile ad hoc networks," in The 6th ACM International Conference on Mobile Computing and Networking, August 2000. Google ScholarDigital Library
- S. Cheung, "An efficient message authentication scheme for link state routing," in The 13th Annual Computer Security Applications Conference, pp. 90--98, December 1997. Google ScholarDigital Library
- K. Zhang, "Efficient protocols for signing routing messages," in Symposium on Networks and Distributed Systems Security, 1998.Google Scholar
- M. T. Goodrich, "Efficient and secure network routing algorithms." Provisional patent filing., January 2001.Google Scholar
- B. R. Smith, S. Murthy, and J. Garcia-Luna-Aceves, "Securing distance-vector routing protocols," in Symposium on Networks and Distributed Systems Security, 1997. Google ScholarDigital Library
- S. L. Murphy and M. R. Badger, "Digital signature protection of the OSPF routing protocol," in Symposium on Networks and Distributed Systems Security, 1996. Google ScholarDigital Library
- B. Smith and J. Garcia-Luna-Aceves, "Efficient security mechanisms for the border gateway routing protocol," Computer Communications (Elsevier), vol. 21, no. 3, pp. 203--210, 1998. Google ScholarDigital Library
- S. F. Wu, F. yi~Wang, B. M. Vetter, W. R. Cleaveland, Y. F. Jou, F. Gong, and C. Sargor, "Intrusion detection for link-state routing protocols," in IEEE Symposium on Security and Privacy, 1997.Google Scholar
- D. Qu, B. M. Vetter, F. Wang, R. Narayan, S. F. Wu, Y. F. Jou, F. Gong, and C. Sargor, "Statistical anomaly detection for link-state routing protocols," in IEEE Symposium on Security and Privacy (5 Minutes), May 1997.Google Scholar
- S. Wu, H. Chang, D. Qu, F. W. F. Jou, F. Gong, C. Sargor, and R. Cleaveland, "JiNao: Design and implementation of a scalable intrusion detection system for the OSPF routing protocol," Journal of Computer Networks and ISDN Systems, 1999.Google Scholar
- R. Perlman, Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, October 1988.Google Scholar
- S. Cheung and K. Levitt, "Protecting routing infrastructures from denial of service using cooperative intrusion detection," in New Security Paradigms Workshop, 1997. Google ScholarDigital Library
- K. A. Bradley, S. Cheung, N. Puketza, B. Mukherjee, and R. A. Olsson, "Detecting disruptive routers: A distributed network monitoring approach," in IEEE Symposium on Security and Privacy, 1998.Google Scholar
- ANSI/IEEE Std 802.11, 1999 Edition. 1999. http://standards.ieee.org/catalog/olis/lanman.html.Google Scholar
- V. Bharghavan, A. J. Demers, S. Shenker, and L. Zhang, "MACAW: A media access protocol for wireless LAN's," in SIGCOMM, pp. 212--225, 1994. Google ScholarDigital Library
- J. Stone and C. Partridge, "When the CRC and TCP checksum disagree," in ACM SIGCOM, August/September 2000. Google ScholarDigital Library
- W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. IT-22, pp. 644--654, November 1976.Google Scholar
- Secure Hash Standard (SHA1). No. FIPS 180-1, National Institute for Standards and Technology (NIST), 1995. http://www.itl.nist.gov/fipspubs/fip180-1.htm.Google Scholar
- Advanced Encryption Standard (AES). No. FIPS 197, National Institute for Standards and Technology (NIST), 2001. http://csrc.nist.gov/encryption/aes/.Google Scholar
Index Terms
An on-demand secure routing protocol resilient to byzantine failures
Recommendations
ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks
Ah hoc networks offer increased coverage by using multihop communication. This architecture makes services more vulnerable to internal attacks coming from compromised nodes that behave arbitrarily to disrupt the network, also referred to as Byzantine ...
Mobility assessment on-demand (MAOD) routing protocol for mobile ad hoc networks: Research Articles
In ad hoc wireless networks, the high mobility of hosts is usually a major reason for link failures. The general ‘shortest path’ based routing protocols may not lead to stable routes. In this paper, we propose a mobility assessment on-demand (MAOD) ...
A stable weight-based on-demand routing protocol for mobile ad hoc networks
A mobile ad hoc network (MANET) consists of a set of mobile hosts that can communicate with each other without the assistance of base stations. In MANETs, the high mobility of mobile nodes is a major reason for link failures. In this paper, we propose a ...
Comments