Green Communication for Wireless Body Area Networks: Energy Aware Link Efficient Routing Approach

. 2018 Sep 26;18(10):3237. doi: 10.3390/s18103237

Algorithm 1: Neighbor table construction algorithm of ELR-W protocol at node i

Notations:

H P

= Hello packet

R E_{j}

= Residual energy of neighbor node j

L E_{i, J}

= Link efficiency between node i and node j

H C_{j, B N C}

= Number of hop-counts from neighbor node j to BNC

d_{i, j}

= Distance between nodes i and j

(N T)

= Information in neighbor table

(H P)

= Information in Hello packets
Input:
HPs from a neighboring node j
Process:
1. start
2. for each HP do
3. if

H P (R E_{J}, L E_{i, J}, H C_{i, B N C}, d_{i, j}) \neq NT (R E_{J}, L E_{i, J}, H C_{i, B N C}, d_{i, j})

then
4. update record for neighbor information in neighbor table
5.

R E_{j} (N T) \leftarrow R E_{j} (H P)

L E_{i, j} (N T) \leftarrow L E_{i, j} (H P)

d_{i, j} (N T) \leftarrow d_{i, j} (H P)

H C_{i, B N C} (N T) \leftarrow H C_{i, B N C} (H P)

9. else
10. Discard HP
11. if

H P (E_{(R e s) J}, L E_{i, J}, H C_{i, B N C}, d_{i, j})

= null then
12. add record in neighbor table
13.

R E_{j} (N T) \leftarrow R E_{j} (H P)

14.

L E_{i, j} (N T) \leftarrow L E_{i, j} (H P)

15.

d_{i, j} (N T) \leftarrow d_{i, j} (H P)

16.

H C_{i, B N C} (N T) \leftarrow H C_{i, B N C} (H P)

17. else go to line 3
18. end if
19. end if
20. end for
21. end