Evaluation of Opportunistic Contact Graph Routing in Random Mobility Environments

• Published in: 2018 6th IEEE International Conference on Wireless for Space and Extreme Environments (WiSEE) pp. 183 - 188
• Main Authors: Net, Marc Sanchez, Burleigh, Scott
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2018
• Subjects: Ad hoc networks; Benchmark testing; delay tolerant networks; History; opportunistic routing; Peer-to-peer computing; Routing; Routing protocols; Space vehicles
• ISSN: 2380-7636
• DOI: 10.1109/WiSEE.2018.8637316

Routing in networks where nodes move randomly is particularly challenging due their potentially unpredictable, and rapidly changing topology. Several routing algorithms have been presented in the literature to address the needs of such networks, most of them implementing variants of controlled network flooding in the hope of successful data delivery.In this note, we compare the results of previous routing algorithms with Opportunistic Contact Graph Routing (OCGR), an enhanced version of Contact Graph Routing (CGR) that is suitable for networks where contacts cannot always be scheduled ahead of time. To perform the benchmark, we simulate a network of nodes moving in a certain space according to the Random Waypoint Mobility Model, and then take measurements of bundle delivery probabilty and overhead ratio as metrics of performance and cost respectively. Through this exercise, we demonstrate that the performance of OCGR is highly dependent on the type of network under consideration (e.g. very sparse vs. densely connected) and the assumed mobility model.