Distributed Graph Layout for Sensor Networks

  • Craig Gotsman
  • Yehuda Koren
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)


Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor with a location measurement device, such as GPS. However, low-end systems or indoor systems, which cannot use GPS, must locate themselves based only on crude information available locally, such as inter-sensor distances. We show how a collection of sensors, capable only of measuring distances to close neighbors, can compute their locations in a purely distributed manner, i.e. where each sensor communicates only with its neighbors. This can be viewed as a distributed graph drawing algorithm. We experimentally show that our algorithm consistently produces good results under a variety of simulated real-world conditions, and is relatively robust to the presence of noise in the distance measurements.


  1. 1.
    Borg, I., Groenen, P.: Modern Multidimensional Scaling: Theory and Applications. Springer, Heidelberg (1997)MATHGoogle Scholar
  2. 2.
    Eades, P.: A Heuristic for Graph Drawing. Congressus Numerantium 42, 149–160 (1984)MathSciNetGoogle Scholar
  3. 3.
    Fruchterman, T.M.G., Reingold, E.: Graph Drawing by Force-Directed Placement. Software-Practice and Experience 21, 1129–1164 (1991)CrossRefGoogle Scholar
  4. 4.
    Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press (1996)Google Scholar
  5. 5.
    Gotsman, C., Koren, Y.: Distributed Graph Layout for Sensor Networks. Harvard University Computer Science TR #20-04 (2004)Google Scholar
  6. 6.
    Hall, K.M.: An r-dimensional Quadratic Placement Algorithm. Management Science 17, 219–229 (1970)MATHCrossRefGoogle Scholar
  7. 7.
    Hendrickson, B.: Conditions for Unique Graph Realizations. SIAM J. Comput. 21, 6–84 (1992)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Kamada, T., Kawai, S.: An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 7–15 (1989)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Koren, Y.: On Spectral Graph Drawing. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 496–508. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Mauve, M., Widmer, J., Hartenstein, H.: A Survey on Position-Based Routing in Mobile Ad-Hoc Networks. IEEE Network 15, 30–39 (2001)CrossRefGoogle Scholar
  11. 11.
    Priyantha, N.B., Balakrishnan, H., Demaine, E., Teller, S.: Anchor-Free Distributed Localization in Sensor Networks. In: Proc. 1st Inter. Conf. on Embedded Networked Sensor Systems (SenSys 2003), pp. 340–341 (2003); Also TR #892, MIT LCS (2003)Google Scholar
  12. 12.
    Tubaishat, M., Madria, S.: Sensor Networks: An Overview. IEEE Potentials 22, 20–23 (2003)CrossRefGoogle Scholar
  13. 13.
    Xiao, L., Boyd, S.: Fast Linear Iterations for Distributed Averaging. Systems and Control Letters 53, 65–78 (2004)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Yemini, Y.: Some Theoretical Aspects of Location-Location Problems. In: Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci., pp. 1–8 (1979)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Craig Gotsman
    • 1
  • Yehuda Koren
    • 2
  1. 1.Department of Computer ScienceHarvard UniversityCambridgeUSA
  2. 2.AT&T Labs – ResearchFlorham ParkUSA

Personalised recommendations