By Topic

A Branch and Bound Algorithm for Extending the Lifetime of Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yong-hwan Kim ; Lab. of Intell. Networksn, Korea Univ. of Technol. & Educ., Cheonan, South Korea ; Heon-Jong Lee ; Youn-Hee Han ; Young-Sik Jeong

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.

Published in:

Vehicular Technology Conference Fall (VTC 2009-Fall), 2009 IEEE 70th

Date of Conference:

20-23 Sept. 2009