Probabilistic routing protocol with firefly particle swarm optimisation for delay tolerant networks enhanced with chaos theory

作     者：Banyal, Siddhant Bhardwaj, Kartik Krishna Sharma, Deepak Kumar 

作者机构：Department of Instrumentation and Control Netaji Subhas University of Technology New Delhi India Netaji Subhas Institute of Technology India Department of Information Technology Netaji Subhas University of Technology New Delhi India 

出 版 物：《International Journal of Innovative Computing and Applications》 (Int. J. Innovative Comput. Appl.)

年 卷 期：2021年第12卷第2-3期

页      面：123-133页

核心收录：

学科分类：0710[理学-生物学] 0810[工学-信息与通信工程] 0711[理学-系统科学] 070207[理学-光学] 08[工学] 0835[工学-软件工程] 0714[理学-统计学（可授理学、经济学学位）] 0836[工学-生物工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 0702[理学-物理学] 

主　　题：Delay tolerant networks 

摘      要：In this paper, we propose a proactive routing paradigm for delay tolerant networks (DTN) using probabilistic routing implemented via firefly particle swarm optimisation and optimised by chaos maps. DTN is a specific class of networks where there is absence of an end to end connectivity among nodes and are characterised by long or variable delays, asymmetric data rates and high error rates. The routing scheme considers the constrained environment of DTN nodes and implements a meta-heuristic paradigm to facilitate data transfer. The chaos maps further enhance the probabilistic routing parameters controlling brightness and ageing by randomising them. The protocol is implemented on ONE simulator and its performance is compared with traditional DTN routing schemes across delivery probability, average latency, overhead ratio and buffer utilisation. The simulation results show that our proposed protocol performs better than its contemporary ant PRoPHET protocol across the various performance metrics. © 2021 Inderscience Enterprises Ltd.