Curve-based deployment for barrier coverage in wireless sensor networks

Shibo He, Xiaowen Gong, Junshan Zhang, Jiming Chen, Youxian Sun

Research output: Contribution to journalArticle

58 Citations (Scopus)

Abstract

This paper studies deterministic sensor deployment for barrier coverage in wireless sensor networks. Most of existing works focused on line-based deployment, ignoring a wide spectrum of potential curve-based solutions. We, for the first time, extensively study the sensor deployment under a general setting. We first present a condition under which the line-based deployment is suboptimal, revealing the advantage of curve-based deployment. By constructing a contracting mapping, we identify the characteristics for a deployment curve to be optimal. Based on the optimal deployment curve, we design sensor deployment algorithms by introducing a new notion of distance-continuous. Our findings show that i) when the deployment curve is distance-continuous, the proposed algorithm is optimal in terms of the vulnerability corresponding to the deployment, and ii) when the deployment curve is not distance-continuous, the approximation ratio of the vulnerability corresponding to the deployment by the proposed algorithm to the optimal one is upper bounded by \min(π, \frac{||\widetilde{AB}||}{||\widetilde{AGB}||}\frac{2n+\sqrt{2}-1}{2n} ), where ||\widetilde{AB}|| and ||\widetilde{AGB}|| are some constants, and n is the number of sensors. We generalize the study to the heterogeneous sensing model, and show that the proposed algorithm can provide close-to-optimal performance. Extensive numerical results corroborate our analysis.

Original languageEnglish (US)
Article number6697932
Pages (from-to)724-735
Number of pages12
JournalIEEE Transactions on Wireless Communications
Volume13
Issue number2
DOIs
StatePublished - 2014

Fingerprint

Wireless Sensor Networks
Wireless sensor networks
Coverage
Curve
Sensors
Time and motion study
Sensor
Vulnerability
Line
Sensing
Numerical Results
Generalise

Keywords

  • Barrier coverage
  • curved-based deployment
  • deployment algorithms
  • optimal deployment curve

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Curve-based deployment for barrier coverage in wireless sensor networks. / He, Shibo; Gong, Xiaowen; Zhang, Junshan; Chen, Jiming; Sun, Youxian.

In: IEEE Transactions on Wireless Communications, Vol. 13, No. 2, 6697932, 2014, p. 724-735.

Research output: Contribution to journalArticle

He, Shibo ; Gong, Xiaowen ; Zhang, Junshan ; Chen, Jiming ; Sun, Youxian. / Curve-based deployment for barrier coverage in wireless sensor networks. In: IEEE Transactions on Wireless Communications. 2014 ; Vol. 13, No. 2. pp. 724-735.
@article{0b07faf1873343c1af1d83556fbda248,
title = "Curve-based deployment for barrier coverage in wireless sensor networks",
abstract = "This paper studies deterministic sensor deployment for barrier coverage in wireless sensor networks. Most of existing works focused on line-based deployment, ignoring a wide spectrum of potential curve-based solutions. We, for the first time, extensively study the sensor deployment under a general setting. We first present a condition under which the line-based deployment is suboptimal, revealing the advantage of curve-based deployment. By constructing a contracting mapping, we identify the characteristics for a deployment curve to be optimal. Based on the optimal deployment curve, we design sensor deployment algorithms by introducing a new notion of distance-continuous. Our findings show that i) when the deployment curve is distance-continuous, the proposed algorithm is optimal in terms of the vulnerability corresponding to the deployment, and ii) when the deployment curve is not distance-continuous, the approximation ratio of the vulnerability corresponding to the deployment by the proposed algorithm to the optimal one is upper bounded by \min(π, \frac{||\widetilde{AB}||}{||\widetilde{AGB}||}\frac{2n+\sqrt{2}-1}{2n} ), where ||\widetilde{AB}|| and ||\widetilde{AGB}|| are some constants, and n is the number of sensors. We generalize the study to the heterogeneous sensing model, and show that the proposed algorithm can provide close-to-optimal performance. Extensive numerical results corroborate our analysis.",
keywords = "Barrier coverage, curved-based deployment, deployment algorithms, optimal deployment curve",
author = "Shibo He and Xiaowen Gong and Junshan Zhang and Jiming Chen and Youxian Sun",
year = "2014",
doi = "10.1109/TWC.2013.121813.130198",
language = "English (US)",
volume = "13",
pages = "724--735",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Curve-based deployment for barrier coverage in wireless sensor networks

AU - He, Shibo

AU - Gong, Xiaowen

AU - Zhang, Junshan

AU - Chen, Jiming

AU - Sun, Youxian

PY - 2014

Y1 - 2014

N2 - This paper studies deterministic sensor deployment for barrier coverage in wireless sensor networks. Most of existing works focused on line-based deployment, ignoring a wide spectrum of potential curve-based solutions. We, for the first time, extensively study the sensor deployment under a general setting. We first present a condition under which the line-based deployment is suboptimal, revealing the advantage of curve-based deployment. By constructing a contracting mapping, we identify the characteristics for a deployment curve to be optimal. Based on the optimal deployment curve, we design sensor deployment algorithms by introducing a new notion of distance-continuous. Our findings show that i) when the deployment curve is distance-continuous, the proposed algorithm is optimal in terms of the vulnerability corresponding to the deployment, and ii) when the deployment curve is not distance-continuous, the approximation ratio of the vulnerability corresponding to the deployment by the proposed algorithm to the optimal one is upper bounded by \min(π, \frac{||\widetilde{AB}||}{||\widetilde{AGB}||}\frac{2n+\sqrt{2}-1}{2n} ), where ||\widetilde{AB}|| and ||\widetilde{AGB}|| are some constants, and n is the number of sensors. We generalize the study to the heterogeneous sensing model, and show that the proposed algorithm can provide close-to-optimal performance. Extensive numerical results corroborate our analysis.

AB - This paper studies deterministic sensor deployment for barrier coverage in wireless sensor networks. Most of existing works focused on line-based deployment, ignoring a wide spectrum of potential curve-based solutions. We, for the first time, extensively study the sensor deployment under a general setting. We first present a condition under which the line-based deployment is suboptimal, revealing the advantage of curve-based deployment. By constructing a contracting mapping, we identify the characteristics for a deployment curve to be optimal. Based on the optimal deployment curve, we design sensor deployment algorithms by introducing a new notion of distance-continuous. Our findings show that i) when the deployment curve is distance-continuous, the proposed algorithm is optimal in terms of the vulnerability corresponding to the deployment, and ii) when the deployment curve is not distance-continuous, the approximation ratio of the vulnerability corresponding to the deployment by the proposed algorithm to the optimal one is upper bounded by \min(π, \frac{||\widetilde{AB}||}{||\widetilde{AGB}||}\frac{2n+\sqrt{2}-1}{2n} ), where ||\widetilde{AB}|| and ||\widetilde{AGB}|| are some constants, and n is the number of sensors. We generalize the study to the heterogeneous sensing model, and show that the proposed algorithm can provide close-to-optimal performance. Extensive numerical results corroborate our analysis.

KW - Barrier coverage

KW - curved-based deployment

KW - deployment algorithms

KW - optimal deployment curve

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

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

U2 - 10.1109/TWC.2013.121813.130198

DO - 10.1109/TWC.2013.121813.130198

M3 - Article

VL - 13

SP - 724

EP - 735

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 2

M1 - 6697932

ER -