A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks

. 2016 Feb 26;16(3):297. doi: 10.3390/s16030297

Algorithm 2 Construction phase.

1:
procedure Construction( $G (L (R_{i}))$ , λ, Φ)
2:
$Set initial clique$ Φ $= \emptyset$
3:
Set $C = L (R_{i})$
4:
while $| C | > 0$ do
5:
$G (C) =$ $Sub-graph induced by C$
6:
$P A D_{G (C)} (n_{u}) = P_{i u} \times β_{i u} \times d e g_{G (C)} (n_{u})$
7:
$δ_{m i n} = m i n {P A D_{G (C)} (n_{u}) ∣ n_{u} \in C}$
8:
$δ_{m a x} = m a x {P A D_{G (C)} (n_{u}) ∣ n_{u} \in C}$
9:
$R C L = {n_{u} \in C ∣ P A D_{G (C)} (n_{u}) \geq δ_{m i n} + λ (δ_{m a x} - δ_{m i n})}$
10:
Select $n_{u}$ $at random from the RCL$
11:
Φ $= Φ ⋃ {n_{u}}$
12:
$C = N e i g h b o u r s_{C} (n_{u})$
13:
$end while$
14:
$end procedure$