By Topic

Clustering routing algorithm using game-theoretic techniques for WSNs

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
$33 $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)
Zheng Zeng-Wei ; Coll. of Comput. Sci., Zhejiang Univ., Hangzhou, China ; Wu Zhao-Hui ; Lin Huai-Zhong

Wireless sensor networks (for short, WSNs) can be used in many aspects in the future. One obstacle is their limited supply of energy. Therefore, minimizing energy consumption and maximizing the system lifetime have been major design goals for WSNs. This paper presents an energy-efficient ACHGT (Adaptive Clustering Hierarchy based on Game-theoretic Techniques) routing algorithm for WSNs. Individual sensors of the algorithm are modeled as players to make decisions about whether electing to become cluster-head nodes by using node energy payoff functions to weigh their own costs and benefits. This strategy can keep sensor nodes of lower remainder energy out from being used up quickly. Besides, it can evenly distribute the energy load among the sensors in the network to prolong system lifetime. Detailed simulations of sensor network environments demonstrate that the ACHGT algorithm reduces energy consumption, and improves the evenness of dissipated network energy and the ability to postpone the network partitions.

Published in:

Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on  (Volume:4 )

Date of Conference:

23-26 May 2004