An Algorithm for Mobile Ad-hoc Networks to Reducing Cut Vertices?

A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a ―cut‖. In this article we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. In this paper, we propose an efficient algorithm to detect vertices. The neighbor node gets failure intimation from the cut vertex so that the information can be passed to source and destination so that the source can initiate data transmission through alternate path before the cut vertices get breakdown completely. In this way, data loss can be minimized and the cut can be detected truly. The algorithm is distributed and asynchronous so that every node needs to communicate with only those nodes that are within their communication range. The most important advantage is that this method can be used to reduce the time delay needed in detecting cut. The algorithm is distributed and asynchronous: every node needs to communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious ―electrical potential‖ of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network. We demonstrate the effectiveness of the proposed algorithm through simulations and a real hardware implementation.