A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
2009 7th International Workshop on Design of Reliable Communication Networks
In order to effectively deploy survivability techniques to improve the resilience of mobile ad hoc networks, one must be able to identify all the weak points of the network topology. The weak or critical points of the topology are those links and nodes whose failure results in partitioning of the network. Here we propose a new algorithm based on results from algebraic graph theory, that can find the critical points in the network for single and multiple failure cases. Utilizing this algorithmdoi:10.1109/drcn.2009.5340008 fatcat:t54tqkqjefc4vc5ydes4bxtjzi