Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications 2002
DOI: 10.1145/570738.570754
|View full text |Cite
|
Sign up to set email alerts
|

A directionality based location discovery scheme for wireless sensor networks

Abstract: A sensor network is a large ad hoc network of densely distributed sensors that are equipped with low power wireless transceivers. Such networks can be applied for cooperative signal detection, monitoring, and tracking, and are especially useful for applications in remote or hazardous locations. This paper addresses the problem of location discovery at the sensor nodes, which is one of the central design challenges in sensor networks. We present a new method by which a sensor node can determine its location by … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
145
0

Year Published

2005
2005
2011
2011

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 269 publications
(147 citation statements)
references
References 16 publications
2
145
0
Order By: Relevance
“…A straightforward localization technique, involving three rotating reference beacons at the boundary of a sensor network providing localization for all interior nodes, is described in [32]. A more detailed description of AoA-based triangulation techniques is provided in [33].…”
Section: Angle Measurementmentioning
confidence: 99%
“…A straightforward localization technique, involving three rotating reference beacons at the boundary of a sensor network providing localization for all interior nodes, is described in [32]. A more detailed description of AoA-based triangulation techniques is provided in [33].…”
Section: Angle Measurementmentioning
confidence: 99%
“…Indeed, as discussed earlier, all the current localization schemes are vulnerable, since they were not developed to handle malicious attacks. Almost all of the range-based localization schemes and some range-free schemes (e.g., [4], [28]- [30], [33], [34]) eventually reduce localization to a Minimum Mean Square Estimation (MMSE) problem. Though this is effective to reduce the impact of measurement errors that occur during localization, an adversary can still introduce arbitrarily large location errors by compromising a single anchor node and having the compromised anchor node declaring a false location.…”
Section: Impacts Of the Attacksmentioning
confidence: 99%
“…Many practical distributed algorithms for localization in space (e.g., [1,7,14,16,20,21]) and time (e.g., [5,8,13,23,24]) are based on a few common structural elements. In this section we point out these structural elements and discuss various concrete instances of these elements found in existing algorithms.…”
Section: Distributed Algorithms For Localization In Spacetimementioning
confidence: 99%