Article

An on-demand secure routing protocol resilient to byzantine failures

Authors:

Baruch Awerbuch,

Cristina Nita-Rotaru,

Herbert RubensAuthors Info & Claims

WiSE '02: Proceedings of the 1st ACM workshop on Wireless security

Pages 21 - 30

https://doi.org/10.1145/570681.570684

Published: 28 September 2002 Publication History

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.

References

[1]

J. Kurose and K. Ross, Computer Networking, a top down approach featuring the Internet. Addison-Wesley Longman, 2000.

Digital Library

[2]

C. E. Perkins and E. M. Royer, Ad hoc Networking, ch. Ad hoc On-Demand Distance Vector Routing. Addison-Wesley, 2000.

[3]

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.

Digital Library

[4]

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.

Digital Library

[5]

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.

Digital Library

[6]

P. Zimmermann, The Official PGP User's Guide. MIT Press, 1995.

Digital Library

[7]

L. Zhou and Z. Haas, "Securing ad hoc networks," IEEE Network Magazine, vol. 13, November/December 1999.

[8]

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.

Digital Library

[9]

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.

Digital Library

[10]

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.

Digital Library

[11]

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.

[12]

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.

[13]

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.

Digital Library

[14]

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.

Digital Library

[15]

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.

[16]

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.

Digital Library

[17]

P. F. Syverson, D. M. Goldschlag, and M. G. Reed, "Anonymous connections and onion routing," in IEEE Symposium on Security and Privacy, 1997.

Digital Library

[18]

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.

Digital Library

[19]

S. Cheung, "An efficient message authentication scheme for link state routing," in The 13th Annual Computer Security Applications Conference, pp. 90--98, December 1997.

Digital Library

[20]

K. Zhang, "Efficient protocols for signing routing messages," in Symposium on Networks and Distributed Systems Security, 1998.

[21]

M. T. Goodrich, "Efficient and secure network routing algorithms." Provisional patent filing., January 2001.

[22]

B. R. Smith, S. Murthy, and J. Garcia-Luna-Aceves, "Securing distance-vector routing protocols," in Symposium on Networks and Distributed Systems Security, 1997.

Digital Library

[23]

S. L. Murphy and M. R. Badger, "Digital signature protection of the OSPF routing protocol," in Symposium on Networks and Distributed Systems Security, 1996.

Digital Library

[24]

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.

Digital Library

[25]

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.

[26]

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.

[27]

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.

[28]

R. Perlman, Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, October 1988.

[29]

S. Cheung and K. Levitt, "Protecting routing infrastructures from denial of service using cooperative intrusion detection," in New Security Paradigms Workshop, 1997.

Digital Library

[30]

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.

[31]

ANSI/IEEE Std 802.11, 1999 Edition. 1999. http://standards.ieee.org/catalog/olis/lanman.html.

[32]

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.

Digital Library

[33]

J. Stone and C. Partridge, "When the CRC and TCP checksum disagree," in ACM SIGCOM, August/September 2000.

Digital Library

[34]

W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. IT-22, pp. 644--654, November 1976.

[35]

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.

[36]

Advanced Encryption Standard (AES). No. FIPS 197, National Institute for Standards and Technology (NIST), 2001. http://csrc.nist.gov/encryption/aes/.

Cited By

Kang MLin ZSun JXiao CLi BSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Certifiably byzantine-robust federated conformal predictionProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692996(23022-23057)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692996
Bromberg YDecouchant JSourisseau MTaïani F(2024)Partition Detection in Byzantine Networks2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS60910.2024.00022(139-150)Online publication date: 23-Jul-2024
https://doi.org/10.1109/ICDCS60910.2024.00022
Shanmugavel DSolorza‐Feria OKamaraj S(2024) Agriculture‐based Crop in PMFCs for the Futuristic Sustainable Protected Agriculture Photosynthesis‐Assisted Energy Generation10.1002/9781394172337.ch15(337-356)Online publication date: 15-Mar-2024
https://doi.org/10.1002/9781394172337.ch15
Show More Cited By

