MCB Problem in Routing Protocols

We present a class of MCB problems in Wireless Mesh Networks (WMNs) with multi-path wireless routing protocols. We establish the provable superiority of multi-path routing protocols over conventional protocols against blocking, node-isolation and network-partitioning type attacks. In our attack model, an adversary is considered successful if it is able to isolate/capture of a subset of nodes such that no more than a certain amount of traffic from source nodes reaches the gateways. In that Two scenarios, (a) nodes high degree of node mobility, are evaluated. Scenario, and (b) low mobility for network nodes. Scenario (a) is proven to be #P-hard for the adversary (b) is proven to be NP-hard and scenario to realize the goal. Several approximation algorithms are presented which show that in the best case scenario and it is least exponentially hard for the adversary to optimally succeed in such blocking-type attacks. These results are verified through simulations, which demonstrate the robustness of multi-path routing protocols against such attacks. The best of our knowledge, it is the first work that evaluates theoretically and the attack-resiliency and performance of multi- path protocols with wire-less network node mobility.