Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks

Algorithm 4

SA compatible set perturbation scheme.

Require: Current solution compatible set CS

Ensure:  CS^′ = neighbor(CS)

(1)   Choose at random 𝑣∈𝒱 and 𝑒∈𝛿⁺(𝑣) that satisfy (11)–(14).

(2)  if  𝑣∈𝒜  then

(3)   if  random(0,1)<1/|ℳ(𝑒)|  then

(4)    𝒜←𝒜⧵{𝑣}  [deactivate node]

(5)   else

(6)    𝑚←random(ℳ(𝑒)⧵{𝑚})  [switch MCS]

(7)   end if

(8)  else

(9)   𝒜←𝒜∪{𝑣}  [activate node]

(10)  𝑚←random(ℳ(𝑒))  [select MCS]

(11) end if