Optimisation of LEACH protocol based on a game theory clustering approach for wireless sensor networks

Abstract

<p><span>The wireless sensor network clustering routing mechanism is the best multi-hop algorithm used to aggregate data from sensors to the base station. Therefore the elected nodes refuse to be a clusters heads CH and have a selfish and non cooperative behaviours in each group cluster. All that due to the high electric energy consumption, and especially that the most existing sensors are powered by batteries. In this paper, we will analyse the selfishness behaviour by using the most knowing mathematical model Game theory to improve the interaction decision making for the CH selection, and make a comparison with LEACH protocol.</span></p>

Improved uplink throughput and energy efficiency of LoRaWAN using 2-hop LEACH protocol

“…LEACH is a round-based MAC layer low energy hierarchical routing protocol. The round starts by a set-up process where the clusters are arranged, and terminate by a steady-state phase [18], [19], when the gathered packets is transmitted to the sink. Every node decides whether it will be a cluster head (CH) or not during the set-up stage, based on a predetermined threshold T n and a generated random number 0<i<1.…”