Algorithm 1. Energy Aware Routing Protocol

Notations: d: distance between transmitting and receiving node

n: costant

E_min: minimize energy of receiving node

E_amp: Amplifier energy

E_elec: Electronics energy

E_TX: energy consumption of transmitter

E_RX: energy consumption of receiver

E_r: relative residual energy value

l: packet size

i: number of sensing node() E_TR: transmitting and receiving energy

E_R: relative residual energy value of all nodes

T_nek: network lifetime

T_i: network lifetime of node i

1. Input: i Output: E_R, T_i

2. Sort neighbor nodes by residual energy, select the first node in the sorted list has the highest residual energy

3. n = 2

4.

5.

6. 7. do 8. Select E_r 9. Estimate for the node 10. Calculate sensing energy only for the node satisfying, and update

11. Select largest residual energy neighbor node as next hop

12. Output T_i

13. Increase E_r by one

14. While (residual energy < E_r)