Towards an Optimal Energy Consumption for Unattended Mobile Sensor Networks through Autonomous Sensor Redeployment

Algorithm 1

For each corona 𝐶_𝑖, 𝑖∈(𝑛,𝑛−1,…,1)

   If 𝐷_𝑖>𝐸𝐷_𝑖

   Select 𝐷_𝑖−𝐸𝐷_𝑖 nodes close to 𝐶_𝑖−1 from 𝐶_𝑖;

   Move these nodes straight to 𝐶_𝑖−1 and update 𝐷_𝑖−1=𝐷_𝑖−1+(𝐷_𝑖−𝐸𝐷_𝑖);

   For each ring 𝐶^𝑘_𝑖, 𝑘∈(1,2,…,𝑁_𝑖)

   Move 𝜌_𝑖⋅𝑆_𝐶^𝑘_𝑖 nodes straight to the middle line of 𝐶^𝑘_𝑖

  Elseif 𝐷_𝑖≤𝐸𝐷_𝑖

    Select 𝐸𝐷_𝑖−𝐷_𝑖 nodes close to 𝐶_𝑖 from 𝐶_𝑖−1;

    Move these nodes straight to 𝐶_𝑖 and update 𝐷_𝑖−1=𝐷_𝑖−1−(𝐸𝐷_𝑖−𝐷_𝑖);

    For each ring 𝐶^𝑘_𝑖, 𝑘∈(1,2,…,𝑁_𝑖)

    Move 𝜌_𝑖⋅𝑆_𝐶^𝑘_𝑖 nodes straight to the middle line of 𝐶^𝑘_𝑖.