Analysis of energy-tax for multipath routing in wireless sensor networks

Razzaque, Md. Abdur; Hong, Choong Seon

doi:10.1007/s12243-009-0110-5

Cited by 16 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Traditionally, multi-path routing has been in the context of WMNs. But recently, there has been progress in adapting these protocols to other types of networks such as WSNs (Wireless Sensor Networks) [24], [25], [26], [8].…”

Section: Motivation and Related Workmentioning

confidence: 99%

“…Inequalities (4), (5), (6), (7) guarantee that in every path from s 1 (or s 2 ) to t, the summation of all labels q u along this path will be at least 1. Inequalities (8) and (9) mean that if a node is labeled, then no flow should pass through it (if L 1 has integer solution, this can be guaranteed).…”

Section: A Multi-node Mcb Case In Wireless Networkmentioning

confidence: 99%

“…This makes WMNs ideal candidates for applying the full scope of any wireless multi-path protocols and study the impact of these attack scenarios. Though the underlying representative network model considered for this study is WMN, the attack scenarios and results in this paper are fully portable to other types of wireless data networks which use multipath routing protocols [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

“…// searches for the minimum length path // between the start and target vertices void minPath(int start, int target); void graph::Dijkstra(int source); int graph::randomPosition(int radioRange); int** graph::getMinDist(); double* graph::getReturnValue() ; int graph::greedy(); int graph::update(int node); int graph::checkGain(int node); int graph::greedy_singlePath(); int graph::update_singlePath(int node); int graph::checkGain_singlePath(int node); int graph::selectNode(int node); int graph::backupSelectNode(); int graph::resumeSelectNode(); int graph::genIncident(int fraction); int graph::perNode(); int graph::checkAll(); int graph::perNodeGreedy(); int graph::reset(); 14); f.addEdge(4, 5); f.addEdge(4, 6); f.addEdge(5, 7); f.addEdge(6, 13); f.addEdge (7,8); f.addEdge(7, 9); f.addEdge (8,11); f.addEdge(9, 10); f.addEdge (10,12); f.addEdge (10,15); f.addEdge (11,12); f.addEdge (13,14); f.addEdge (14,15) …”

mentioning

confidence: 99%

See 3 more Smart Citations

Minimum Cost Blocking Problem in Multi-Path Wireless Routing Protocols

Duan

Virendra

Upadhyaya

et al. 2014

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-We present a class of Minimum Cost Blocking (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 he is able to capture/isolate a subset of nodes such that no more than a certain amount of traffic from source nodes reaches the gateways. Two scenarios, viz. (a) low mobility for network nodes, and (b) high degree of node mobility, are evaluated. Scenario (a) is proven to be NP-hard and scenario (b) is proven to be #P-hard for the adversary to realize the goal. Further, several approximation algorithms are presented which show that even in the best case scenario it is at 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. To the best of our knowledge, this is the first work that theoretically evaluates the attack-resiliency and performance of multi-path protocols with network node mobility.

show abstract