Name
Abstract | ||
|---|---|---|
The ability to correctly determine their neighborhood is a fundamental requirement for nodes in ad hoc and sensor networks. Many applications, protocols, and system functionality rely on neighborhood discovery. Malicious nodes that taint neighborhood information using wormholes can significantly disrupt the operation of ad hoc networks. Protocols that depend only on cryptographic techniques (e.g, authentication and encryption) may not be able to detect or prevent such attacks. In this paper we propose SECUND, a protocol for creating a SECUre NeighborhooD, that makes use of discrepancies in routing hop count information to detect ¿true¿ neighbors and remove those links to nodes that appear to be neighbors, but are really not neighbors. SECUND is simple, localized and needs no special hardware, localization, or synchronization. We present approaches to improve the efficiency of the process. We evaluate SECUND using simulations and we demonstrate its effectiveness in the presence of multiple and multi-ended wormholes. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.4108/ICST.COLLABORATECOM2009.8380 | Washington, DC |
Keywords | Field | DocType |
authentication,hardware,ad hoc networks,cryptography,wireless sensor networks,mobile ad hoc networks,wireless application protocol,sensor network,ad hoc network,wireless ad hoc network,routing protocols,cryptographic protocols | Mobile ad hoc network,Link-state routing protocol,Computer science,Computer network,Wireless Routing Protocol,Ad hoc wireless distribution service,Optimized Link State Routing Protocol,Wireless ad hoc network,Geocast,Vehicular ad hoc network,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-963-9799-76-9 | 2 | 0.39 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thaier Hayajneh | 1 | 2 | 0.39 |
| Prashant Krishnamurthy | 2 | 2 | 0.39 |
| David Tipper | 3 | 2 | 0.39 |