Distributed Graph Layout for Sensor Networks
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.
- 4.Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press (1996)Google Scholar
- 5.Gotsman, C., Koren, Y.: Distributed Graph Layout for Sensor Networks. Harvard University Computer Science TR #20-04 (2004)Google Scholar
- 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
- 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