Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage

One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment problem to achieve multilevel (k) coverage of the area of interest I. We consider two subproblems: k-coverage placement problem and distributed dispatch problem. The placement problem asks how to determine the minimum number of sensors required and their locations in I to guarantee that I is k-covered and the network is connected, while the dispatch problem asks how to schedule mobile sensors to move to the designated locations according to the result computed by the placement strategy, if they are not in the current positions, such that the energy consumption due to movement is minimized. Our solutions to the placement problem consider both the binary and probabilistic sensing models, and allow an arbitrary relationship between the communication distance and sensing distance of sensors, thereby relaxing the li...

• Type: Journal
• Year: 2008
• Where: TPDS
• Authors: You-Chiun Wang, Yu-Chee Tseng
• Keywords: Dispatch Problem, Placement Problem, Sensors, TPDS 2008