MSN: mutual secure neighbor verification in multi-hop wireless networks

In a wireless network, mutual secure neighbor verification (MSN) is defined as the capability of a node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. This problem has received great attention because it has numerous practical applications. Current state‐of‐the‐art approaches to solve this problem, such as the use of time of flight, signal strength, and angle of arrival, suffer from impracticality in terms of application and computation cost. In this work, we propose two algorithms to mitigate the MSN problem during the incremental deployment phase of static senor networks. Each node should announce its location and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. The simulation results show that we can achieve high detection (>90%) of nodes that forge their location information using either high power transmission or by colluding with other malicious nodes. Copyright © 2011 John Wiley & Sons, Ltd. In this paper, we propose two algorithms that provide secure mutual neighbor verification of neighborhood membership (MSN) between an old and a newly deployed nodes in wireless sensor networks. Each node announces its location and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. The simulation and analysis results show that MSN can achieve high detection (> 90%) of nodes that forge their location information.