Localized algorithms for coverage boundary detection in wireless sensor networks

Chi Zhang, Yanchao Zhang, Yuguang Fang

Research output: Contribution to journalArticle

64 Citations (Scopus)

Abstract

Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metric, we propose two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition. Our algorithms are based on two novel computational geometric techniques called localized Voronoi and neighbor embracing polygons. Compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. The algorithms are fully distributed in the sense that only the minimal position information of one-hop neighbors and a limited number of simple local computations are needed, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.

Original languageEnglish (US)
Pages (from-to)3-20
Number of pages18
JournalWireless Networks
Volume15
Issue number1
DOIs
StatePublished - Jan 2009
Externally publishedYes

Fingerprint

Wireless sensor networks
Sensor nodes
Base stations
Energy efficiency
Scalability
Topology

Keywords

  • Computational geometry
  • Connected coverage
  • Localized algorithm
  • Wireless sensor networks (WSNs)

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Information Systems

Cite this

Localized algorithms for coverage boundary detection in wireless sensor networks. / Zhang, Chi; Zhang, Yanchao; Fang, Yuguang.

In: Wireless Networks, Vol. 15, No. 1, 01.2009, p. 3-20.

Research output: Contribution to journalArticle

@article{9654d82061a841c9a4e99efed863c4ae,
title = "Localized algorithms for coverage boundary detection in wireless sensor networks",
abstract = "Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metric, we propose two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition. Our algorithms are based on two novel computational geometric techniques called localized Voronoi and neighbor embracing polygons. Compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. The algorithms are fully distributed in the sense that only the minimal position information of one-hop neighbors and a limited number of simple local computations are needed, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.",
keywords = "Computational geometry, Connected coverage, Localized algorithm, Wireless sensor networks (WSNs)",
author = "Chi Zhang and Yanchao Zhang and Yuguang Fang",
year = "2009",
month = "1",
doi = "10.1007/s11276-007-0021-1",
language = "English (US)",
volume = "15",
pages = "3--20",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Localized algorithms for coverage boundary detection in wireless sensor networks

AU - Zhang, Chi

AU - Zhang, Yanchao

AU - Fang, Yuguang

PY - 2009/1

Y1 - 2009/1

N2 - Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metric, we propose two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition. Our algorithms are based on two novel computational geometric techniques called localized Voronoi and neighbor embracing polygons. Compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. The algorithms are fully distributed in the sense that only the minimal position information of one-hop neighbors and a limited number of simple local computations are needed, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.

AB - Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metric, we propose two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition. Our algorithms are based on two novel computational geometric techniques called localized Voronoi and neighbor embracing polygons. Compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. The algorithms are fully distributed in the sense that only the minimal position information of one-hop neighbors and a limited number of simple local computations are needed, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.

KW - Computational geometry

KW - Connected coverage

KW - Localized algorithm

KW - Wireless sensor networks (WSNs)

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

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

U2 - 10.1007/s11276-007-0021-1

DO - 10.1007/s11276-007-0021-1

M3 - Article

AN - SCOPUS:58149512210

VL - 15

SP - 3

EP - 20

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 1

ER -