GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd 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
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
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
Botanical computing: a developmental approach to generating interconnect topologies on an amorphous computer
Programmable self-assembly: constructing global shape using biologically-inspired local interactions and origami mathematics
The n-hop multilateration primitive for node localization problems
Mobile Networks and Applications
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
Fidelity and yield in a volcano monitoring sensor network
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Using Network Density as a New Parameter to Estimate Distance
ICN '08 Proceedings of the Seventh International Conference on Networking
Query Processing in Sensor Networks
IEEE Pervasive Computing
Radio propagation-aware distance estimation based on neighborhood comparison
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
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
GDE: a distributed gradient-based algorithm for distance estimation in large-scale networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
A survey of geocast routing protocols
IEEE Communications Surveys & Tutorials
The challenges of building mobile underwater wireless networks for aquatic applications
IEEE Network: The Magazine of Global Internetworking
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
Distributed localization algorithms for nodes in ad hoc networks are essential for many applications. A major task when localizing nodes is to accurately estimate distances. So far, distance estimation is often based on counting the minimum number of nodes on the shortest routing path (hop count) and presuming a fixed width for one hop. This is prone to error as the length of one hop can vary significantly. In this paper, a distance estimation method is proposed, which relies on the number of shared communication neighbors and applies geometric properties to the network structure. It is shown that the geometric approach provides reliable estimates for the distance between any two adjacent nodes in a network. Experiments reveal that the estimation has less relative percentage error compared to a hop based algorithm in networks with different node distributions.