Algorithm 3 Minimum Maximum Neighbor (MMN)

Input:$AV{B}_{net}$ (Available Networks) Output:$Mi{n}_{ID}$ and $Ma{x}_{ID}$

1:procedure 2: Step 1: defining and initializing variables 3:    $Arra{y}_{id}$ = Array containing available networks IDs 4:    $F_{index}$ = First index of $Arra{y}_{id}$ 5:    $L_{index}$ = Last index of $Arra{y}_{id}$ 6: Step 2: Finding Minimum and Maximum IDs 7:    Store $AV{B}_{net}$ in $Arra{y}_{id}$ 8:    Sort $Arra{y}_{id}$ in ascending order 9:    $Mi{n}_{ID}$ = $Arra{y}_{id}$ [ $F_{index}$] 10:    $Ma{x}_{ID}$= $Arra{y}_{id}$ [ $L_{index}$] 11:end procedure