@inproceedings{d248dbd41a8448568d5d5480557dbf51,
title = "A branch and bound algorithm for extending the lifetime of wireless sensor networks",
abstract = "One of most critical issues in power-constrained wireless sensor networks is to maximize the network lifetime. Recently, studies have been made on scheduling sensor activity to prolong network lifetime. In this paper, we address the maximum set covers (MSC) problem to maximize the network lifetime and propose an energy-efficient sensor scheduling algorithm for the MSC problem based on the branch and bound approach. Simulation results show that the proposed algorithms can contribute to extending the network lifetime and its performance is better than the existing greedy-based algorithm.",
keywords = "Branch and bound algorithm, Network lifetime, Power saving, Sensor scheduling, Wireless sensor network",
author = "Kim, \{Yong Hwan\} and Lee, \{Heon Jong\} and Han, \{Youn Hee\} and Jeong, \{Young Sik\}",
year = "2009",
doi = "10.1109/VETECF.2009.5379107",
language = "English",
isbn = "9781424425150",
series = "IEEE Vehicular Technology Conference",
booktitle = "Proceedings of the 2009 IEEE 70th Vehicular Technology Conference Fall, VTC 2009 Fall",
note = "2009 IEEE 70th Vehicular Technology Conference Fall, VTC 2009 Fall ; Conference date: 20-09-2009 Through 23-09-2009",
}