And then we will give the analysis of the communication overhead of EELP. Finally, we make an evaluation of the trace back time.
In EELP, the contents of all transmitted data packets are encrypted by secret keys so that the adversary cannot gain the content of transmitted packets and find the location of sensors.
In this section, we simulate different algorithms (CDR, ELSP, EELP, LRP-EELP, and LPU-EELP) to evaluate and compare the performances of the EELP family with existing schemes.
In the family of EELP, there is no energy consumption in maintaining or reconstructing the topology; therefore, the average energy cost is lower than other algorithms.
In EELP, when selecting the next hop, each node will estimate the remaining energy of its neighbor to achieve balanced usage of energy.
From Figure 8, the EELP family shows longer lifetime than the other algorithms.
And the successful ratio of EELP is higher than other algorithms.
In EELP family, each node will estimate the remaining energy of its neighbor to send the packets to the next hop.
In EELP family, according to the remaining energy of the neighbor, a node randomly chooses the high remaining energy node as the next hop node.