Location Discovery in SpeckNets Using Relative Direction Information

  • Authors:
  • Ryan Mcnally;D. K. Arvind

  • Affiliations:
  • School of Informatics, University of Edinburgh, Edinburgh, UK EH8 9AB;School of Informatics, University of Edinburgh, Edinburgh, UK EH8 9AB

  • Venue:
  • WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A speck is intended to be a miniature (5X5X5mm) semiconductor device that combines sensing, processing, wireless communication and energy storage capabilities. A specknet is an ad-hoc wireless network of specks. The location of specks in the network is useful in processing information, for reasons ranging from routing data to giving the data sensed a spatial context. This paper presents an algorithm for discovering the location of specks and updating that information in the face of movement. The proposed algorithm exploits the location constraints implied by the sensed directions to a speck's one-hop neighbours in order to compute a likely location. Direction information may be gleaned in a robust manner through the use of free-space optical communications systems. The algorithm is fully distributed, requires no special infrastructural support, has modest requirements in terms of computation and communication and does not rely on range measurement or anchor nodes. The performance of the location discovery algorithm is evaluated in the SpeckSim simulator under a range of adverse conditions.