Abstract
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 attacks. In this work, we examine the impact of several Byzantine attacks performed by individual or colluding attackers. We propose ODSBR, the first on-demand routing protocol for ad hoc wireless networks that provides resilience to Byzantine attacks caused by individual or colluding nodes. The protocol uses an adaptive probing technique that detects a malicious link after log n faults have occurred, where n is the length of the path. Problematic links are avoided by using a route discovery mechanism that relies on a new metric that captures adversarial behavior. Our protocol never partitions the network and bounds the amount of damage caused by attackers. We demonstrate through simulations ODSBR's effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary's effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols.
- The network simulator - ns2. http://www.isi.edu/nsnam/ns/.Google Scholar
- 1999a. IEEE Std 802.11a-1999. http://standards.ieee.org/.Google Scholar
- 1999b. IEEE Std 802.11b-1999. http://standards.ieee.org/.Google Scholar
- AES. 2001. Advanced Encryption Standard. Number FIPS 197. National Institute for Standards and Technology (NIST). http://csrc.nist.gov/encryption/aes/.Google Scholar
- Awerbuch, B., Holmer, D., and Rubens, H. 2005. The medium time metric: High throughput route selection in multirate ad hoc wireless networks. Kluwer Mobile Networks and Applications (MONET) Journal, Special Issue on Internet Wireless Access: 802.11 and Beyond. Google Scholar
Digital Library
- Bradley, K. A., Cheung, S., Puketza, N., Mukherjee, B., and Olsson, R. A. 1998. Detecting disruptive routers: A distributed network monitoring approach. In Proceedings of IEEE Symposium on Security and Privacy.Google Scholar
- Brown, M., Cheung, D., Hankerson, D., Hernandez, J., Kirkup, M., and Menezes., A. 2000. PGP in constrained wireless devices. In Proceeding of USENIX Security Symposium. USENIX. Google Scholar
Digital Library
- Buchegger, S. and Boudec, J.-Y. L. 2002. Performance analysis of the CONFIDANT protocol (cooperation of nodes: Fairness in dynamic ad-hoc networks. In Proc. of MobiHoc. ACM, New York, 226--236. Google Scholar
Digital Library
- Buttyan, L. and Hubaux, J.-P. 2003. Stimulating cooperation in self-organizing mobile ad hoc networks. Mob. Netw. Appl. 8, 5, 579--592. Google Scholar
Digital Library
- Cheung, S. and Levitt, K. 1997. Protecting routing infrastructures from denial of service using cooperative intrusion detection. In New Security Paradigms Workshop. Google Scholar
Digital Library
- De Couto, D. S. J., Aguayo, D., Bicket, J., and Morris, R. 2003. A high-throughput path metric for multi-hop wireless routing. In Proceedings of ACM Annual International Conference of Mobile Computing (MOBICOM). San Diego, California. Google Scholar
Digital Library
- DSS. 2006. Digital Signature Standard. Number FIPS 186-3. National Institute for Standards and Technology (NIST). http://csrc.nist.gov/publications/drafts/fips_186-3/Draft-FIPS-186-3_March2006.pdf.Google Scholar
- Eriksson, J., Krishnamurthy, S.-V., and Faloutsos, M. 2006. Truelink: A practical countermeasure to the wormhole attack in wireless networks. Proc. of ICNP'06. Google Scholar
Digital Library
- Hauser, R., Przygienda, T., and Tsudik, G. 1997. Reducing the cost of security in link-state routing. In Proceedings of ISOC Symposium of Network and Distributed Systems Security (NDSS). Google Scholar
Digital Library
- HMAC. 2002. The Keyed-Hash Message Authentication Code. Number FIPS 198. National Institute for Standards and Technology (NIST). http://csrc.nist.gov/publications/fips/index.html.Google Scholar
- Hu, L. and Evans, D. 2004. Using directional antennas to prevent wormhole attacks. In Proceedings of ISOC Symposium of Network and Distributed Systems Security (NDSS).Google Scholar
- Hu, Y.-C., Johnson, D. B., and Perrig, A. 2002b. SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. In Proceedings of IEEE Workshop on Mobile Computing Systems and Applications (WMCSA). Google Scholar
Digital Library
- Hu, Y.-C., Perrig, A., and Johnson, D. B. 2002b. Ariadne: A secure on-demand routing protocol for ad hoc networks. In Proceedings of ACM Annual International Conference of Mobile Computing (MOBICOM). Google Scholar
Digital Library
- Hu, Y.-C., Perrig, A., and Johnson, D. B. 2003a. Packet leashes: A defense against wormhole attacks in wireless ad hoc networks. In Proceedings of IEEE Conference of the IEEE Communications Society (INFOCOMM).Google Scholar
- Hu, Y.-C., Perrig, A., and Johnson, D. B. 2003b. Rushing attacks and defense in wireless ad hoc network routing protocols. In Proceedings of ACM Workshop of Wireless Security (WiSe). Google Scholar
Digital Library
- Hubaux, J.-P., Buttyan, L., and Capkun, S. 2001. The quest for security in mobile ad hoc networks. In Proceedings of ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC). Google Scholar
Digital Library
- IEEE. 1999. IEEE Std 802.11, 1999 Edition. http://standards.ieee.org/catalog/olis/lanman.html.Google Scholar
- Jakobsson, M., Wetzel, S., and Yener, B. 2003. Stealth attacks on ad-hoc wireless networks. In IEEE Vehicular Technology Conference.Google Scholar
- Johnson, D. B., Maltz, D. A., and Broch, J. 2001. DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. in Ad Hoc Networking. Addison-Wesley, Reading, MA. Chapter 5, 139--172. Google Scholar
Digital Library
- Kent, S., Lynn, C., and Seo, K. 2000. Secure border gateway protocol (s-bgp). IEEE Journal on Selected Areas in Communication 18, 4. Google Scholar
Digital Library
- Kurose, J. and Ross, K. 2000. Computer Networking, A Top Down Approach Featuring the Internet. Addison-Wesley Longman, Reading, MA. Google Scholar
Digital Library
- Lamport, L., Shostak, R., and Pease, M. 1982. The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3, 382--401. Google Scholar
Digital Library
- Lee, H. I. 2002. Afora: Ad hoc routing in the face of misbehaving nodes. Master's Thesis, MIT.Google Scholar
- Lundgren, H., Nordström, E., and Tschudin, C. 2002. Coping with communication gray zones in ieee 802.11b based ad hoc networks. In Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WOWMOM). ACM Press, New York, 49--55. Google Scholar
Digital Library
- Marti, S., Giuli, T., Lai, K., and Baker, M. 2000. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of ACM Annual International Conference of Mobile Computing (MOBICOM). Google Scholar
Digital Library
- Menezes, A., van Oorschot, P., and Vanstone, S. 1996. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL. Google Scholar
Digital Library
- Michiardi, P. and Molva, R. 2002. CORE: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In Proc. of Sixth IFIP Communications and Multimedia Security Conference. Google Scholar
Digital Library
- Mizrak, A., Cheng, Y.-C., Marzullo, K., and Savage, S. 2005. Fatih: Detecting and isolating malicious routers. In Proceedings of International Conference on Dependable Systems and Networks (DSN). Google Scholar
Digital Library
- Papadimitratos, P. and Haas, Z. 2002. Secure routing for mobile ad hoc networks. In SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS). 27--31.Google Scholar
- Papadimitratos, P. and Haas, Z. 2003. Secure data transmission in mobile ad hoc networks. In Proceedings of ACM Workshop of Wireless Security (WiSe). Google Scholar
Digital Library
- Perkins, C. E. and Bhagwat, P. 1994. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM). Google Scholar
Digital Library
- Perkins, C. E. and Royer, E. M. 2000. Ad hoc Networking. Addison-Wesley, Reading, MA. Chapter Ad hoc On-Demand Distance Vector Routing.Google Scholar
- Perlman, R. 1988. Network layer protocols with byzantine robustness. Ph.D. thesis, MIT LCS TR-429.Google Scholar
- Perlman, R. 2005. Routing with byzantine robustness. Tech. Rep. TR-2005-146, Sun Microsystems. Google Scholar
Digital Library
- Perrig, A., Canetti, R., Song, D., and Tygar, D. 2001. Efficient and secure source authentication for multicast. In Proceedings of ISOC Symposium of Network and Distributed Systems Security (NDSS).Google Scholar
- Rivest, R. L., Shamir, A., and Adleman, L. M. 1978. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 2 (Feb.), 120--126. Google Scholar
Digital Library
- Sanzgiri, K., Dahill, B., Levine, B. N., Shields, C., and Belding-Royer, E. 2002. A secure routing protocol for ad hoc networks. In Proceedings of IEEE International Conference on Network Protocols (ICNP). Google Scholar
Digital Library
- Smith, B. R., Murthy, S., and Garcia-Luna-Aceves, J. 1997. Securing distance-vector routing protocols. In Proceedings of ISOC Symposium of Network and Distributed Systems Security (NDSS). Google Scholar
Digital Library
- Stone, J. and Partridge, C. 2000. When the CRC and TCP checksum disagree. In Proceedings of SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM). Google Scholar
Digital Library
- Syverson, P. F., Goldschlag, D. M., and Reed, M. G. 1997. Anonymous connections and onion routing. In IEEE Symposium on Security and Privacy. Google Scholar
Digital Library
- Theodorakopoulos, G. and Baras, J. S. 2004. Trust evaluation in ad-hoc networks. In Proc. of ACM Workshop on Wireless Security (WiSe '04). 1--10. Google Scholar
Digital Library
- Yoon, J., Liu, M., and Noble, B. D. 2003. Random waypoint considered harmful. In Proceedings of IEEE Conference of the IEEE Communications Society (INFOCOMM). San Francisco, CA.Google Scholar
- Zhou, L. and Haas, Z. 1999. Securing ad hoc networks. IEEE Network Magazine 13, 6. Google Scholar
Digital Library
- Zimmermann, P. 1995. The Official PGP User's Guide. MIT Press, Cambridge, MA. Google Scholar
Digital Library
Index Terms
ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks
Recommendations
An on-demand secure routing protocol resilient to byzantine failures
WiSE '02: Proceedings of the 1st ACM workshop on Wireless securityAn 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 ...
A framework of secure location service for position-based ad hoc routing
PE-WASUN '04: Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networksIn large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location information to make forwarding decisions. However, so far security issues ...
Local Repair Mechanisms for On-Demand Routing in Mobile Ad hoc Networks
PRDC '05: Proceedings of the 11th Pacific Rim International Symposium on Dependable ComputingWith the dynamic and mobile nature of ad hoc wireless networks, links may fail due to topological changes by mobile nodes. As the degree of mobility increases, the wireless network would suffer more link errors. Ad hoc routing protocols that use ...






Comments