Abstract
Network life time is a crucial perspective in target specified applications of wireless sensor network. Expedient sensor scheduling and power management can efficaciously prolong network lifetime. Sensors are divided into cover sets in which all targets are covered by a set of sensors and targets are monitored by each cover set for a period of time. The coverage problem proved to be NP-Complete. In present study, a unified elucidation of prior algorithms is given an efficient and new heuristic is proposed. The proposed heuristic prioritizes sensors based on the value of heuristic function. Its shown analytically that proposed heuristic outperforms other heuristic in terms of solutions quality. Our experimental analysis over a randomly generated large set of problem instances demonstrate that proposed heuristic solution is close to the definite optimal solution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
