The bits and flops of the n-hop multilateration primitive for node localization problems

By Andreas Savvides, Heemin Park, Mani B. Srivastava. ACM International Conference on Wireless Sensor Networks and Applications, 2002

887 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/6d5239e7d50c83dad3621b65a447ba8191b7694c

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 from connectivity in sensor networks (2004, methodology): “An important advantage of our approach is that MDS can provide better starting points for the least-squares minimization than other triangulation-based or heuristic methods [15].”
Attack-resistant location estimation in sensor networks (2005, methodology): “Many range-based localization schemes have been proposed f r sensor networks [5], [19], [20], [26], [27].”
Localization of wireless sensor networks with a mobile beacon (2004, background): “The follow-up [28] improves the scalability of the approach.”
Localization in underwater sensor networks: survey and challenges (2006, methodology): “[6].”
Using proximity and quantized RSS for sensor localization in wireless networks (2003, background): “The literature reflects widespread interest in developing the technologies needed to achieve location estimation in wireless sensor networks [1][24][30][27][8][15] [17][21].”
Zero-Configuration, Robust Indoor Localization: Theory and Experimentation (2006, background): “The geographic location of the client n can be determined by lateration algorithms [29]–[32].”
Improved MDS-based localization (2004, methodology): “than those obtained by other methods such as collaborative multilateration [3].”
Wireless sensor network localization techniques (2007, background): “The four-stage scheme of [96] is based on introduction of the notion of ‘‘tentative uniqueness’’, where a node is called ‘‘tentatively uniquely’’ localizable if it has at least three neighbors that are either non-collinear anchors or ‘‘tentatively uniquely’’ localizable nodes.”
Localization in Wireless Sensor Networks (2007, methodology): “N-Hop Multilateration Multihop multilateration’s technique [16] is aiming to give to give nodes that are several hops away from beacons the possibility to collaborate in finding better position estimates.”
Localization with mobile anchor points in wireless sensor networks (2005, methodology): “Moreover, distributed multilateration methods were proposed for estimating positions for conforming to ad hoc sensor networks [12], [13].”
Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking (2009, methodology): “Our formation of the refinement is more general than previous methods (Savarese et al., 2002; Savvides et al., 2002) in two ways: (1) In addition to the information between 1-hop neighbors, information between multihop neighbors is also used, but with different weights.”
Semidefinite programming for ad hoc wireless sensor network localization (2004, methodology): “Most techniques use distance or angle measurements from a fixed set of reference or anchor nodes, see [7, 13, 14, 15, 16, 17]; or employ a grid of beacon nodes with known positions, see [6, 10].”
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms (2004, methodology): “Some of these algorithms use multilateration, e.g. [24, 25], some use triangulation/trigonometry, e.g. [26], and some use RF connectivity, e.g., [27].”
Localization Algorithms in Wireless Sensor Networks: Current Approaches and Future Challenges (2010, methodology): “Some of the proposals [8], [9], [10], [11], in this category are described below.”