Authors: My T. Thai, Feng Wang, David Hongwei Du, Xiaohua Jia
Addresses: Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL 32611, USA. ' Department of Mathematical Sciences and Applied Computing, Arizona State University, Phoenix, AZ 85069, USA. ' Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China. ' Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China
Abstract: One fundamental problem in wireless sensor networks is the coverage problem, which reflects the quality of service that can be provided by a particular sensor network. The coverage problem is defined from several points of view due to a variety of sensor networks and a wide-range of their applications. Several different designs and formulations of the coverage problem have been proposed. They are subject to various topics such as types of interest regions (areas versus targets) and different network constraints, such as fault tolerance and bandwidth limitation. In this paper, we survey the state-of-the-art coverage formulations with an objective of maximising network lifetime. In particular, we present an overview and analysis of the solutions proposed in recent research literature.
Keywords: wireless sensor networks; WSNs; wireless networks; coverage problem; energy efficiency; sensor scheduling; coverage breach; quality of service; QoS; network lifetime.
International Journal of Sensor Networks, 2008 Vol.3 No.3, pp.191 - 200
Available online: 25 May 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article