Abstract
One of the most significant difficulties for LEACH protocol in wireless sensor networks (WSNs) are network lifetime and scalability. To prolong that we schooled develop a specific energy distribution among sensor nodes. Therefore, an efficient sleep nodes optimization policy is essential for W-LEACH Decentralized. Recently, game theory has been introduced to choose Cluster Head. In this paper, we introduce this theory to choose a sleeping nodes according to node density and distance of set neighbors for each ordinary node. Through simulations results, our proposed game theory proved to have a good energy balancing performance and consequently the network lifetime greatly enhanced.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
