Dynamic coverage in ad-hoc sensor networks

Hai Huang, Andrea Richa, Michael Segal

Research output: Contribution to journalArticle

39 Citations (Scopus)

Abstract

Ad-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks continuously changes over time, due to the power of some sensors wearing out, to new sensors being inserted into the network, or even due to designers moving sensors around during a network re-design phase (for example, in response to a change in the requirements of the network). In this paper, we address the problem of how to dynamically maintain two important measures on the quality of the coverage of a sensor network: the best-case coverage and worst-case coverage distances. We assume that the ratio between upper and lower transmission power of sensors is bounded by a polynomial of n, where n is the number of sensors, and that the motion of mobile sensors can be described as a low-degree polynomial function of time. We maintain a (1 + ε)-approximation on the best-case coverage distance and a (√2 + ε)-approximation on the worst-case coverage distance of the network, for any fixed ε > 0. Our algorithms have amortized or worst-case poly-logarithmic update costs. We are able to efficiently maintain the connectivity of the regions on the plane with respect to the sensor network, by extending the concatenable queue data structure to also serve as a priority queue. In addition, we present an algorithm that finds the shortest maximum support path in time O(n log n).

Original languageEnglish (US)
Pages (from-to)9-17
Number of pages9
JournalMobile Networks and Applications
Volume10
Issue number1
DOIs
StatePublished - Jan 2005

Fingerprint

Ad hoc networks
Sensor networks
Sensors
Polynomials
Power transmission
Sensor nodes
Data structures
Topology
Costs

Keywords

  • Ad hoc sensor network
  • Coverage
  • Kinetic data structure

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems

Cite this

Dynamic coverage in ad-hoc sensor networks. / Huang, Hai; Richa, Andrea; Segal, Michael.

In: Mobile Networks and Applications, Vol. 10, No. 1, 01.2005, p. 9-17.

Research output: Contribution to journalArticle

Huang, Hai ; Richa, Andrea ; Segal, Michael. / Dynamic coverage in ad-hoc sensor networks. In: Mobile Networks and Applications. 2005 ; Vol. 10, No. 1. pp. 9-17.
@article{8ac28222e57d4202b8bc81fee2602175,
title = "Dynamic coverage in ad-hoc sensor networks",
abstract = "Ad-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks continuously changes over time, due to the power of some sensors wearing out, to new sensors being inserted into the network, or even due to designers moving sensors around during a network re-design phase (for example, in response to a change in the requirements of the network). In this paper, we address the problem of how to dynamically maintain two important measures on the quality of the coverage of a sensor network: the best-case coverage and worst-case coverage distances. We assume that the ratio between upper and lower transmission power of sensors is bounded by a polynomial of n, where n is the number of sensors, and that the motion of mobile sensors can be described as a low-degree polynomial function of time. We maintain a (1 + ε)-approximation on the best-case coverage distance and a (√2 + ε)-approximation on the worst-case coverage distance of the network, for any fixed ε > 0. Our algorithms have amortized or worst-case poly-logarithmic update costs. We are able to efficiently maintain the connectivity of the regions on the plane with respect to the sensor network, by extending the concatenable queue data structure to also serve as a priority queue. In addition, we present an algorithm that finds the shortest maximum support path in time O(n log n).",
keywords = "Ad hoc sensor network, Coverage, Kinetic data structure",
author = "Hai Huang and Andrea Richa and Michael Segal",
year = "2005",
month = "1",
doi = "10.1023/B:MONE.0000048542.38105.99",
language = "English (US)",
volume = "10",
pages = "9--17",
journal = "Mobile Networks and Applications",
issn = "1383-469X",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Dynamic coverage in ad-hoc sensor networks

AU - Huang, Hai

AU - Richa, Andrea

AU - Segal, Michael

PY - 2005/1

Y1 - 2005/1

N2 - Ad-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks continuously changes over time, due to the power of some sensors wearing out, to new sensors being inserted into the network, or even due to designers moving sensors around during a network re-design phase (for example, in response to a change in the requirements of the network). In this paper, we address the problem of how to dynamically maintain two important measures on the quality of the coverage of a sensor network: the best-case coverage and worst-case coverage distances. We assume that the ratio between upper and lower transmission power of sensors is bounded by a polynomial of n, where n is the number of sensors, and that the motion of mobile sensors can be described as a low-degree polynomial function of time. We maintain a (1 + ε)-approximation on the best-case coverage distance and a (√2 + ε)-approximation on the worst-case coverage distance of the network, for any fixed ε > 0. Our algorithms have amortized or worst-case poly-logarithmic update costs. We are able to efficiently maintain the connectivity of the regions on the plane with respect to the sensor network, by extending the concatenable queue data structure to also serve as a priority queue. In addition, we present an algorithm that finds the shortest maximum support path in time O(n log n).

AB - Ad-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks continuously changes over time, due to the power of some sensors wearing out, to new sensors being inserted into the network, or even due to designers moving sensors around during a network re-design phase (for example, in response to a change in the requirements of the network). In this paper, we address the problem of how to dynamically maintain two important measures on the quality of the coverage of a sensor network: the best-case coverage and worst-case coverage distances. We assume that the ratio between upper and lower transmission power of sensors is bounded by a polynomial of n, where n is the number of sensors, and that the motion of mobile sensors can be described as a low-degree polynomial function of time. We maintain a (1 + ε)-approximation on the best-case coverage distance and a (√2 + ε)-approximation on the worst-case coverage distance of the network, for any fixed ε > 0. Our algorithms have amortized or worst-case poly-logarithmic update costs. We are able to efficiently maintain the connectivity of the regions on the plane with respect to the sensor network, by extending the concatenable queue data structure to also serve as a priority queue. In addition, we present an algorithm that finds the shortest maximum support path in time O(n log n).

KW - Ad hoc sensor network

KW - Coverage

KW - Kinetic data structure

UR - http://www.scopus.com/inward/record.url?scp=17444392119&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17444392119&partnerID=8YFLogxK

U2 - 10.1023/B:MONE.0000048542.38105.99

DO - 10.1023/B:MONE.0000048542.38105.99

M3 - Article

AN - SCOPUS:17444392119

VL - 10

SP - 9

EP - 17

JO - Mobile Networks and Applications

JF - Mobile Networks and Applications

SN - 1383-469X

IS - 1

ER -