標題: The coverage problem in three-dimensional wireless sensor networks
作者: Huang, CF
Tseng, YC
Lo, LC
資訊工程學系
Department of Computer Science
公開日期: 2004
摘要: 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.
URI: http://hdl.handle.net/11536/18110
ISBN: 0-7803-8794-5
期刊: GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6
起始頁: 3182
結束頁: 3186
顯示於類別:會議論文