GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Computing the State of Specknets: Further Analysis of an Innate Immune-Inspired Model
ICARIS '08 Proceedings of the 7th international conference on Artificial Immune Systems
A Self-powered Module with Localization and Tracking System for Paintball
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
| Hi-index | 0.00 |
A speck is intended to be a miniature (5x5x5mm) device that combines sensing, processing, wireless communication and energy storage capabilities [1]. A specknet is an ad-hoc mobile wireless network of specks. The logical location of specks in the network is useful, for reasons ranging from routing data to giving the data sensed a spatial context. This paper presents a novel algorithm for discovering the logical location of specks and updating that information in the face of movement, without recourse to infrastructure support. The proposed algorithm exploits the location constraints implied by the neighbourhood links in order to compute a likely location: one hop neighbours must lie within radio range, two-hop neighbours probably lie outwith radio range. An iterative approach is used to converge on a location estimate that satisfies all constraints. The performance of the location discovery algorithm is evaluated in the SpeckSim simulator for a number of metrics, including location error. The results demonstrate that the quality of the computed locations is within 90% of optimal when used in routing calculations.