Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Borg, I., Groenen, P.: Modern Multidimensional Scaling: Theory and Applications. Springer, Heidelberg (1997)
Eades, P.: A Heuristic for Graph Drawing. Congressus Numerantium 42, 149–160 (1984)
Fruchterman, T.M.G., Reingold, E.: Graph Drawing by Force-Directed Placement. Software-Practice and Experience 21, 1129–1164 (1991)
Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press (1996)
Gotsman, C., Koren, Y.: Distributed Graph Layout for Sensor Networks. Harvard University Computer Science TR #20-04 (2004)
Hall, K.M.: An r-dimensional Quadratic Placement Algorithm. Management Science 17, 219–229 (1970)
Hendrickson, B.: Conditions for Unique Graph Realizations. SIAM J. Comput. 21, 6–84 (1992)
Kamada, T., Kawai, S.: An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 7–15 (1989)
Koren, Y.: On Spectral Graph Drawing. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 496–508. Springer, Heidelberg (2003)
Mauve, M., Widmer, J., Hartenstein, H.: A Survey on Position-Based Routing in Mobile Ad-Hoc Networks. IEEE Network 15, 30–39 (2001)
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)
Tubaishat, M., Madria, S.: Sensor Networks: An Overview. IEEE Potentials 22, 20–23 (2003)
Xiao, L., Boyd, S.: Fast Linear Iterations for Distributed Averaging. Systems and Control Letters 53, 65–78 (2004)
Yemini, Y.: Some Theoretical Aspects of Location-Location Problems. In: Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci., pp. 1–8 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gotsman, C., Koren, Y. (2005). Distributed Graph Layout for Sensor Networks. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)