A Simple Randomized Algorithm for Complete Target Coverage Problem in Sensor Wireless Networks
Achieving energy efficient monitoring of targets is a critical issue in sensor networks and, thus various power efficient coverage algorithms have been proposed. These algorithms divide the sensors into monitor sets, where each monitor set is able to cove
- PDF / 161,845 Bytes
- 6 Pages / 439.37 x 666.142 pts Page_size
- 1 Downloads / 188 Views
Abstract Achieving energy efficient monitoring of targets is a critical issue in sensor networks and, thus various power efficient coverage algorithms have been proposed. These algorithms divide the sensors into monitor sets, where each monitor set is able to cover all the targets. However, even the number of monitor sets is set to 3, the considered problem has been proven to be NP-hard. In this paper, we propose a randomized and efficient coverage algorithm that produces disjoint monitor sets, i.e., monitor sets with no common sensors. The monitor sets are activated successively and only the sensor nodes from the current active set are responsible for monitoring all the target nodes, while all other nodes are in a low-energy sleep mode. Our algorithm can generate a solution with guaranteed probability 1 e ð0\e\1Þ. Simulation results are presented to verify our approach. Keywords Wireless sensor network Monitor sets
Energy efficiency Sensor scheduling
1 Introduction Wireless sensor networks (WSNs) provide new applications for military applications, environmental monitoring, target surveillance and disaster prevention. Sensor nodes are small devices equipped with one or more sensors, one or more transceivers, storage resources and processing. The characteristics of sensor network include limited resources, a dynamic topology and, dense and large networks. W. Luo (&) Z. Cai Z. Zeng Department of Computer Science, Huizhou University, Huizhou, China e-mail: [email protected] Z. Cai e-mail: [email protected] Z. Zeng e-mail: [email protected] © Springer Science+Business Media Singapore 2016 J.C. Hung et al. (eds.), Frontier Computing, Lecture Notes in Electrical Engineering 375, DOI 10.1007/978-981-10-0539-8_37
373
374
W. Luo et al.
Depending on the application and the environment, sensor node deployment and placement can be realized by a predefined way or a random way. In hostile environments, sensor nodes are dropped from an aeroplane, resulting in a random placement, where the node density cannot be guaranteed and some areas may contain more sensors than others. A sensor node can be in one of the following three modes of operation: active mode, sleep mode and off mode. In the active mode, a sensor can communicate with other sensors. In sleep mode, a sensor cannot monitor or transmit data. Obviously, in the sleep mode, the sensor consumes much less energy than in the active mode. In the off mode, the sensor nodes are completely turned off. Sensors have limited battery life, and thus, a critical issue in sensor networks is power efficiency. Power saving techniques can generally be classified into four categories: (1) schedule the sensors to alternate between active and sleep mode; (2) power control by the way of adjusting the transmission range of sensors; (3) power efficient routing; (4) reducing the amount of data transmitted. Herein, we address the first method, that is, we design a mechanism that allows redundant nodes to enter sleep mode. The set of sensors are divided into subsets, called monitor set, where e
Data Loading...
