.png){kind=icon}
.png){kind=icon}
Return
Game Theory-Based Energy-Efficient Clustering Algorithm for Wireless Sensor Networks
.png){kind=icon}
OA
AI
DOI：10.3390/s22020478.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Energy efficiency is one of the critical challenges in wireless sensor networks (WSNs). WSNs collect and transmit data through sensor nodes. However, the energy carried by the sensor nodes is limited. The sensor nodes need to save energy as much as possible to prolong the network lifetime. This paper proposes a game theory-based energy-efficient clustering algorithm (GEC) for wireless sensor networks, where each sensor node is regarded as a player in the game. According to the length of idle listening time in the active state, the sensor node can adopt favorable strategies for itself, and then decide whether to sleep or not. In order to avoid the selfish behavior of sensor nodes, a penalty mechanism is introduced to force the sensor nodes to adopt cooperative strategies in future operations. The simulation results show that the use of game theory can effectively save the energy consumption of the sensor network and increase the amount of network data transmission, so as to achieve the purpose of prolonging the network lifetime.
Keywords:
wireless sensor network
game theory
penalty mechanism
idle listening time
network lifetime
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.