Graphical properties of easily localizable sensor networks

  • Authors:

  • Brian D. Anderson;Peter N. Belhumeur;Tolga Eren;David K. Goldenberg;A. Stephen Morse;Walter Whiteley;Y. Richard Yang

  • Affiliations:

  • National ICT Australia and the Research School of Information Sciences and Engineering, Australian National University, Canberra, Australia;Department of Computer Science, Columbia University, New York, USA;Department of Computer Science, Columbia University, New York, USA;Department of Computer Science, Yale University, New Haven, USA;Department of Electrical Engineering, Yale University, New Haven, USA;Department of Mathematics and Statistics, York University, Toronto, Canada;Department of Computer Science, Yale University, New Haven, USA

  • Venue:
  • Wireless Networks
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The sensor network localization problem is one of determining the Euclidean positions of all sensors in a network given knowledge of the Euclidean positions of some, and knowledge of a number of inter-sensor distances. This paper identifies graphical properties which can ensure unique localizability, and further sets of properties which can ensure not only unique localizability but also provide guarantees on the associated computational complexity, which can even be linear in the number of sensors on occasions. Sensor networks with minimal connectedness properties in which sensor transmit powers can be increased to increase the sensing radius lend themselves to the acquiring of the needed graphical properties. Results are presented for networks in both two and three dimensions.