TY - GEN
T1 - Detecting coverage boundary nodes in 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 - The objective of this paper is to provide a distributed protocol that allows individual sensor nodes to identify themselves as being located on the coverage boundary, which is required in a number of functionalities at both the network and application levels. We develop a deterministic method for boundary node detection based on localized Voronoi polygons, the technique originated from the computational geometry. The advantages of our method are: it is a deterministic one that can be applied to any arbitrarily deployed sensor network, it is truly localized, only need one-hop neighbors' information, which guarantees the scalability and energy efficiency of the detection algorithms and it requires only a limited number of simple local computations. We also provide mathematical as well as experimental evidence for the correctness and efficiency of this method. ©2006 IEEE.
AB - The objective of this paper is to provide a distributed protocol that allows individual sensor nodes to identify themselves as being located on the coverage boundary, which is required in a number of functionalities at both the network and application levels. We develop a deterministic method for boundary node detection based on localized Voronoi polygons, the technique originated from the computational geometry. The advantages of our method are: it is a deterministic one that can be applied to any arbitrarily deployed sensor network, it is truly localized, only need one-hop neighbors' information, which guarantees the scalability and energy efficiency of the detection algorithms and it requires only a limited number of simple local computations. We also provide mathematical as well as experimental evidence for the correctness and efficiency of this method. ©2006 IEEE.
UR - https://www.scopus.com/pages/publications/34250162907
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-34250162907&origin=recordpage
U2 - 10.1109/icnsc.2006.1673261
DO - 10.1109/icnsc.2006.1673261
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1424400651
SN - 9781424400652
T3 - Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06
SP - 868
EP - 873
BT - Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06
T2 - 2006 IEEE International Conference on Networking, Sensing and Control (ICNSC'06)
Y2 - 23 April 2006 through 25 April 2006
ER -