A secure positioning algorithm against Sybil attack in wireless sensor networks based on number allocating
Authors:
- 1 October 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 932-936
Abstract
In the process of locating in wireless sensor networks, the illegal nodes through Sybil attack can act as anchor nodes by capturing or constructing fake nodes, and further send the wrong location reference information. Considering the nodes through Sybil attack must first pass the neighbor's discovery and identification processes, we propose a secure positioning algorithm based on number allocating and mutual guarantee relying on neighbors. If the declaration number, the guaranteed node and its own ID of a node aren't completely matching, then the neighbors refuse the node to enter the network. The scheme also adopts the authentication mechanism of one-way hash function. There's no need for base station or cluster heads, so we achieve fast, lightweight and high detection rate secure localization. Compared with similar literature, this secure algorithm has a higher detection rate and positioning accuracy, and the communication cost is smaller.Keywords
This publication has 6 references indexed in Scilit:
- A lightweight Sybil attack detection framework for Wireless Sensor Networks2014
- Defending Sybil attacks based on neighboring relations in wireless sensor networksSecurity and Communication Networks, 2010
- An RSSI-based Scheme for Sybil Attack Detection in Wireless Sensor Networks2006
- Secure positioning in wireless networksIEEE Journal on Selected Areas in Communications, 2006
- SeRLoc2004
- LEAP2003