標題: The coverage problem in a wireless sensor network
作者: Huang, CF
Tseng, YC
資訊工程學系
Department of Computer Science
關鍵字: ad hoc network;computer geometry;coverage problem;ubiquitous computing;wireless network;sensor network
公開日期: 1-Aug-2005
摘要: 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 k sensors, where k is a given parameter. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k=1 is assumed. Applications of the result include determining insufficiently covered areas in a sensor network, enhancing fault-tolerant capability in hostile regions, and conserving energies of redundant sensors in a randomly deployed network. Our solutions can be easily translated to distributed protocols to solve the coverage problem.
URI: http://dx.doi.org/10.1007/s11036-005-1564-y
http://hdl.handle.net/11536/13458
ISSN: 1383-469X
DOI: 10.1007/s11036-005-1564-y
期刊: MOBILE NETWORKS & APPLICATIONS
Volume: 10
Issue: 4
起始頁: 519
結束頁: 528
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000230590100013.pdf