Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The official PGP user's guide
Protecting routing infrastructures from denial of service using cooperative intrusion detection
NSPW '97 Proceedings of the 1997 workshop on New security paradigms
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
When the CRC and TCP checksum disagree
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Computer Networking: A Top-Down Approach Featuring the Internet Package
Computer Networking: A Top-Down Approach Featuring the Internet Package
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Coping with communication gray zones in IEEE 802.11b based ad hoc networks
WOWMOM '02 Proceedings of the 5th ACM international workshop on Wireless mobile multimedia
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Reducing The Cost Of Security In Link-State Routing
SNDSS '97 Proceedings of the 1997 Symposium on Network and Distributed System Security
Securing Distance-Vector Routing Protocols
SNDSS '97 Proceedings of the 1997 Symposium on Network and Distributed System Security
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Rushing attacks and defense in wireless ad hoc network routing protocols
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Secure data transmission in mobile ad hoc networks
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
Trust evaluation in ad-hoc networks
Proceedings of the 3rd ACM workshop on Wireless security
Fatih: Detecting and Isolating Malicious Routers
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks
Mobile Networks and Applications
PGP in constrained wireless devices
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
TrueLink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Routing with Byzantine robustness
Routing with Byzantine robustness
Secure Border Gateway Protocol (S-BGP)
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Mitigating attacks against virtual coordinate based routing in wireless sensor networks
WiSec '08 Proceedings of the first ACM conference on Wireless network security
MISPAR: mitigating stealthy packet dropping in locally-monitored multi-hop wireless ad hoc networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Secure network coding for wireless mesh networks: Threats, challenges, and directions
Computer Communications
Secure and robust virtual coordinate system in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
MPC: mitigating stealthy power control attacks in wireless ad hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Castor: scalable secure routing for ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Practical defenses against pollution attacks in wireless network coding
ACM Transactions on Information and System Security (TISSEC)
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
Hash chains at the basis of a secure reactive routing protocol
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Adversarial testing of wireless routing implementations
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Secure scheme against data dropping
Proceedings of the 16th Communications & Networking Symposium
Cross-layer metrics for reliable routing in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
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.