Computing Reviews

Modeling and performance evaluation of security attacks on opportunistic routing protocols for multihop wireless networks
Salehi M., Boukerche A., Darehshoorzadeh A. Ad Hoc Networks5088-101,2016.Type:Article
Date Reviewed: 11/16/16

The primary aim of opportunistic routing for wireless networks is to improve resilience and increase the probability that data will be delivered from the source node through to the intended destination. The key difference with standard wireless routing protocols is that multiple geographically adjacent nodes can form the candidate set of nodes to forward the packet on. Much of the research in this area is dedicated to either the candidate selection algorithm or to the coordination mechanism between the candidate nodes.

However, in this paper, the authors look at how existing algorithms behave in the presence of malicious nodes. These nodes not only do not forward the packet, but they also notify the sender and fellow candidates that the packet was indeed sent on, and hence nullify both the retransmission mechanism and the resilience afforded by having a candidate set of more than one node.

The model builds on prior work modeling opportunistic routing using discrete-time Markov chains (DTMC) where network performance characteristics such as drop ratio, delivery ratio, expected number of transmissions, and hop count can be computed using the DTMC. By introducing the malicious node as an absorbing state in the Markov chain, the authors can treat the malicious node similarly to the success or failure states in the DTMC.

The authors then evaluate the performance of four popular opportunistic routing algorithms in the presence of these malicious nodes, creating the so-called “black-hole” attack, using the developed model. Algorithm performance is evaluated for independent changes in each of the number of malicious nodes; node density; and the number of candidates in a candidate set. Comparison results against simulation tests are also provided.

Reviewer:  Bernard Kuc Review #: CR144926 (1702-0132)

Reproduction in whole or in part without permission is prohibited.   Copyright 2024 ComputingReviews.com™
Terms of Use
| Privacy Policy