Context-Based Adaptive Routing in Opportunistic Network
-
Graphical Abstract
-
Abstract
This paper proposes a novel routing algorithm for opportunistic networks: Context-based adaptive routing (CBAR) that uses network context information and Dempster-Shafer (D-S) evidence theory to calculate a node’s basic reliability assignment function, which describes the reliability of the node’s credibility, incredibility and unknown credibility. As message distributes, the context will determine whether the node is credible or not, then CBAR selects the node with higher value of reliability regarding to its credibility to forward the message, otherwise, floods the message so that better robustness and delivery probability can be achieved. We used Opportunistic network environment simulator (ONE) to simulate and compare the performance of CBAR algorithm with existing routing algorithms which shows that CBAR has better performance in terms of delivery ratio, average latency, and overhead ratio.
-
-