Range-free localization schemes in large scale sensor network

By Tian He, C. Huang, Brian M. Blum, J. Stankovic, Tarek F. Abdelzaher. ACM/IEEE International Conference on Mobile Computing and Networking, 2003

515 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

SeRLoc: secure range-independent localization for wireless sensor networks (2004, methodology): “Due to space limitation we examine three popular schemes, Dv-hop [9], Amorphous localization [7] and APIT [6]”
Attack-resistant location estimation in sensor networks (2005, methodology): “Range-free schemes are proposed to provide localization services for the applications with less precision r equirements [2], [9], [18], [21].”
ROPE: robust position estimation in wireless sensor networks (2005, methodology): “We propose a robust positioning system we call ROPE that allows sensors to determine their location without any centralized computation.”
Location, Localization, and Localizability (2010, background): “In this process, APIT does not assume that nodes can really range to these beacons.”
Localization algorithms of Wireless Sensor Networks: a survey (2011, background): “each category can be further classified as range-based or range-free [14].”
Coverage by directional sensors in randomly deployed wireless sensor networks (2006, background): “, He et al. (2003) provides a cost-effective localization service without equipping each sensor node with a GPS device) and every directional sensor knows and controls its orientation d .”