Least Distance Movement Recovery approach for large scale Wireless sensor and actor networks
Abdullah Alfadhly, Uthman A. Baroudi, Mohamed Younis · 2011
In most applications of Wireless sensor and actor network it is important to sustain connectivity among all actors at all times. When an actor fails the inter-actor topology may get partitions into disjoint blocks and the application may be negatively impacted. Tolerating the actor failure and restoring the lost connectivity need to be performed while imposing the least overhead on the individual actors. In this paper a Least Distance Movement Recovery (LDMR) algorithm is proposed. LDMR is a distributed approach that exploits non cut-vertices actors in the recovery process. The idea is for a set of direct neighbours of the failed node to move toward the position of the failed node while its original position is replaced with the nearest non cut-vertex actor. The recovery process starts with the search phase where each neighbour broadcasts a message containing the failed node ID, neighbour node ID and, Time-To-Live (TTL). When a neighbour receives responses, it chooses the best candidate based on a certain criteria (e.g. distance). We compare our approach with Recovery through Inward Motion (RIM) which depends only on cascaded movements. Extensive simulation experiments are carried out to validate the performance.