Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
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
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Using proximity and quantized RSS for sensor localization in wireless networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
Distributed online localization in sensor networks using a moving target
Proceedings of the 3rd international symposium on Information processing in sensor networks
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
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
Relative location estimation in wireless sensor networks
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
We present two distributed algorithms for localizing sensor nodes of a wireless sensor network. Our algorithms determine locations of nodes based on the connectivity between nodes. The basic idea behind our algorithms is to estimate distances between nearby nodes by counting their common neighbors. We analyze the performance of our algorithms experimentally. The results of experiments show that our algorithms achieve performance improvements upon the existing algorithms.