TY - GEN
T1 - Localized coverage boundary detection for wireless sensor networks
AU - Zhang, Chi
AU - Zhang, Yanchao
AU - Fang, Yuguang
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
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. © 2006 ACM.
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. © 2006 ACM.
UR - http://www.scopus.com/inward/record.url?scp=34547616629&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-34547616629&origin=recordpage
U2 - 10.1145/1185373.1185390
DO - 10.1145/1185373.1185390
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1595935371
SN - 9781595935373
VL - 191
T3 - ACM International Conference Proceeding Series
BT - ACM International Conference Proceeding Series - Proceedings of the 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
T2 - 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Y2 - 7 August 2006 through 8 September 2006
ER -