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  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.
|Number of pages||5|
|State||Published - 1 Dec 2004|
|Event||GLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States|
Duration: 29 Nov 2004 → 3 Dec 2004
|Conference||GLOBECOM'04 - IEEE Global Telecommunications Conference|
|Period||29/11/04 → 3/12/04|