Convex position estimation in wireless sensor networks
By Lance Doherty, Kristofer S. J. Pister, Laurent El Ghaoui. Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001
1,819 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/c84f1f6549da0bdf41cf895bad6193daf6b24230
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
- Bodhi Priyantha
- Azzedine F. M. Boukerche
- Deborah Estrin
- David E. Evans
- Lingxuan Hu
- Hari Balakrishnan
- Baris Fidan
- Guoqiang Mao
In Electrical and Electronic Engineering
- Bodhi Priyantha
- Baris Fidan
- Guoqiang Mao
- Yunhao Liu
- Zheng Yang
- Azzedine F. M. Boukerche
- David E. Evans
- Lingxuan Hu
Citations in the corpus
- Localization in underwater sensor networks: survey and challenges (2006, methodology): “In [28], a central server models the network as a series of equations representing proximity constraints between nodes, and then uses sophisticated optimization techniques to estimate the location of every node in the network.”
- Maintaining Sensing Coverage and Connectivity in Large Sensor Networks (2005, background): “This assumption is not impractical, as many research efforts have been made to address the localization problem [25], [21], [7].”
- A Theory of Network Localization (2006, neutral): “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].”
- ASCENT: adaptive self-configuring sensor networks topologies (2004, methodology): “Doherty et. al. [ 5 ] presented a method for estimating unknown node positions based exclusively on connectivity-induced constraints.”
- An Improved K-means Clustering Algorithm (2014, neutral): “max min ( ) { [1, ] | } V M y k Y P k n Y Y (8)”
- Unreliable sensor grids: coverage, connectivity and diameter (2003, background): “that are specific to sensor networks, we refer the reader to [8], [9], [10], [11].”
- SeRLoc: secure range-independent localization for wireless sensor networks (2004, background): “Categories and Subject Descriptors C.2 [Computer System Organization]: Computer-Communication Networks; C.2.1 [Network Architecture and Design]: Distributed networks Network topology General Terms Algorithm, Security, Performance, Design Keywords Secure Localization, Wireless sensor networks, rang”
- MMSPEED: multipath Multi-SPEED protocol for QoS guarantee of reliability and. Timeliness in wireless sensor networks (2006, methodology): “Also, each sensor node is assumed to be aware of its geographical location using GPS [12] or distributed location services [13], [ 14 ].”
- Routing Protocols in Wireless Sensor Networks - A Survey (2010, methodology): “In GAF, sensor field is divided into grid squares and every sensor uses its location information, which can be provided by GPS or other location systems [16, 18, 19], to associate itself with a particular grid in which it resides.”
- GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information (2003, methodology): “Current methods of determining geographic location[3, 7, 10, 12, 28] consume much energy and may not be possible in many sensor network scenarios.”
- A survey on sensor localization (2010, critical): “Although the semi-definite programming (SDP) approach presented in [ 30 ] can be modified to incorporate the range measurements in the localization process by replacing the approximated distances with the measured distances, it tends to produce large localization error when the anchors are placed in”
- Semidefinite programming for ad hoc wireless sensor network localization (2004, methodology): “[7] wherein the proximity constraints between nodes which are within ’hearing distance’ of each other are modeled as convex constraints.”
- Towards IP geolocation using delay and topology measurements (2006, background): “However, they exist only for specialized cases and equipment, such as the use of GPS [8] and GSM or 802.11 beacons [13]; even the latter depend on a large database of landmarks that must be manually entered.”