Detecting coverage boundary nodes in wireless sensor networks

Chi Zhang, Yanchao Zhang, Yuguang Fang

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

52 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06
Pages868-873
Number of pages6
StatePublished - 2006
Externally publishedYes
Event2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06 - Ft. Lauderdale, FL, United States
Duration: Apr 23 2006Apr 25 2006

Other

Other2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06
CountryUnited States
CityFt. Lauderdale, FL
Period4/23/064/25/06

Fingerprint

Computational geometry
Sensor nodes
Sensor networks
Energy efficiency
Scalability
Wireless sensor networks
Network protocols

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Zhang, C., Zhang, Y., & Fang, Y. (2006). Detecting coverage boundary nodes in wireless sensor networks. In Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06 (pp. 868-873). [1673261]

Detecting coverage boundary nodes in wireless sensor networks. / Zhang, Chi; Zhang, Yanchao; Fang, Yuguang.

Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06. 2006. p. 868-873 1673261.

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

Zhang, C, Zhang, Y & Fang, Y 2006, Detecting coverage boundary nodes in wireless sensor networks. in Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06., 1673261, pp. 868-873, 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06, Ft. Lauderdale, FL, United States, 4/23/06.
Zhang C, Zhang Y, Fang Y. Detecting coverage boundary nodes in wireless sensor networks. In Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06. 2006. p. 868-873. 1673261
Zhang, Chi ; Zhang, Yanchao ; Fang, Yuguang. / Detecting coverage boundary nodes in wireless sensor networks. Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06. 2006. pp. 868-873
@inproceedings{1fc7bab4e0064265ac0b6d5522a7b9ba,
title = "Detecting coverage boundary nodes in wireless sensor networks",
abstract = "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.",
author = "Chi Zhang and Yanchao Zhang and Yuguang Fang",
year = "2006",
language = "English (US)",
isbn = "1424400651",
pages = "868--873",
booktitle = "Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06",

}

TY - GEN

T1 - Detecting coverage boundary nodes in wireless sensor networks

AU - Zhang, Chi

AU - Zhang, Yanchao

AU - Fang, Yuguang

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.

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.

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

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

M3 - Conference contribution

SN - 1424400651

SN - 9781424400652

SP - 868

EP - 873

BT - Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06

ER -