Range-free localization schemes for large scale sensor networks

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

2,890 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Ocean Engineering

View Paper: https://www.semanticscholar.org/paper/26d7477c2f05594eb98a191826dcbdb836c9fb45

How researchers see this paper

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

In Computer Networks and Communications

In Electrical and Electronic Engineering

In Ocean Engineering

Citations in the corpus

Localization for mobile sensor networks (2004, methodology): “[34] and [19] suggest approaches for improving hop counting based techniques when the node density is low by increasing the number of seed nodes.”
Localization in Wireless Sensor Networks (2007, methodology): “[12] proposed a rangefree algorithm called APIT in which all possible triangles of the seeds are formed.”
Rigidity, computation, and randomization in network localization (2004, background): “Recently, novel schemes have been proposed to determine the locations of the nodes in a network where only some special nodes (called beacons) know their locations, e.g., [5], [6].”
A Theory of Network Localization (2006, background): “The previous approaches can be classified into two types: coarse-grained [10], [11], [ 28 ], [42], [50], [57] and fine-grained [1], [7], [12], [18], [37], [44], [46], [47], [49], [52], [53], [56].”
Scalable Localization with Mobility Prediction for Underwater Sensor Networks (2008, background): “2.2 Related Work on Localization Localization for terrestrial sensor networks has been widely explored, and a significant number of schemes have been proposed [29], [30], [31], [32], [33], [34], [ 35 ], [36], [37], [38], [39], [40], [41], [42], [43], [44].”
Rendered Path: Range-Free Localization in Anisotropic Sensor Networks With Holes (2007, background): “Range-based approaches assume that sensor nodes are able to measure the distances, or even relative directions of their neighbor nodes, based on Time of Arrival (TOA) [25], Time Difference of Arrival (TDOA) [19], Radio Signal Strength (RSS) [1] or Angle of Arrival (AOA) [17], etc.”
Tracking unmodified smartphones using wi-fi monitors (2012, background): “The majority of work in this area, such as RADAR fingerprinting [6], outdoor Wi-Fi localization [10, 17] and sensor network localization [9, 27, 12, 20, 7] relies on the localized device being an active participant in the process.”
Models and solutions for radio irregularity in wireless sensor networks (2006, methodology): “The study in [ He et al. 2003 ] shows that the performance of such protocols degrades when the radio range becomes irregular.”
Experimental comparison of RSSI-based localization algorithms for indoor wireless sensor networks (2008, background): “This limit has been remarked in [6, 7 ], where the authors state that the performance cannot improve significantly even using complex algorithms, being intrinsically limited by the ranging errors.”
Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking (2009, background): “A further set of lateration approaches averages the coordinates of the landmarks observed by a sensor, either averaging the entire set, or selectively averaging overlapping regions (He et al., 2003; Stolero et al., 2004).”
Joint mobility and routing for lifetime elongation in wireless sensor networks (2005, methodology): “If the base station and the sensor nodes are locationaware (using GPS or other localization methods [30], [31], [32]) and the base station announces its location to all nodes, building load-balanced routing path online is possible [4].”
Signal processing techniques in network-aided positioning: a survey of state-of-the-art positioning designs (2005, background): “Another novel “range-free” algorithm determines whether a node lies inside or outside of the triangles formed by all possible sets of three beacons (called the APIT test) [56].”
Localization with mobile anchor points in wireless sensor networks (2005, background): “An area-based localization mechanism was developed to narrow down the possible region for a sensor node [25].”