Localized coverage boundary detection for wireless sensor networks

Chi Zhang, Yanchao Zhang, Yuguang Fang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metrics used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metrics, 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. As compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. They are also truly distributed and localized by merely needing the minimal position information of one-hop neighbors and a limited number of simple local computations, 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)
Title of host publicationACM International Conference Proceeding Series
Volume191
DOIs
StatePublished - 2006
Externally publishedYes
Event3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks - Waterloo, ON, Canada
Duration: Aug 7 2006Sep 8 2006

Other

Other3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
CountryCanada
CityWaterloo, ON
Period8/7/069/8/06

Fingerprint

Wireless sensor networks
Sensor nodes
Base stations
Energy efficiency
Scalability
Topology

ASJC Scopus subject areas

  • Human-Computer Interaction

Cite this

Zhang, C., Zhang, Y., & Fang, Y. (2006). Localized coverage boundary detection for wireless sensor networks. In ACM International Conference Proceeding Series (Vol. 191). [1185390] https://doi.org/10.1145/1185373.1185390

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

ACM International Conference Proceeding Series. Vol. 191 2006. 1185390.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, C, Zhang, Y & Fang, Y 2006, Localized coverage boundary detection for wireless sensor networks. in ACM International Conference Proceeding Series. vol. 191, 1185390, 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Waterloo, ON, Canada, 8/7/06. https://doi.org/10.1145/1185373.1185390
Zhang C, Zhang Y, Fang Y. Localized coverage boundary detection for wireless sensor networks. In ACM International Conference Proceeding Series. Vol. 191. 2006. 1185390 https://doi.org/10.1145/1185373.1185390
Zhang, Chi ; Zhang, Yanchao ; Fang, Yuguang. / Localized coverage boundary detection for wireless sensor networks. ACM International Conference Proceeding Series. Vol. 191 2006.
@inproceedings{2422f087b1a84cbcb4de8c6325305ca2,
title = "Localized coverage boundary detection for wireless sensor networks",
abstract = "Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metrics used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metrics, 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. As compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. They are also truly distributed and localized by merely needing the minimal position information of one-hop neighbors and a limited number of simple local computations, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.",
author = "Chi Zhang and Yanchao Zhang and Yuguang Fang",
year = "2006",
doi = "10.1145/1185373.1185390",
language = "English (US)",
isbn = "1595935371",
volume = "191",
booktitle = "ACM International Conference Proceeding Series",

}

TY - GEN

T1 - Localized coverage boundary detection for wireless sensor networks

AU - Zhang, Chi

AU - Zhang, Yanchao

AU - Fang, Yuguang

PY - 2006

Y1 - 2006

N2 - Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metrics used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metrics, 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. As compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. They are also truly distributed and localized by merely needing the minimal position information of one-hop neighbors and a limited number of simple local computations, 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 metrics used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metrics, 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. As compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. They are also truly distributed and localized by merely needing the minimal position information of one-hop neighbors and a limited number of simple local computations, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.

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

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

U2 - 10.1145/1185373.1185390

DO - 10.1145/1185373.1185390

M3 - Conference contribution

AN - SCOPUS:34547616629

SN - 1595935371

SN - 9781595935373

VL - 191

BT - ACM International Conference Proceeding Series

ER -