The coverage problem in three-dimensional wireless sensor networks

Chi Fu Huang*, Yu-Chee Tseng, Li Chu Lo

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

128 Scopus citations

Abstract

One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least a sensors, where a is a given parameter and the sensing regions of sensors are modeled by balls (not necessarily of the same radius). This problem in a 2D space is solved in [1] with an efficient polynomial-time algorithm (in terms of the number of sensors). In this paper, we show that tackling this problem in a 3D space is still feasible within polynomial time. The proposed solution can be easily translated into an efficient polynomial-time distributed protocol.

Original languageEnglish
Pages3182-3186
Number of pages5
StatePublished - 1 Dec 2004
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: 29 Nov 20043 Dec 2004

Conference

ConferenceGLOBECOM'04 - IEEE Global Telecommunications Conference
CountryUnited States
CityDallas, TX
Period29/11/043/12/04

Fingerprint Dive into the research topics of 'The coverage problem in three-dimensional wireless sensor networks'. Together they form a unique fingerprint.

Cite this