Location in distributed ad-hoc wireless sensor networks

Savarese, C.; Rabaey, Jan M.; Beutel, Jan

doi:10.1109/icassp.2001.940391

Cited by 669 publications

(657 citation statements)

References 2 publications

Supporting

Mentioning

650

Contrasting

Unclassified

Order By: Relevance

“…Network localization is an active research field, e.g., [1], [5], [9]- [11], [16], [19], [22], [23], [27], [32], [39], [40], [42], [44], [45], [47], [49], [50], [52]. The previous approaches can be classified into two types: coarse-grained and fine-grained.…”

Section: Related Workmentioning

confidence: 99%

A Theory of Network Localization

Aspnes

Eren

Goldenberg

et al. 2006

IEEE Trans. on Mobile Comput.

563

396

View full text Add to dashboard Cite

In this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks.We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.

show abstract

Section: Related Workmentioning

confidence: 99%

A Theory of Network Localization

Aspnes

Eren

Goldenberg

et al. 2006

IEEE Trans. on Mobile Comput.

563

396

View full text Add to dashboard Cite

show abstract

“…Clustering will only cluster segments of the same time slots as indicated in the distance measure defined in Equation (2). The number of clusters formed in this step is heuristically set to two times the number 2 of targets in the field because some clusters may contain only partial segments and noise segments.…”

Section: Clustering Stepmentioning

confidence: 99%

“…Alternatively, sensors may have GPS capabilities. Finally, sensors may locate themselves through one of several schemes that rely on sparsely located anchor sensor nodes [2]. (3) Aggregate signals collected by wireless sensors can be gathered for processing by a sink or gateway.…”

Section: Network Model and Assumptionsmentioning

confidence: 99%

On Non-Cooperative Multiple-Target Tracking With Wireless Sensor Networks

Zhu

Vikram

et al. 2014

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-In this paper, we propose an approach to track multiple non-cooperative targets with wireless sensor networks. Most existing tracking algorithms can not be directly applied to non-cooperative target tracking because they assume the access to signals from individual targets for tracking by assuming that: 1) there is only one target in a field; 2) signals from different cooperative targets can be differentiated; or 3) interference caused by signals from other targets is negligible because of attenuation. We propose a general approach for tracking non-cooperative targets. The tracking algorithm first separates the aggregate signals from multiple indistinguishable targets via the blind source separation (BSS) algorithms. Through the analysis on both the temporal and spatial correlation of the separated individual signals, the tracking algorithm determines the location of a target and its moving track. A voting scheme based on the spatial information is designed to better estimate the moving track. Furthermore, we analyze and discuss the influence of signal attenuation and the tracking resolution of the proposed tracking approach. Our experiments show that the proposed approach can both accurately and precisely track multiple indistinguishable moving targets.

show abstract

“…The anchor nodes know their positions and localize the other nodes incrementally through trilateration. In [16], [17], anchor-free algorithms, which do not need anchor nodes knowing their absolute coordinates, were also introduced. They produce unique relative coordinates albeit allowing global translation, rotation, and flipping.…”

Section: Related Workmentioning

confidence: 99%

Sensor Node Localization by Three Mobile Anchors in the Wireless Sensor Networks

Lee

Kim

et al. 2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYFor the deployment of sensor networks, the sensor localization, which finds the position of sensor nodes, is very important. Most previous localization schemes generally use the GPS signal for the sensor localization. However, the GPS signal is unavailable when there is an obstacle between the sensor nodes and satellites. Therefore, in this paper, we propose a new localization scheme which does not use the GPS signal. The proposed scheme localizes the sensors by using three mobile anchors. Because the three mobile anchors collaboratively move by themselves, it is self-localizable and can be adopted even when the sensors are randomly and sparsely deployed in the target field. key words: sensor localization, sensor deployment, mobile anchor, sensor network

show abstract

Location in distributed ad-hoc wireless sensor networks

Cited by 669 publications

References 2 publications

A Theory of Network Localization

A Theory of Network Localization

On Non-Cooperative Multiple-Target Tracking With Wireless Sensor Networks

Sensor Node Localization by Three Mobile Anchors in the Wireless Sensor Networks

Contact Info

Product

Resources

About