Distributed verification of global multiple disjoint paths in mobile wireless networks

We present a distributed verification algorithm to check the existence of multiple disjoint paths between all nodes in a wireless network. In contrast to the expensive algorithms computing full disjoint paths between nodes, our proposed algorithm distributes the computation across the network and makes statements regarding the interconnectedness of the entire network. Specifically, it allows each node to determine whether segmentation exists between its neighbors and thereby determine if it bottlenecks the network. Verification of disjoint paths would be useful for efficient use of resources and for the applications having intelligent nodes to self-configure the network for better survivability.