Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks 2004
DOI: 10.1145/984622.984632
|View full text |Cite
|
Sign up to set email alerts
|

Distributed online localization in sensor networks using a moving target

Abstract: Abstract. We describe a novel method for node localization in a sensor network where there are a fraction of reference nodes with known locations. For application-specific sensor networks, we argue that it makes sense to treat localization through online distributed learning and integrate it with an application task such as target tracking. We propose distributed online algorithm in which sensor nodes use geometric constraints induced by both radio connectivity and sensing to decrease the uncertainty of their … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
147
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 217 publications
(147 citation statements)
references
References 10 publications
0
147
0
Order By: Relevance
“…One of the nice features of these techniques is that not only can the unknown nodes use the centroid of the overlapping region as a specific location estimate if necessary, but also they can determine a bound on the location error using the size of this region. When the upper bounds on these regions are tight, the accuracy of this geometric approach can be further enhanced by incorporating "negative information" about which reference nodes are not within range [35] . Although arbitrary shapes can be potentially computed in this manner, a computational simplification to determine this bounded region is to use rectangular bounding boxes as location estimates.…”
Section: Area Measurementmentioning
confidence: 99%
“…One of the nice features of these techniques is that not only can the unknown nodes use the centroid of the overlapping region as a specific location estimate if necessary, but also they can determine a bound on the location error using the size of this region. When the upper bounds on these regions are tight, the accuracy of this geometric approach can be further enhanced by incorporating "negative information" about which reference nodes are not within range [35] . Although arbitrary shapes can be potentially computed in this manner, a computational simplification to determine this bounded region is to use rectangular bounding boxes as location estimates.…”
Section: Area Measurementmentioning
confidence: 99%
“…A similar method has been described in [46] as a special case. The idea is that each time a sensor node receives a beacon, it generates a quadratic constraint on its own location according to the radio range.…”
Section: Mobility-assisted Localizationmentioning
confidence: 99%
“…Wireless sensor networks (WSN) hold a promise to "dwarf previous revolutions in the information revolution" [1]. WSN are envisioned to consist of hundreds to thousands of sensor nodes communicating over a wireless channel, performing distributed sensing and collaborative data processing tasks for a variety of vital military and civilian applications [2]. Wireless sensor networks are densely deployed in sensing fields.…”
Section: Introductionmentioning
confidence: 99%