DV Based Positioning in Ad Hoc Networks
By Dragos Stefan Niculescu, B. Nath. Telecommunications Systems, 2003
1,829 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/78e5fbe56e09ae3977d94e2f44fce554e337608f
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
- J. Stankovic
- Tian He
- Peng Ning
- Gang Zhou
- David E. Evans
- Donggang Liu
- Lingxuan Hu
- Sudha Krishnamurthy
In Electrical and Electronic Engineering
- J. Stankovic
- Xenofon D. Koutsoukos
- Isaac Amundson
- David E. Evans
- Lingxuan Hu
- Gang Zhou
- Tian He
- Yunhao Liu
Citations in the corpus
- A practical path loss model for indoor WiFi positioning enhancement (2007, background): “Global Positioning System (GPS), a worldwide satellite-based navigation system does not work indoors [ 1 ].”
- Location, Localization, and Localizability (2010, background): “(a) Beacon Based Localization Beacon based localization approaches utilize estimates of distances to reference nodes that may be several hops away[48-49].”
- A survey on sensor localization (2010, methodology): “In order to apply multilateration, DVdistance [ 9 ] follows the approach similar to DV-hop [27].”
- Attack-resistant location estimation in sensor networks (2005, methodology): “Niculescu and Nath proposed to use the minimum hop count and the average hop size to estimate the distance between nodes and then determine sensor nodes’ loc ations accordingly [21].”
- Localization with mobile anchor points in wireless sensor networks (2005, methodology): “DV-Hop localization method, proposed by Niculescu and Nath, measures hop counts from each node to specific anchor points [23].”
- Localization in underwater sensor networks: survey and challenges (2006, methodology): “DV-Hop is one of the most basic range-free schemes, and it first employs a classical distance vector exchange so that all nodes in the network get distances, in number of hops, to the anchor nodes.”
- Rendezvous design algorithms for wireless sensor networks with a mobile base station (2008, background): “This assumption is justified by the fact that the Euclidean distance between two nodes in a dense wireless network is approximately proportional to th e hop count between the same nodes [20].”
- Models and solutions for radio irregularity in wireless sensor networks (2006, methodology): “In DV-HOP [Niculescu and Nath 2003], the anchor nodes flood their locations throughout the whole network.”
- Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking (2009, background): “Received signal strength (RSS) measurements estimate the distances between neighbouring sensors from the received signal strength measurements between the two sensors (Bergamo & Mazzini, 2002; Elnahrawy, Li, & Martin, 2004; Madigan et al., 2005; Niculescu & Nath, 2003; Patwari et al., 2005).”
- 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].”
- A Review of IoT Sensing Applications and Challenges Using RFID and Wireless Sensor Networks (2020, methodology): “For the second category, also called range-free localization algorithms, the types of techniques are Distance Vector Hop [47], Hop Terrain [48], Centroid System [49], the Approximate Point in Triangulation [50] and the Gradient Algorithm [51].”
- Localization for mobile sensor networks (2004, methodology): “Note that hop count based algorithms [35, 34] require that the hop count is maintained accurately throughout the network and empower a single rogue node to disrupt many node locations by advertising a false hop count.”
- Robust statistical methods for securing wireless localization in sensor networks (2005, methodology): “Triangulation methods involve gathering a collection of {(x, y, d)} values, where d represents an estimated distance from the wireless device to an anchor at (x, y). These distances d may be stem from different types of measurements, such as hop counts in multi-hop networks (as in the case of DV-hop”
- A Survey on Localization for Mobile Wireless Sensor Networks (2009, methodology): “An alternative approach is the range-free method ([39], [63], [58]), whereby a node is localized to the region in which it is detected.”
- Impact of radio irregularity on wireless sensor networks (2004, methodology): “Localization protocols such as DV-Hop [20] and Centroid [2] assume a spherical radio range.”