Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm

Algorithm 1

HET Construction Algorithm.

Input:  Number of sensor Nodes n;

      Initial energy level E_i;

      Destination node D(p);

      Position of node p;

      Node identification id;

      List of nodes L{SN_i(id,  E,  P)};

LET_construct

{

 LET_initiate (L0, L1, L2)

 For (every t sec)

 {

  Energy_request (L{SN_i{id,  E,  p)})

  LET_update (L1,  L2);

 }

}

LET_initiate (L0,  L1,  L2)

{

 Add D(p) →  L0

 For i  =  1 to n

 {

  Add SN_i  → L1;

  Set E(SN_i) = E_i;

  Link SN_i  →  D(p);

 }

 Set L2  →  NULL;

}

LET_update (L0, L1, L2)

{

 for each node in L1

 {

 if(E(SNL1)  <  ET   % Sensor Nodes at Level 1

 then {

      X = Neighbor(SNL1);

      Link SNL1 → X;

      L1  ←  L1  −  SNL1;

      L2  ←  L2  +  SNL1;

      }

 }

}