ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks. Awerbuch, B., Curtmola, R., Holmer, D., Nita-Rotaru, C., & Rubens, H. ACM Trans. Inf. Syst. Secur., 10(4):1\textendash35, ACM, New York, NY, USA, 2008. ![ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 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\textquoterights effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary\textquoterights effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols.
@article {1341892,
title = {ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks},
journal = {ACM Trans. Inf. Syst. Secur.},
volume = {10},
number = {4},
year = {2008},
pages = {1{\textendash}35},
publisher = {ACM},
address = {New York, NY, USA},
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{\textquoteright}s effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary{\textquoteright}s effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols.},
keywords = {ad-hoc networks, byzantine fault tolerance, on-demand routing, security model},
issn = {1094-9224},
doi = {10.1145/1284680.1341892},
url = {http://portal.acm.org/citation.cfm?id=1284680.1341892$\#$},
author = {Awerbuch, Baruch and Curtmola, Reza and Holmer, David and Nita-Rotaru, Cristina and Rubens, Herbert}
}
Downloads: 0
{"_id":"gsYbEkNnYLotRkZpj","bibbaseid":"awerbuch-curtmola-holmer-nitarotaru-rubens-odsbranondemandsecurebyzantineresilientroutingprotocolforwirelessadhocnetworks-2008","downloads":0,"creationDate":"2018-07-03T04:50:27.431Z","title":"ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks","author_short":["Awerbuch, B.","Curtmola, R.","Holmer, D.","Nita-Rotaru, C.","Rubens, H."],"year":2008,"bibtype":"article","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"article","type":"article","title":"ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks","journal":"ACM Trans. Inf. Syst. Secur.","volume":"10","number":"4","year":"2008","pages":"1\\textendash35","publisher":"ACM","address":"New York, NY, USA","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\\textquoterights effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary\\textquoterights effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols.","keywords":"ad-hoc networks, byzantine fault tolerance, on-demand routing, security model","issn":"1094-9224","doi":"10.1145/1284680.1341892","url":"http://portal.acm.org/citation.cfm?id=1284680.1341892$#$","author":[{"propositions":[],"lastnames":["Awerbuch"],"firstnames":["Baruch"],"suffixes":[]},{"propositions":[],"lastnames":["Curtmola"],"firstnames":["Reza"],"suffixes":[]},{"propositions":[],"lastnames":["Holmer"],"firstnames":["David"],"suffixes":[]},{"propositions":[],"lastnames":["Nita-Rotaru"],"firstnames":["Cristina"],"suffixes":[]},{"propositions":[],"lastnames":["Rubens"],"firstnames":["Herbert"],"suffixes":[]}],"bibtex":"@article {1341892,\n\ttitle = {ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks},\n\tjournal = {ACM Trans. Inf. Syst. Secur.},\n\tvolume = {10},\n\tnumber = {4},\n\tyear = {2008},\n\tpages = {1{\\textendash}35},\n\tpublisher = {ACM},\n\taddress = {New York, NY, USA},\n\tabstract = {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{\\textquoteright}s effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary{\\textquoteright}s effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols.},\n\tkeywords = {ad-hoc networks, byzantine fault tolerance, on-demand routing, security model},\n\tissn = {1094-9224},\n\tdoi = {10.1145/1284680.1341892},\n\turl = {http://portal.acm.org/citation.cfm?id=1284680.1341892$\\#$},\n\tauthor = {Awerbuch, Baruch and Curtmola, Reza and Holmer, David and Nita-Rotaru, Cristina and Rubens, Herbert}\n}\n","author_short":["Awerbuch, B.","Curtmola, R.","Holmer, D.","Nita-Rotaru, C.","Rubens, H."],"key":"1341892","id":"1341892","bibbaseid":"awerbuch-curtmola-holmer-nitarotaru-rubens-odsbranondemandsecurebyzantineresilientroutingprotocolforwirelessadhocnetworks-2008","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=1284680.1341892$#$"},"keyword":["ad-hoc networks","byzantine fault tolerance","on-demand routing","security model"],"downloads":0},"search_terms":["odsbr","demand","secure","byzantine","resilient","routing","protocol","wireless","hoc","networks","awerbuch","curtmola","holmer","nita-rotaru","rubens"],"keywords":["ad-hoc networks","byzantine fault tolerance","on-demand routing","security model"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}