Max-Min Fair Link Quality in WSN Based on SINR

Algorithm 3

The principle of the algorithm for the JLSPA problem.

 Input: A set 𝐿 of links located arbitrarily in the Euclidean plane;

 Output: A feasible schedule 𝑆, the SINR_threshold;

(1) while (there are still links not assigned to a slot) do

(2)   ⇒ take a new slot time;

(3)   ⇒ examine the non assigned links according to increasing distance to BS;

(4)   ⇒ assign link (𝑗) to the current time slot if the function 𝑡𝑒𝑠𝑡(𝑗) returns 𝑇𝑟𝑢𝑒;

(1) 𝑡𝑒𝑠𝑡(𝑗);

(2) cond1: the link (𝑗) and the other links in the current

   time slot have no receiver in common;

(3) cond2: the sender node of link (𝑗) and the receiver

   nodes of the other links in the current time slot are different;

(4) cond3: assign a power for each sender node by solving problem 𝐷₁.

   The minimal value of the SINR evaluated for the set of links belonging to the

   current time slot, including link (𝑗), is bigger than the SINR_threshold;

(5) if  (cond1 & cond2 & cond3) then

(6)   return True;

(7) else

(8)   return False;