A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks

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

Algorithm 3 Local search phase.

1:
procedure LocalSearch( $G (L (R_{i}))$ , Φ )
2:
$E =$ $Set of edges in$ $G (L (R_{i}))$
3:
$K = {(n_{v}, n_{u}, n_{w}) ∣ n_{v}, n_{u}, n_{w} \in L (R_{i}), (n_{v}, n_{u}) \in E, n_{w} \in Φ,$ and $n_{v}$ and $n_{u}$

$are adjacent to all nodes in$ Φ except $n_{w},$ $E P A (Φ ⋃ {n_{u}, n_{v}} \ {n_{w}}) > E P A (Φ)}$
4:
while $| K | > 0$ do
5:
Select $(n_{v}, n_{u}, n_{w}) \in K$
6:
$Φ = Φ ⋃ {n_{u}, n_{v}} \ {n_{w}}$
7:
$K = {(n_{v}, n_{u}, n_{w}) ∣ n_{v}, n_{u}, n_{w} \in L (R_{i}), (n_{v}, n_{u}) \in E, n_{w} \in Φ,$ and $n_{v}$ and $n_{u}$

$are adjacent to all nodes in Φ$ except $n_{w},$ $E P A (Φ ⋃ {n_{u}, n_{v}} \ {n_{w}}) > E P A (Φ)}$
8:
$end while$
9:
$end procedure$