K-fault tolerant in Mobile Adhoc network under cost constraint
Sugandha Singh, Navin Rajpal, Ashok Kale Sharma · 2011
A network topology is K-FT topology if it can endure K number of link failures, however to find a reliable hardware topology for a set of nodes keeping the total cost of the links within a predefined budget, is a challenging task, especially when the topology is subjective to constraints that the topological network can tolerate K link failures keeping total cost of network within budget. This problem has been addressed in this paper where in a novel algorithm is proposed that uses N × N matrix to represent the cost between the participating nodes, and uses K-FT topology to tackle the fault tolerant problem of Mobile Adhoc Networks. Intention is to achieve optimal resource utilization and fairness among competing end to end flows. A network topology is said to be K-FT if and only if every pair of node is reachable from all other nodes for K link failures. The algorithm has been tested for wide range of node sets and the result obtained there of suggest that the proposed algorithm finds better solutions in comparison to Genetic Algorithm.