Connectivity Restoration in Partitioned Wireless Sensor Networks based on Coverage Importance using Round Table Decision

This paper addresses the problem of connectivity restoration taking into account the importance of the covered area where the nodes have been destroyed. A distributed and autonomous approach of reconnecting disjoint clusters while moving surviving nodes to nodes in higher priority areas is proposed. In this approach, which builds upon the round table (RT) approach in the literature, each cluster identifies itself and chooses a negotiator which travels to negotiate with negotiators of other clusters, by exchanging information and deciding on reconnection paths. In contrast to the original RT approach, this approach also considers the replacements for lost important nodes. On return of negotiators to the respective clusters, the recovery and reconnection process is carried out. This process is implemented in three ways: reconnection only (which is the original round table approach), recover and reconnect, and finally, reconnect and recover. Simulation on a network and performance of the approaches is presented.