The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The cricket compass for context-aware mobile applications
Proceedings of the 7th 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
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Self-configuring localization systems: Design and Experimental Evaluation
ACM Transactions on Embedded Computing Systems (TECS)
Node Localization Using Mobile Robots in Delay-Tolerant Sensor Networks
IEEE Transactions on Mobile Computing
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
A model for detecting "global footprint anomalies" in a grid environment
PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
Hi-index | 0.00 |
Localization in mobile ad hoc networks (MANETs) is the process of fixing the position of a node according to some real or virtual coordinate system. In many cases, solutions like Global Positioning System (GPS) are not feasible. As a result, several algorithms have been developed for localization based purely on local communication. However, many of these suffer from one of the following: flooding of the network, requirement for global knowledge, or the requirement of “beacon” nodes, which know their absolute position according to GPS. At the very least, localization algorithms require parts of the system to be either static or relatively stable. In this paper, we propose a symmetric localization algorithm that performs fairly accurate localization. No special elements like beacons and other static elements are required; however, they are not excluded.