Algorithm 1 CH_Rotations

1. Set ET 2. for each loop do 3.  for each n $∊(1,N)$ do 4.   Find E 5.    if (E ≤ ET) then 6.    Calcuate d 7.    Calcuate dA 8.    Calucate β 9.    Compute ω 10.    end if//line 5 11.   end for//line 2 12.  A new CH is selected based on the highest ω 13.  A new CH sends Adv-CH messages 14.  The N nodes send Join_Req to new CH 15. end for