Utility-Oriented Placement of Actuator Nodes with a Collaborative Serving Scheme for Facilitated Business and Working Environments

Algorithm 1

Pseudocodes of the recursive framework.

(1) Construct initial search space {𝐴_𝑖};

(2) repeat

(3) Determine {𝑑_𝑖,𝑗} via locations of {𝐴_𝑖} and {𝑃_𝑗}

(4) if  𝐼_min is not given then

(5)  Determine ∑𝑌_𝑖 and {𝑞_{𝑖,𝑗,𝑘}} through minimizing (1), subject to (4)–(14) for all 𝑖, 𝑗 and 𝐾, via BILP;

(6) else

(7)  Determine {𝑟_𝑖} and {𝑞_{𝑖,𝑗,𝑘}} through minimizing (3), subject to (4)–(14) for all 𝑖, 𝑗 and 𝐾, via BILP, with given 𝐼_min;

(8) end if

(9) Select {𝑞_{𝑖,𝑗,𝑘}} and {𝑟_𝑖} as the answer;

(10) Construct the refined search space {𝐴_𝑖} from the determined answer;

(11) until  𝑟_𝑖previous−𝑟_𝑖current2/𝑟_{𝑖previous2}≤𝜀