| Title |
An Improved Algorithm for the overload problem of EDL-LEACH |
| DOI |
https://doi.org/10.5573/ieie.2019.56.7.63 |
| Keywords |
Wireless Sensor Network; protocol; DL-LEACH; Multi-Hop; Routing |
| Abstract |
This paper proposes an algorithm that improves the problem of EDL-LEACH, one of the routing protocols of wireless sensor networks. EDL-LEACH is a protocol that improves the absence of cluster head member, which is a problem of DL-LEACH. The absence of cluster head, which is a problem of DL-LEACH, is improved to upgrade the data transmission success rate than DL-LEACH. However, the network life-time becomes short due to overload of the cluster head close to the base station in EDL-LEACH. Therefore, it is intended to increase the number of cluster heads in the layer close to the base station of the EDL-LEACH and to reduce the number of cluster heads in the other layer to increase the energy consumption efficiency. In order to compare the energy consumption efficiency of EDL-LEACH and the proposed algorithm, we compared the number of alive nodes per round of the proposed algorithm with the existing EDL-LEACH by simulation. |