Improved W-LEACH Decentralized protocol with game theory | Zendy

Abdelhalim Hnini | Zendy; Mohammed Fihri | Zendy; Abdelmajid Hajami | Zendy; El Mehdi Kandoussi | Zendy; Mohamed Nabil | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Improved W-LEACH Decentralized protocol with game theory

Author(s) -

Abdelhalim Hnini,

Mohammed Fihri,

Abdelmajid Hajami,

El Mehdi Kandoussi,

Mohamed Nabil

Publication year - 2020

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2020.07.078

Subject(s) - computer science , scalability , wireless sensor network , game theory , node (physics) , protocol (science) , distributed computing , computer network , set (abstract data type) , energy consumption , cooperative game theory , mathematical optimization , medicine , ecology , programming language , alternative medicine , structural engineering , pathology , database , engineering , economics , biology , microeconomics , mathematics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research