Balancing Energy Consumption with Hybrid Clustering and Routing Strategy in Wireless Sensor Networks

. 2015 Oct 20;15(10):26583–26605. doi: 10.3390/s151026583

Algorithm 1 Clustering and routing algorithm in

R (1)

1:
Node i receives $E_{a v e} (1)$ from the sink;
2:
if $E_{r} (i) ⩾ E_{a v e} (1)$ then
3:
$N E X T (i) \leftarrow 1$ ;
4:
else
5:
$N E X T (i) \leftarrow 0$ ;
6:
end if
7:
Sets up random backoff timer $T_{b} (i)$ (Equation (5));
8:
repeat
9:
if Receives AC message from CH j then
10:
Records CH j to JOIN list;
11:
end if
12:
if Receives AR message from CH j AND $k (j) = 2$ then
13:
if $N E X T (j) = 0$ then
14:
Records CH j to SERV list;
15:
else if $N E X T (j) = 1$ AND CH j is in SERV list then
16:
Deletes CH j from SERV list;
17:
end if
18:
else if Receives AR message from CH j AND $k (j) = 1$ then
19:
if $N E X T (j) = 1$ AND $d (i, j) < d (i, 0)$ then
20:
Records CH j to RELAY list;
21:
end if
22:
end if
23:
until $T_{b}$ terminates
24:
if $N E X T (i) = 1$ then
25:
$s t a t u s \leftarrow C H$ ;
26:
Forwards the data to the sink directly;
27:
Broadcasts AC and AR message;
28:
else if SERV is not empty or JOIN is empty then
29:
$s t a t u s \leftarrow C H$ ;
30:
if RELAY is empty then
31:
Forwards the data to the sink directly;
32:
else
33:
Selects the relay with minimum $C_{r o u t e}$ from RELAY list (Equation (7));
34:
end if
35:
Broadcasts AC and AR message;
36:
else
37:
$s t a t u s \leftarrow C M$ ;
38:
Selects its CH with minimum $C_{f o r m}$ from JOIN list (Equation (8));
39:
end if