Abstract- Mobile Ad hoc Networks provide flexibility and scalability which was not taken into consideration by the existing distributed systems. These networks are distributed networks and do not require any existing infrastructure. But in these types of networks there occurs some problems among which one may be occurring of fault. This may occur due to link failure, failure of nodes or network. We illustrate the solution for maintaining link connectivity even if the links to be used fails. A modified fault tolerance global spanning subgraph algorithm is determined which proves k-connectivity. This algorithm helps to form the minimum spanning tree considering the probability distribution function as edge weights in case the minimum weight edge to be added fails. This paper illustrates the way to toleratefault using modified global spanning subgraph algorithm and tested the performance of the proposed algorithm using NS-2 simulation. Index Terms-Mobile Ad hoc Networks; Fault tolerance; K-connectivity; minimum spanning tree. 1.
Discussion(0)
No comments yet. Be the first to comment.