Scheduling of Wireless Sensor Network for the Maximum Coverage
Wireless Sensor Networks (WSN) consist of a great number of low powered battery devices, which are widely
used for monitoring purpose. In WSN coverage is basic problem because node has limited power. The classical algorithm
assumes that coverage is known and covers the target area by one sensor. If sensor dies or battery rain out of energy, then
there is coverage hole. In this work formulated a set k-cover problem for we propose a random scheduling method, where
sensors are divided into subgroups. The groups are operated in ON and OFF pattern to maximize the coverage and reduce
the energy conservation of sensor.
Keywords - Wireless sensor network, target monitoring, k-Coverage, Scheduling