Index Terms

An on-demand secure routing protocol resilient to byzantine failures
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
  2. Network types
    1. Mobile networks
    2. Wireless access networks

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

Information & Contributors

Information

Published In

cover image ACM Conferences

WiSE '02: Proceedings of the 1st ACM workshop on Wireless security

September 2002

100 pages

ISBN:1581135858

DOI:10.1145/570681

Conference Chairs:
Douglas Maughan
Defense Advanced Research Projects Agency
,
Nitin H. Vaidya
University of Illinois at Urbana-Champaign

Copyright © 2002 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 September 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

WiSe02

Sponsor:

WiSe02: Workshop on Wireless Security 2002 ( co-located with MobiCom 2002 Conference)

September 28, 2002

GA, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 10 of 41 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

308
Total Citations
View Citations
1,991
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kang MLin ZSun JXiao CLi BSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Certifiably byzantine-robust federated conformal predictionProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692996(23022-23057)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692996
Bromberg YDecouchant JSourisseau MTaïani F(2024)Partition Detection in Byzantine Networks2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS60910.2024.00022(139-150)Online publication date: 23-Jul-2024
https://doi.org/10.1109/ICDCS60910.2024.00022
Shanmugavel DSolorza‐Feria OKamaraj S(2024) Agriculture‐based Crop in PMFCs for the Futuristic Sustainable Protected Agriculture Photosynthesis‐Assisted Energy Generation10.1002/9781394172337.ch15(337-356)Online publication date: 15-Mar-2024
https://doi.org/10.1002/9781394172337.ch15
Anil DAzmat APatil Y(2023)Security issues in wireless sensor networksi-manager’s Journal on Wireless Communication Networks10.26634/jwcn.11.2.1978011:2(32)Online publication date: 2023
https://doi.org/10.26634/jwcn.11.2.19780
Xu MZhao FZou YLiu CCheng XDressler F(2023)BLOWN: A Blockchain Protocol for Single-Hop Wireless Networks Under Adversarial SINRIEEE Transactions on Mobile Computing10.1109/TMC.2022.316211722:8(4530-4547)Online publication date: 1-Aug-2023
https://doi.org/10.1109/TMC.2022.3162117
Khalifa T(2023)Trust-Based Incremental Security Strategy for Wireless Sensor Networks2023 International Conference on Electrical, Computer and Energy Technologies (ICECET)10.1109/ICECET58911.2023.10389308(1-8)Online publication date: 16-Nov-2023
https://doi.org/10.1109/ICECET58911.2023.10389308
Gupta SShahid MGoyal ASaxena RSaluja K(2022)Black Hole Detection and Prevention Using Digital Signature and SEP in MANET2022 10th International Conference on Emerging Trends in Engineering and Technology - Signal and Information Processing (ICETET-SIP-22)10.1109/ICETET-SIP-2254415.2022.9791738(1-5)Online publication date: 29-Apr-2022
https://doi.org/10.1109/ICETET-SIP-2254415.2022.9791738
Ferrag MAbdelaziz Amara korba (2021)Achieving Secure and Privacy-Preserving in Mobile Social NetworksResearch Anthology on Securing Mobile Technologies and Applications10.4018/978-1-7998-8545-0.ch021(380-412)Online publication date: 2021
https://doi.org/10.4018/978-1-7998-8545-0.ch021
Ning ZShi WXiao LLiang WWeng T(2021)A novel approach for anti-pollution attacks in network codingConnection Science10.1080/09540091.2020.1841109(1-16)Online publication date: 2-Apr-2021
https://doi.org/10.1080/09540091.2020.1841109
Mohanapriya MSanthosh R(2021)Detection and elimination of black hole attacks in mobile ad hoc networksMaterials Today: Proceedings10.1016/j.matpr.2021.02.169Online publication date: Mar-2021
https://doi.org/10.1016/j.matpr.2021.02.169
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents