Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

Algorithm 3

The Farthest Node First-Bounded Hop Algorithm (FNF-BHA).

Input: A sensor network , hop cout

Output: Set of CL nodes ,

(1)   ;/set of nodes in the network/   ;

(2) while    is not empty  do

(3) Find the closest vertex to the BS position from ;

(4) Find an MST that covers vertices from ;

(5) ; set of nodes in partition tree Tp   ;

(6) while    is not empty  do

(7) Flag false   ; /no node need to remove from any tree   ;

(8) Find the farthest leave vertex to on ;

(9) Find the routing path ;

(10) if    then

(11) ;

(12) else

(13) vertex from at hops from ;

(14) set of nodes in not in ;

(15) if    is not empty  then

(16) Flag true   ;

(17) NRA; / call Node Removal Algorithm /

;

(18) if  Flag= false  then

(19) if    selected as    then

(20) index of tree rooted on ;

(21) ;

(22) else

(23) select as Collection Location   ;

(24) ;

(25)

(26) Find an MST ;

(27) ;

(28) ;

(29) [,]=Call LBA()   ;