Abstract
Path coverage is an important issue in wireless sensor networks. Some algorithms are presented to solve path coverage problem in some specialized situations. However, they cannot be applied in common sensor networks applications. Moreover, energy conservation is not considered in these works. This paper presented a maximum lifetime path coverage algorithm in sensor networks. The goal is to divide the sensors into h groups, and schedule all groups such that the maximum lifetime can be achieved. We transform the problem into several sub problems and give a heuristic algorithm for it. Simulation experiments are conducted to find the impact of the size, the initial energy and the sensing radius of the sensor to the maximum lifetime.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
