A Distributed, Leaderless Algorithm for Logical Location Discovery in Specknets

  • Ryan McNally
  • Damal K. Arvind
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4641)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arvind, D.: Speckled computing. In: Technical Proceedings of the 2005 NSTI Nanotechnology Conference (May 2005)Google Scholar
  2. 2.
    McNally, R., Wong, K., Arvind, D.: A distributed algorithm for logical location estimation in speckled computing. In: Proceedings of IEEE Wireless Communications and Networking Conference, March 2005, IEEE Computer Society Press, Los Alamitos (March2005)Google Scholar
  3. 3.
    Bulusu, N., Heidemann, J., Estrin, D.: Gps-less low cost outdoor localization for very small devices. IEEE Personal Communications Magazine 7(5), 28–34 (2000)CrossRefGoogle Scholar
  4. 4.
    Doherty, L., Pister, K.S.J., Ghaoui, L.E.: Convex position estimation in wireless sensor networks. In: Proc. of the IEEE Infocom, pp. 1655–1663. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar
  5. 5.
    Shang, Y., Ruml, W., Zhang, Y., Fromherz, M.: Localization from mere connectivity (2003)Google Scholar
  6. 6.
    Shang, Y., Ruml, W.: Improved mds-based localization (2004)Google Scholar
  7. 7.
    Moore, D., Leonard, J., Rus, D., Teller, S.: Robust distributed network localization with noisy range measurements. In: SenSys 2004. Proceedings of Second ACM Conference on Embedded Networked Sensor Systems, Baltimore, MD, USA, pp. 50–61. ACM Press, New York (2004)CrossRefGoogle Scholar
  8. 8.
    McNally, R.: Specksim at www.specknet.org/dev/specksim
  9. 9.
    Mitzenmacher, M.: Compressed bloom filters. In: Proc. of the 20th Annual ACM Symposium on Principles of Distributed Computing. IEEE/ACM Trans. on Networking, 144–150 (2001)Google Scholar
  10. 10.
    Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. Mobile Computing and Networking, 243–254 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ryan McNally
    • 1
  • Damal K. Arvind
    • 1
  1. 1.Research Consortium in Speckled Computing, School of Informatics, Edinburgh University, EdinburghUK

Personalised recommendations