5th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing

Research Article

SECUND: A protocol for SECUre neighborhooD creation in wireless ad hoc networks

Download114 downloads
  • @INPROCEEDINGS{10.4108/ICST.COLLABORATECOM2009.8380 ,
        author={Thaier Hayajneh and Prashant Krishnamurthy and David Tipper},
        title={SECUND: A protocol for SECUre neighborhooD creation in wireless ad hoc networks},
        proceedings={5th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing},
        proceedings_a={COLLABORATECOM},
        year={2010},
        month={5},
        keywords={Ad hoc networks Authentication Cryptographic protocols Cryptography Hardware Jamming Mobile ad hoc networks Routing protocols Wireless application protocol Wireless sensor networks},
        doi={10.4108/ICST.COLLABORATECOM2009.8380 }
    }
    
  • Thaier Hayajneh
    Prashant Krishnamurthy
    David Tipper
    Year: 2010
    SECUND: A protocol for SECUre neighborhooD creation in wireless ad hoc networks
    COLLABORATECOM
    ICST
    DOI: 10.4108/ICST.COLLABORATECOM2009.8380
Thaier Hayajneh1,*, Prashant Krishnamurthy1,*, David Tipper1,*
  • 1: University of Pittsburgh, Pittsburgh, PA, USA
*Contact email: hayajneh@sis.pitt.edu, prashant@sis.pitt.edu, dtipper@sis.pitt.edu

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.