Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Localized algorithm for connected set cover partitioning in 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

3 Author(s)
Pervin, N. ; Sch. of Comput., Nat. Univ. of Singapore, Singapore, Singapore ; Layek, D. ; Das, N.

In this paper, given a random distribution of sensor nodes, we pose the problem of finding maximum number of connected set covers such that each set can guarantee the required coverage of the region of interest. It requires just a one-time computation during initialization. Once the connected set covers are known, the sets may remain active in a round robin fashion to cover the region enhancing the life time of the network significantly. Firstly, two centralized greedy algorithms have been proposed to solve the problem from two different view points. But since centralized algorithms are not suitable for large self-organized sensor networks, a localized algorithm has been proposed finally that uses only local information at individual nodes to find a solution. Simulation studies show that these algorithms can enhance the network lifetime manifold, and most interestingly the performance of the distributed algorithm is comparable with the centralized ones in terms of number of partitions though it requires much less computation and communication overhead.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Date of Conference:

28-30 Oct. 2010