Review of Top Algorithms Based on LEACH Protocol

Review of Top Algorithms Based on LEACH Protocol

Rasoul Kiani1 Mojtaba Montazeri2

1) Iran University of Fars Science and Research Branch
2) Iran University of Fars Science and Research Branch

IOI Code : XYCC-ABDAE
Publication : International Conference on Science and Engineering(icesconf.com)
Abstract :
    Wireless sensor networks (WSNs) include a number of nodes that can communicate with each other and with the base station. In these networks due to the nature characteristics compared to the other wireless networks the routing has been a main challenge and its related protocols may be designed based on the application or type of architecture. In the cluster-based protocols, the network is divided into small groups called clusters and each cluster has a cluster head and some members. The use of clustering has made for improving the network lifetime and the optimize use of energy. LEACH algorithm has been one of the main routing protocols of hierarchical type in which cluster heads are elected at random. Several methods such as algorithms PLEACH, Modified LEACH, E-LEACH and LEACH-C have been provided in order to improve that and in this paper the advantages, disadvantages, efficiency and challenges related to them are examined.

Keywords : wsns leach protocol hierarchical cluster based routing