An Efficient Algorithm to Enhance Nonoverlapping Coverage Area with Less Energy Consumption in WSN

Algorithm 1

Generate cover set ().

Input: S_Node = Total Sensor nodes; T = Total number of Targets;

    NetLife =0; Uncovered (t) = T; Ei = Initial Battery Power of sensors; S_k = φ;

Output: Generate k- Cover Sets.

    Calculate Critical Target c_t

    Calculate Critical Sensor C_s

    Calculate upper bound UB

  While UB !==0

    While uncovered (c_t) >0

     Select Critical Sensor node s_i with highest battery Power E_i that covers maximum uncovered target

     S_k = S_k U s_i ;

     S_Node = S_Node - s_i;

     for all targets covered by s_i

      Uncovered (c_t) = Uncovered (c_t) – 1;

     end for

    end While

    T = T - c_t;

    While uncovered (c) >0

     Select Sensor node s_i with highest battery Power E_i that cover maximum uncovered target

     S_k = S_k U s_i;

     S_Node = S_Node - s_i;

     for all targets covered by s_i

      Uncovered (c) = Uncovered (c) – 1;

     end for

    end While

   //Remove redundant sensors generated in k-Cover

   Minimize_Cover_Sk ( )

    //Assign Working time of Generated K-Cover

     W_t = Min s_i ε S_k (E_i);

    //update remaining battery power of sensor nodes

     for s_i ε S_k

      E_i = E_i - W_t

      if E_i < =1

       Calculate required power using Equation ((7))

       Add Power to the sensor node

      end if

     end for

   end While