An Efficient Asynchronous Recovery Algorithm In Wireless Mobile Ad Hoc Networks

Abstract

The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile hosts capable of communication with each other without the assistance of base stations. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. In this paper, we study a fundamental problem, the crash recovery problem, in a MANET environment and propose an efficient rollback algorithm in which the failed MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. The MANET structure using in our algorithm is a hierarchical model in which the mobile host can construct a stable communication path with fever flooding messages and smaller number of hop count. In the model, the MANET is geographically partitioned into several disjoint and equal-sized cluster regions. Each cluster is assigned a unique cluster-id and has only one manager which is the one can directly communicate with the adjacent managers. For the recovery algorithm, each manager must keep an ntotal_h* ncluster_h dependency matrix, where O(ntotal_h) is the total number of MHs in the system and ncluster_h is the total number of MHs in its cluster.