Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks
By Yih-Chun Hu, Adrian Perrig, David B. Johnson. ACM/IEEE International Conference on Mobile Computing and Networking, 2002
2,778 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/308ed89eb2677fc781c16562245b4d620e6077a5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Jean-Pierre Hubaux
- Adrian Perrig
- Srdjan Čapkun
- Peng Ning
- Jie Wu
- Levente Buttyán
- Yih-Chun Hu
- David B. Johnson
In Electrical and Electronic Engineering
- Jean-Pierre Hubaux
- Adrian Perrig
- Srdjan Čapkun
- Levente Buttyán
- Maxim Raya
- Radha Poovendran
- Jie Wu
- Edward W. Knightly
Citations in the corpus
- Mobility helps security in ad hoc networks (2003, background): “Some solutions to the routing-security interdependence problem were proposed by Hu, Perrig and Johnson [16].”
- IoT security: Review, blockchain solutions, and open challenges (2017, methodology): “Similarly, an ad hoc routing protocol [76] incorporating the symmetric cryptography based algorithms is designed for securing the nodes from the compromised wireless nodes in a network.”
- Implications of radio fingerprinting on the security of sensor networks (2007, methodology): “This can be achieved by manually pre-loading all keys into the nodes in a network setup phase, by probabilistic key pre-distribution schemes [12], [7], or through an on-line key distribution center [20].”
- Using Directional Antennas to Prevent Wormhole Attacks (2004, background): “Hence, location based routing protocols have the potential to prevent wormhole attacks [15].”
- How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols (2003, background): “Hu, Perrig, and Johnson [4] formalized an attack model using the number of compromised nodes and the number of compromised cryptographic keys.”
- Random key-assignment for secure Wireless Sensor Networks (2003, methodology): “The na¨ıve technique for implementing secure pair-wise communication is to assign a set of secret keys to each component of the group, each key of the set being shared with only one other member of the group.”
- Channel surfing and spatial retreats: defenses against wireless denial of service (2004, background): “As wireless progressively becomes ubiquitous, a.ordable, and part Permissiontomakedigitalorhardcopiesofallorpartofthisworkforpersonalorclassroomuseisgrantedwithoutfeeprovidedthatcopiesarenotmadeordistributedforpro.torcommercialadvantageandthatcopiesbearthisnoticeandthefullcitationonthe.rstpage.”
- Security in mobile ad hoc networks: challenges and solutions (2004, background): “For example, in the context of DSR [2], the attacker may modify the source route listed in the RREQ or RREP packets by deleting a node from the list, switching the order of nodes in the list, or appending a new node into the list [5].”
- A survey of security issues in mobile ad hoc and sensor networks (2005, background): “Most of the proposed solutions belonging to this class modify existing routing protocols to build authentication-based solutions [13, 16, 19, 22, 27].”
- A Survey of Solutions to the Sybil Attack (2006, background): “Ad hoc mobile network routing can be manipulated when a Sybil attacker appears to be many different mobile nodes at once [44].”
- Secure routing in wireless sensor networks: attacks and countermeasures (2003, background): “In the following sections we outline our assumptions about the underlying network, propose models for different classes of adversaries, and consider security goals in this setting.”
- Wireless mesh networks: a survey (2005, methodology): “The attacks may advertise routing updates in [ 60 ] and [145] for DSR and AODV, respectively.”