文献类型：期刊文献

英文题名：Energy-efficient clustering algorithm based on game theory for wireless sensor networks

作者：Liu, Qingwei[1];Liu, Mandan[1]

机构：[1]East China Univ Sci & Technol, Key Lab Adv Control & Optimizat Chem Proc, Minist Educ, 130 Meilong Rd, Shanghai 200237, Peoples R China

年份：2017

卷号：13

期号：11

外文期刊名：INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS

收录：;EI(收录号：20174904508659);WOS:【SCI-EXPANDED(收录号:WOS:000416279500001)】；

基金：The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was supported by the Fundamental Research Funds for the Central Universities (WH1213010).

语种：英文

外文关键词：Wireless sensor networks; clustering; energy efficiency; game theory; residual energy

摘要：Clustering is a popular method to achieve energy efficiency and scalable performance in large-scale sensor networks. Many clustering algorithms were proposed to use energy efficiently, extend network life span, and improve data transfer. Clustered routing for selfish sensors is a recently proposed algorithm based on game theory. In clustered routing for selfish sensors, the sensor nodes campaign to be cluster heads in order to achieve equilibrium probability. However, this algorithm needs global information for the computation of probability and disregard the uneven energy dissipation from different nodes that serve as cluster heads, thereby causing some nodes to die quickly. Therefore, an energy-efficient clustering algorithm based on game theory is proposed in this study. In the cluster head selection phase, each node competes as potential cluster head by joining a localized clustering game, and a potential cluster head is selected to be a real cluster head through a properly designed probability method. Simulation results show that the life span of wireless sensor networks extended by our algorithm becomes longer than those extended by low-energy adaptive clustering hierarchy and clustered routing for selfish sensors when proper parameters are used.