Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A directionality based location discovery scheme for wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
The n-hop multilateration primitive for node localization problems
Mobile Networks and Applications
Proceedings of the 1st international conference on Embedded networked sensor systems
Organizing a global coordinate system from local information on an ad hoc sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A survey on clustering algorithms for wireless sensor networks
Computer Communications
An Optimal Algorithm for Minimizing Cluster Overlap of ACE
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Cooperative caching for homogeneous wireless sensor networks
International Journal of Communication Networks and Distributed Systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
L2GClust: local-to-global clustering of stream sources
Proceedings of the 2011 ACM Symposium on Applied Computing
On topology of sensor networks deployed for tracking
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Scalable localization in wireless sensor networks
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Using data aggregation to prevent traffic analysis in wireless sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
Sensor network localization continues to be an important research challenge. The goal of localization is to assign geographic coordinates to each node in the sensor network. Localization schemes for sensor network systems should work with inexpensive off-the-shelf hardware, scale to large networks, and also achieve good accuracy in the presence of irregularities and obstacles in the deployment area. We present a novel approach for localization that can satisfy all of these desired properties. Recent developments in sensor network clustering algorithms have resulted in distributed algorithms that produce highly regular clusters. We propose to make use of this regularity to inform our localization algorithm. The main advantages of our approach are that our protocol requires only three randomly-placed nodes that know their geographic coordinates, and does not require any ranging or positioning equipment (i.e., no signal strength measurement, ultrasound ranging, or directional antennas are needed). So far, only the DV-Hop localization mechanism worked with the same assumptions [1]. We show that our proposed approach may outperform DV-Hop in certain scenarios, in particular when there exist large obstacles in the deployment field, or when the deployment area is free of obstacles but the number of anchors is limited.