skip to main content
research-article

ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks

Published: 22 January 2008 Publication History

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.

References

[1]
The network simulator - ns2. http://www.isi.edu/nsnam/ns/.
[2]
1999a. IEEE Std 802.11a-1999. http://standards.ieee.org/.
[3]
1999b. IEEE Std 802.11b-1999. http://standards.ieee.org/.
[4]
AES. 2001. Advanced Encryption Standard. Number FIPS 197. National Institute for Standards and Technology (NIST). http://csrc.nist.gov/encryption/aes/.
[5]
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.
[6]
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.
[7]
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.
[8]
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.
[9]
Buttyan, L. and Hubaux, J.-P. 2003. Stimulating cooperation in self-organizing mobile ad hoc networks. Mob. Netw. Appl. 8, 5, 579--592.
[10]
Cheung, S. and Levitt, K. 1997. Protecting routing infrastructures from denial of service using cooperative intrusion detection. In New Security Paradigms Workshop.
[11]
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.
[12]
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.
[13]
Eriksson, J., Krishnamurthy, S.-V., and Faloutsos, M. 2006. Truelink: A practical countermeasure to the wormhole attack in wireless networks. Proc. of ICNP'06.
[14]
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).
[15]
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.
[16]
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).
[17]
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).
[18]
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).
[19]
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).
[20]
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).
[21]
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).
[22]
IEEE. 1999. IEEE Std 802.11, 1999 Edition. http://standards.ieee.org/catalog/olis/lanman.html.
[23]
Jakobsson, M., Wetzel, S., and Yener, B. 2003. Stealth attacks on ad-hoc wireless networks. In IEEE Vehicular Technology Conference.
[24]
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.
[25]
Kent, S., Lynn, C., and Seo, K. 2000. Secure border gateway protocol (s-bgp). IEEE Journal on Selected Areas in Communication 18, 4.
[26]
Kurose, J. and Ross, K. 2000. Computer Networking, A Top Down Approach Featuring the Internet. Addison-Wesley Longman, Reading, MA.
[27]
Lamport, L., Shostak, R., and Pease, M. 1982. The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3, 382--401.
[28]
Lee, H. I. 2002. Afora: Ad hoc routing in the face of misbehaving nodes. Master's Thesis, MIT.
[29]
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.
[30]
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).
[31]
Menezes, A., van Oorschot, P., and Vanstone, S. 1996. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL.
[32]
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.
[33]
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).
[34]
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.
[35]
Papadimitratos, P. and Haas, Z. 2003. Secure data transmission in mobile ad hoc networks. In Proceedings of ACM Workshop of Wireless Security (WiSe).
[36]
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).
[37]
Perkins, C. E. and Royer, E. M. 2000. Ad hoc Networking. Addison-Wesley, Reading, MA. Chapter Ad hoc On-Demand Distance Vector Routing.
[38]
Perlman, R. 1988. Network layer protocols with byzantine robustness. Ph.D. thesis, MIT LCS TR-429.
[39]
Perlman, R. 2005. Routing with byzantine robustness. Tech. Rep. TR-2005-146, Sun Microsystems.
[40]
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).
[41]
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.
[42]
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).
[43]
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).
[44]
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).
[45]
Syverson, P. F., Goldschlag, D. M., and Reed, M. G. 1997. Anonymous connections and onion routing. In IEEE Symposium on Security and Privacy.
[46]
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.
[47]
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.
[48]
Zhou, L. and Haas, Z. 1999. Securing ad hoc networks. IEEE Network Magazine 13, 6.
[49]
Zimmermann, P. 1995. The Official PGP User's Guide. MIT Press, Cambridge, MA.

Cited By

View all
  • (2025)Nicaea: A Byzantine Fault Tolerant Consensus Under Unpredictable Message Delivery Failures for Parallel and Distributed ComputingIEEE Transactions on Computers10.1109/TC.2024.350685674:3(915-928)Online publication date: Mar-2025
  • (2025)Secure Routing in Wireless Mesh NetworksEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_884(2251-2256)Online publication date: 8-Jan-2025
  • (2024)An On-Demand Fault-Tolerant Routing Strategy for Secure Key Distribution NetworkElectronics10.3390/electronics1303052513:3(525)Online publication date: 27-Jan-2024
  • Show More Cited By

Index Terms

  1. ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Transactions on Information and System Security
        ACM Transactions on Information and System Security  Volume 10, Issue 4
        January 2008
        192 pages
        ISSN:1094-9224
        EISSN:1557-7406
        DOI:10.1145/1284680
        Issue’s Table of Contents
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 22 January 2008
        Accepted: 01 November 2007
        Revised: 01 November 2006
        Received: 01 August 2005
        Published in TISSEC Volume 10, Issue 4

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. Ad hoc wireless networks
        2. byzantine failures
        3. on-demand routing
        4. security

        Qualifiers

        • Research-article
        • Research
        • Refereed

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)18
        • Downloads (Last 6 weeks)4
        Reflects downloads up to 15 Feb 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2025)Nicaea: A Byzantine Fault Tolerant Consensus Under Unpredictable Message Delivery Failures for Parallel and Distributed ComputingIEEE Transactions on Computers10.1109/TC.2024.350685674:3(915-928)Online publication date: Mar-2025
        • (2025)Secure Routing in Wireless Mesh NetworksEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_884(2251-2256)Online publication date: 8-Jan-2025
        • (2024)An On-Demand Fault-Tolerant Routing Strategy for Secure Key Distribution NetworkElectronics10.3390/electronics1303052513:3(525)Online publication date: 27-Jan-2024
        • (2023)FlipPath Game to Counter Stealthy Attacks in SDN-Based Tactical NetworksDecision and Game Theory for Security10.1007/978-3-031-50670-3_15(294-308)Online publication date: 29-Dec-2023
        • (2022)Quantized Impulsive Control of Linear Systems Under Bounded Disturbances and DoS AttacksIEEE Transactions on Control of Network Systems10.1109/TCNS.2021.30857599:2(993-1005)Online publication date: Jun-2022
        • (2022)Enhanced DDOS Attack Detection Algorithm to Increase Network Lifetime in Cloud Environment2022 8th International Conference on Advanced Computing and Communication Systems (ICACCS)10.1109/ICACCS54159.2022.9785314(1783-1787)Online publication date: 25-Mar-2022
        • (2022)Network-Level Adversaries in Federated Learning2022 IEEE Conference on Communications and Network Security (CNS)10.1109/CNS56114.2022.9947237(19-27)Online publication date: 3-Oct-2022
        • (2021)Secure Routing in Wireless Mesh NetworksEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-642-27739-9_884-2(1-6)Online publication date: 26-Jan-2021
        • (2020)Improved GNSS Localization and Byzantine Detection in UAV SwarmsSensors10.3390/s2024723920:24(7239)Online publication date: 17-Dec-2020
        • (2020)Stabilization of Networked Control Systems Under DoS Attacks and Output QuantizationIEEE Transactions on Automatic Control10.1109/TAC.2019.294909665:8(3560-3575)Online publication date: Aug-2020
        • Show More Cited By

        View Options

        Login options

        Full Access

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media