Energy-efficient sensor network design subject to complete coverage and discrimination constraints

In this paper, we develop a novel algorithm to deploy an energy-efficient wireless sensor network (WSN) for the target-location service that is one of the major applications of sensor networks. Such sensor network has to be designed to achieve complete coverage quality of surveillance and full discrimination for predetermined resolution on the sensor field. To extend lifetime of sensor network, the duplicate deployment approach is a simple and intuitive way. However, such approach will result in increasing too much deployment cost. In this paper, we propose a novel strategy to cope with the problem. We consider deploying K independent sets of sensors to monitoring the area in turn and locating the intruder together. With this strategy, the duty cycle of each sensor is only 1/K and the lifetime of the sensor network will be extended up to K times. Such sensor placement problem is a variant of the set K-cover problem, which is NP-complete. We formulate the problem as a 0/1 integer-programming problem. A Lagrangean relaxation based heuristic then is proposed for solving the optimization problem. The experimental results show that the proposed strategy gets a significant improvement in the lifetime of sensor network compared to the duplicate deployment approach under the deployment cost constraint. The proposed algorithm is highly effective in terms of the overall deployment cost. Furthermore, the algorithm is very efficient and scalable in terms of the solution time. I. INTRODUCTION The rapid growth in sensor technology and wireless com- munication has led to the development of wireless sensor networks (WSNs). A wireless sensor network comprises sev- eral sensors, sink nodes, and back-end systems. These tiny, low-cost, and low power sensors are deployed in an ad hoc manner in an interested area. These sensors collect physical information from the area, process and forward the information to the sink nodes. Afterward, the back-ends can obtain global views according to the information provided by the sink nodes

[1]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[2]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Nitin H. Vaidya,et al.  Minimizing energy consumption in sensor networks using a wakeup radio , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[4]  P. Chiu,et al.  A simulated annealing algorithm to support the sensor placement for target location , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[5]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[6]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[7]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[8]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[9]  Pei-Ling Chiu,et al.  A near-optimal sensor placement algorithm to achieve complete coverage-discrimination in sensor networks , 2005, IEEE Communications Letters.

[10]  Nathan Ickes,et al.  Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks , 2001, MobiCom '01.

[11]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[12]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[13]  S. Sitharama Iyengar,et al.  Sensor placement for grid coverage under imprecise detections , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[14]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[15]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .