The Load Balancing of Optimizing LEACH Clustering Algorithm with Mobile Sink and Rendezvous Nodes

摘要

This paper proposes a load balancing technique in optimizing LEACH clustering algorithm with mobile sink and Rendezvous nodes (RNs). The proposed paper focuses on network reliability, stability, lifetime and synchronous consumption of energy in the network. In this approach, the nodes which are outside the rendezvous region follow the clustering phenomenon. On the other hand, some nodes inside the rendezvous region are selected as RNs which are closest to their cluster heads and rest are treated as normal nodes which can transmit its data directly to the mobile sink. The simulation results verified that the performance of the proposed scheme is better than the optimizing LEACH.