By Topic

Coverage-time optimized dynamic clustering of networked sensors for pervasive home networking

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

5 Author(s)
Joongheon Kim ; Digital Media Res. Lab., Seoul ; Wonjun Lee ; Eunkyo Kim ; Doe-Wan Kim
more authors

This paper proposes a novel energy-efficient coverage-time optimized dynamic clustering scheme for two- tiered wireless sensor networks (WSNs) used in an outdoor monitoring application of home networking systems. The coverage-time is defined as the time until one of cluster heads (CHs) runs out of energy in clustering-based WSNs, thereby resulting in an incomplete coverage. DC-CTO scheme regulates cluster radii for balanced energy consumption among CHs to maximize coverage-time. There are several advantages of using the DC-CTO scheme. The first advantage is balanced energy consumption among CHs under NLP- based computations. The second advantage is minimized energy consumption in each CH to extend coverage-time. The last one is the guarantee of perfect coverage. If there is no area which is uncontrolled by a CH in a networked sensing field, we call it a perfect coverage. If there is an incomplete coverage, the event in the area cannot be identified. Therefore perfect coverage is important to robust monitoring systems. The novelty of DC-CTO scheme is demonstrated by various simulation-based performance evaluations.

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:53 ,  Issue: 2 )