@Article{ABEG06,
  author =	 {Brian D O Anderson and Peter N Belhumeur and Tolga
                  Eren and David K Goldenberg and A Stephen Morse and
                  Walter Whiteley and Y Richard Yang},
  title =	 {Graph Properties of Easily Localizable Networks},
  journal =	 {Wireless Networks},
  year =	 {2006},
  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, separately, can ensure unique
                  localizability with known effective computational
                  method. 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.}
}