Computational geometry: an introduction
Computational geometry: an introduction
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Coordinated sensor deployment for improving secure communications and sensing coverage
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Impact of Sensing Coverage on Greedy Geographic Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
VigilNet: An integrated sensor network system for energy-efficient surveillance
ACM Transactions on Sensor Networks (TOSN)
Distance based decision fusion in a distributed wireless sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Locating objects in a sensor grid
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Localization control to locate mobile sensors
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
Localization is an important issue for Wireless Sensor Networks (WSN). We consider a WSN consisting of identical sensors. All known distances between the sensors are assumed to be less than the communication range of the sensors and all unknown distances greater. We also assume that the communication range is at least twice as much as the sensing range. Every point in the field of interest is assumed to be within the sensing zone of some sensor. Under this model, we propose an anchor-free length-based localization algorithm. The worst case time complexity of the algorithm is O (|E|) (where E is the set of edges of the network graph). We carry out simulation studies to observe that under uniform distribution, the number of edges is actually much lower than n2, if just about enough sensors are deployed to cover the total field. We prove that, under this model, the solution to the localization problem is unique. We also provide a simple technique for verifying the assumption that all points in the field are covered.