By Topic

A coverage-guaranteed nodes scheduling algorithm in clusters for 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

2 Author(s)
Xu Bao ; Sch. of Traffic Eng., Huaiyin Inst. of Technol., Huai''an, China ; Yongfeng Ju

In order to balance the nodes' energy consumption, prolong the lifetime of Wireless Sensor Networks (WSNs), this paper combined cluster and node scheduling, proposed a coverage-guaranteed nodes scheduling algorithm in clusters for WSNs (CGNSC). In this algorithm, clusters are set up at first, then every node in every cluster judges whether itself is a redundant node according to follow conditions: the first one, it has more than 3 neighbor nodes whose distance to itself are less than nodes' monitor radius R; the other one, it can be circle covered by the neighbor nodes satisfying the first condition. If any node satisfies the two conditions above, it is a redundant one which must turn into sleep state immediately. Simulations in Matlab 7.1 indicate that, this algorithm can decrease the energy consumption of WSNs, and the schedule efficiency has an affinity with node density and node monitor radius.

Published in:

Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on

Date of Conference:

21-23 April 2012