By Topic

Differential game based centralized clustering algorithm 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

5 Author(s)
Lin Lin ; Dept. of Commun. Eng., Univ. of Sci. & Technol. Beijing, Beijing, China ; Zhou Xianwei ; Deng Yu ; Du Liping
more authors

Clustering is an effective approach for managing nodes in wireless sensor networks (WSN). In this paper, we consider selfish avoidance clustering in WSN. A differential game model is proposed to stimulate forwarding. Based on the payoff value of the differential game, called forwarding contribution (FC) in this paper, a centralized clustering algorithm is proposed. Mathematical proof shows that our algorithm can ensure connection between cluster heads (CHs), and also shows that FC value can reasonably reflect energy consumption in terms of competition while considering forwarding efficiency. Simulation on the lifetime of network is performed, and the results illustrate that our algorithm is selfish avoidance while the clustering approaches according to residual energy are seriously influenced by selfishness.

Published in:

Future Information Networks, 2009. ICFIN 2009. First International Conference on

Date of Conference:

14-17 Oct. 2009