Dynamic fine-grained localization in Ad-Hoc networks of sensors

Savvides, Andreas; Han, Chih-Chieh; Strivastava, Mani B.

doi:10.1145/381677.381693

Cited by 2,206 publications

(1,427 citation statements)

References 13 publications

Supporting

Mentioning

1,413

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%

“…Recently, novel schemes have been proposed to determine the locations of the nodes in a network where only some special nodes (called beacons) know their locations, e.g., [23], [45]. In these schemes, network nodes measure the distances to their neighbors and then try to determine their locations.…”

Section: Introductionmentioning

confidence: 99%

“…For example, in [45], Savvides et al propose the iterative multilateration scheme to determine the locations of nodes that do not know their locations initially.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Theory of Network Localization

Aspnes

Eren

Goldenberg

et al. 2006

IEEE Trans. on Mobile Comput.

546

386

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%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Theory of Network Localization

Aspnes

Eren

Goldenberg

et al. 2006

IEEE Trans. on Mobile Comput.

546

386

View full text Add to dashboard Cite

show abstract

“…In the past several years, a number of localization protocols have been proposed to reduce or completely remove the dependence on GPS in wireless sensor networks [1]- [4], [9], [10], [27]- [31], [33], [34].…”

Section: A Localization Problems and Schemesmentioning

confidence: 99%

“…This creates a demand for efficient and cost-effective localization algorithms in sensor networks. In the past several years, a number of localization protocols have been proposed to reduce or completely remove the dependence on GPS in wireless sensor networks [2], [4], [10], [27]- [30], [33], [34]. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration).…”

mentioning

confidence: 99%

LAD: Localization anomaly detection for wireless sensor networks

Fang

Ningi

2006

Journal of Parallel and Distributed Computing

134

130

View full text Add to dashboard Cite

Abstract-In wireless sensor networks (WSNs), sensors' locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery (localization) schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the reference information provided by these beacon nodes.Most of the beacon-based localization schemes assume a benign environment, where all beacon nodes are supposed to provide correct reference information. However, when the sensor networks are deployed in a hostile environment, where beacon nodes can be compromised, such an assumption does not hold anymore.In this paper, we propose a general scheme to detect localization anomalies that are caused by adversaries. Our scheme is independent from the localization schemes. We formulate the problem as an anomaly intrusion detection problem, and we propose a number of ways to detect localization anomalies. We have conducted simulations to evaluate the performance of our scheme, including the false positive rates, the detection rates, and the resilience to node compromises.

show abstract

Wireless Sensor Networks

Megerian

Potkonjak

2003

Wiley Encyclopedia of Telecommunications

View full text Add to dashboard Cite

Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. The coverage problem for Wireless Sensor Network (WSN) has been studied extensively in recent years, especially when combined with connectivity and energy efficiency. This paper focuses on the sensor replacement problem in wireless sensor networks consists of mobile sensors. Mobility equipped sensors are utilized to recover and maintain the overall coverage using the dynamic cluster concept. The proposed fault repair solution does not assume the localization information is available. Mobile sensor nodes make use of simple geometric operation to locate and replace dying nodes to recover or increase the existing coverage and connectivity.

show abstract

Dynamic fine-grained localization in Ad-Hoc networks of sensors

Cited by 2,206 publications

References 13 publications

A Theory of Network Localization

A Theory of Network Localization

LAD: Localization anomaly detection for wireless sensor networks

Wireless Sensor Networks

Contact Info

Product

Resources

About