Optimal Location through Distributed Algorithm to Avoid Energy Hole in Mobile Sink WSNs

Algorithm 1

Find best location(𝑒(1∶𝑛)).

           //To find the optimal sink anchor

(1)  Maxenergy = 0;

(2) min_global_energy = ∞;   //current value that minimize the maximum energy consumption

(3) For 𝑥₀=−𝑅∶𝑅

(5) For 𝑦₀=𝑅²−𝑥²₀

       //sink can pause at any point of the network

(6)  Maxenergy = 0;

       //set the initial maximum energy consumption as 0

(7)   for 𝑖=1∶𝑛   //number of nodes

(8)    for each 𝑟 do

(9) computer energy 𝐸(𝑖) consumption use Corollary 2

//compute energy cost of 𝑖 node when sink is at (𝑥₀,𝑦₀)

(10)      𝐸𝑎(𝑖)=𝑒(𝑖)+𝐸(𝑖)

  // 𝑒(𝑖) represent the actual energy consumption of node 𝑖

(11)      If Maxenergy < 𝐸𝑎(𝑖)   //when the energy

// consumption of 𝑖 node is larger than current maximum

(12)       Maxenergy = 𝐸𝑎(𝑖)  //compare energy of

    //sink(𝑥₀,𝑦₀) is the energy consumption of node 𝑖

(13)      Endif

(14)    End for

(15)   End for;

(16)   If min_global_energy > Maxenergy   // Maxenergy

//represent the maximum energy consumption of sink(𝑥₀,𝑦₀)

(17)      min_global_energy = Maxenergy

        //minimize the comprehensive energy

(18)      𝑥_best=𝑥₀; 𝑦_best=𝑦₀;

 //next sink anchor to minimize the comprehensive energy

(19)   Endif

(20)  End for

(21) End for

(22) Return(𝑥_best,𝑦_best);

//return the optimal next sink anchor