By Topic

A Greedy Algorithm to Extend the Lifetime of Randomly Deployed Directional 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

3 Author(s)
Joon-Min Gil ; Sch. of Comput. & Inf., Catholic Univ. of Daegu, Daegu, South Korea ; Chan-Myung Kim ; Youn-Hee Han

Directional sensor networks (DSNs) comprise a large number of sensors equipped with a limited battery and limited angles of sensing range. In DSNs, maximizing network lifetime while covering all the targets in a given area is still a challenge problem. A major technique to save the energy power of sensors is to use a node wake-up scheduling protocol by which some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. In this paper, we first address the MSCD (Maximum Set Cover for DSNs) problem that is known as NP-complete and then present a new target coverage scheduling scheme to solve this problem with a greedy algorithm. To verify and evaluate the proposed scheme, we conduct simulations and show that it can contribute to extending the network lifetime largely. By the simulations, we also present an energy-efficient strategy to choose a sensor in order to organize a scheduling set in the greedy scheme.

Published in:

Ubiquitous Information Technologies and Applications (CUTE), 2010 Proceedings of the 5th International Conference on

Date of Conference:

16-18 Dec. 2010