Abstract
Abstract This paper addresses the maximum network lifetime problem in wireless sensor networks. In this problem, the purpose is to schedule a set of wireless sensors, keeping them connected and guaranteeing that all targets are covered, while network lifetime is maximized. Two variants of this problem are considered; in the first case it is assumed that a single sink (base station) is available, the second case considers the presence of several sinks. To solve the problem, a hybrid Column Generation-GRASP heuristic is proposed. The method is shown to be able to find optimal or near optimal solutions efficiently in both cases.
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.
