Ad hoc positioning system (APS)

By Dragos Stefan Niculescu, B. Nath. GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001

1,986 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/8f309c1848ac5dee63e3849d8cfaaded15cafdd5

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

Citations in the corpus

Scalable Localization with Mobility Prediction for Underwater Sensor Networks (2008, background): “It is shown in [37], [39], [40], [ 61 ], [62] that range-based distributed localization schemes have relatively high requirements on the node density of the network.”
J-Sim: a simulation and emulation environment for wireless sensor networks (2006, methodology): “To demonstrate how the localization service can be implemented in the framework, we have implemented a distributed positioning algorithm, called APS/DV-hop, [47].”
SeRLoc: secure range-independent localization for wireless sensor networks (2004, methodology): “PERFORMANCE EVALUATION In this section we compare the performance of SeRLoc with state-of-the-art localization techniques, namely Dv-Hop [9], Amorphous localization [7], Centroid localization [8], APIT [6] and its theoretical ideal version PIT [6].”
The limits of localization using signal strength: a comparative study (2004, background): “foundations are possible, including multidimensional scaling [1], optimization[2], and ad-hoc approaches [3], [4].”
DV Based Positioning in Ad Hoc Networks (2003, result): “For these, and other simulation results comparing three of the mentioned propagation methods, see (Niculescu and Nath, 2001).”
Source-location privacy in energy-constrained sensor network routing (2004, background): “Such knowledge can be obtained by using ranging [2, 14, 16] and angle of arrival (AOA) [15] measurements.”
Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes (2008, background): “In multilateration algorithms [12]–[15], each sensor estimates its range from the anchors and then calculates its location via multilateration [16].”
JAM: a jammed-area mapping service for sensor networks (2003, background): “A number of localization services exist which can provide each sensor with an accurate estimate of its own location and provide directory services for others' locations [18] [4] [22] [10] without the expense of adding GPS capability to each node.”
A survey on sensor localization (2010, methodology): “DV-hop [ 27 ] methods localize the nodes with the help of the radio range in addition to the proximity measurement.”
TPS: a time-based positioning scheme for outdoor wireless sensor networks (2004, methodology): “Connectivity based systems often require global flooding [26] or global connectivity information [35] to estimate range.”
Localization in Wireless Sensor Networks (2007, methodology): “Niculescu and Nath [21] proposed DV-Hop which is similar to Gradient, but uses a di.erent method for estimating the average distance per hop.”
Trajectory based forwarding and its applications (2003, methodology): “The po 1isotropic = having the same physical properties in all directions (connectivity, density, node degree) Figure 12: TBF on DV-hop Average node degree 8.1 9.7 11.8 14.4 17.0 19.0 1.2 14 12 1 Average deviation[hops] 10 Path increase = warped - true 0.8 8 0.6 6 0.4 4 0.2 0 (a) Deviation from”
Algorithms and Protocols for Wireless Sensor Networks (2008, methodology): “The location problem consists in finding the geographic location of the nodes in aWSN,which can be computed by a central unit [2] or by sensor nodes in a distributedmanner [3–8].”