DocumentCode :
1850268
Title :
A Game-Theoretic Approach for Efficient Clustering in Wireless Sensor Networks
Author :
Xiaotian Chen ; Yue Yin ; Zhanyang Xu
Author_Institution :
Inst. of Inf. Network Technol., Nanjing Univ. of Posts & Telecommun., Nanjing, China
fYear :
2013
fDate :
21-23 June 2013
Firstpage :
1663
Lastpage :
1666
Abstract :
Due to the constraints on available resources, a node in wireless sensor networks is likely to be selfish and refuse to declare itself as a cluster head. Based on game theory, this paper models the problem and discusses the condition of Nash Equilibrium. Simulation results show that nodes have tendency to cooperate due to the reduction in delay and loss rate.
Keywords :
game theory; wireless sensor networks; Nash equilibrium; delay; efficient clustering; game theory; game-theoretic approach; loss rate; wireless sensor networks; Energy consumption; Games; Nash equilibrium; Routing protocols; Waste materials; Wireless sensor networks; clustering; game theory; wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational and Information Sciences (ICCIS), 2013 Fifth International Conference on
Conference_Location :
Shiyang
Type :
conf
DOI :
10.1109/ICCIS.2013.435
Filename :
6643353
Link To Document :
بازگشت