An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

Algorithm 1

Recovery process when simultaneous node failure occurs. During recovery process simultaneous-node failure occurs.

Input: Identify simultaneous node failure

Output: Simultaneous node failure recovery

Begin

(1)  if (nodes, detects a simultaneous neighbour node, F ₁,F ₂, has failed)

(2)  update routing table

(3)  Check level of onboard energy supply

(4)  if (sufficient energy)

(5)     calculate the degree of overlapped coverage of both the failed nodes

(6)  if (failed F1 node distance is short)

(7)     send “Temporary Relocation” message to neighbours

(8)     send relocation message to current recovery coordinator

(9)     RelocateTemporarilyTo(F ₁failed node)

(10)    end if

(11) else if (distance is equal then relocate to less node id)

(12)   else if (Continue the running recovery process)

(13)  else if (node, A, receives “Temporary Relocation”)

(14)  Find new route

(15)  if (new route not found)

(16)     Buffer data

(17)  end if

(18)    else if (node, A, receives “Relocated Back”)

(19)       if (buffering data)

(20)        transmit data through A

(21)       end if

(22)   end if

(23)  end if

(24)  end if

END