Transitive Location Verification Algorithm in Location-Based Routing for Wireless Sensor Networks
Eyad S. Taqieddin, Fahed H. Awad and Sally M. Abdullah
In location-based routing, forwarding decisions depend on correct location information of the nodes. The existing location verification schemes suffer from high computational requirements and the need for additional equipment, which may limit their applicability. In this work, the Transitive Location Verification algorithm is proposed, which offers location verification along with good utilization of network resources. It is designed to eliminate the requirements that limit the applicability of location verification in WSNs, such as additional expensive hardware and the use of special nodes. Therefore, any node can play the role of the verifier without any impact on its normal operation; though with a slight overhead. As a result, the verifier nodes, and their locations, will differ with time such that a malicious node will not be able to fake its location. Two schemes are proposed for verification transition within the network: One-directional transition and Three-directional transition. The simulation results demonstrated that the proposed algorithm achieves high performance in terms of the percentage of nodes verified, the number of rounds, and the number of times the verification functionality is transferred.
Keywords: Location Verification; WSN; Transitive; Localization