New Multipath OLSR Protocol Version for Heterogeneous Ad Hoc Networks

被引:7
作者
Benjbara, Chaimae [1 ]
Habbani, Ahmed [1 ]
Mouchfiq, Nada [1 ]
机构
[1] Mohammed V Univ Rabat, Smart Syst Lab, Ecole Natl Super Informat & Anal Syst ENSIAS, Rabat 10106, Morocco
关键词
ad hoc; wireless communication; classification; colored Petri nets; heterogeneous; identification; multi-path; OLSR; protocol; IoT; ROUTING PROTOCOL; ALGORITHM;
D O I
10.3390/jsan11010003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
From a basic refrigerator to a self-driving car, emerging technologies are increasingly involving various facets of our daily lives. These bring together many regularly used devices, each with its own characteristics, to communicate and collaborate within the same system. Computer network experts regard this so-called structure as a heterogeneous network made up of several connected objects that do not speak the same language. Communication is therefore ensured by additional types of nodes, such as gateways or converters. In this case, we can detect an increased complexity and a decreased level of security. And thus, the need to adopt a common slang for these kinds of networks has been brought to life. In this work, we compare two different routing protocols: optimized link-state routing (OLSR) and the multipath heterogeneous ad hoc network OLSR (MHAR-OLSR). The latter is an OLSR extension with new functionalities: nodes identification, paths calculation, paths classification, and paths choice that we designed for heterogeneous ad hoc networks composed of MANET, VANET, and FANET devices; it ensures direct communication between these diverse components. We verify and explain all the elements of our solution using colored Petri nets. We also present a global evaluation of Packet Delivery Ratio (PDR), End-To-End Delay, and energy consumption as QoS measures with different numbers of nodes in a heterogeneous scenario. To do this, we use NS-3 and BonnMotion as a tool-set of simulation. Experimental results show improvement in performance when compared to the classical routing protocol.
引用
收藏
页数:22
相关论文
共 45 条
[1]  
Akkari Sallum EduardoEl., 2018, 2018 16th international conference on intelligent transportation systems telecommunications (ITST), P1, DOI DOI 10.1109/ITST.2018.8566825
[2]   A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices [J].
Barbehenn, M .
IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (02) :263-263
[3]  
Benjbara C., 2019, MA Patent, Patent No. [42342 IPC H04W 4/00, 0042342044]
[4]   Multi-path routing protocol in the Smart Digital Environment [J].
Benjbara, Chaimae ;
Habbani, Ahmed ;
El Mandi, Fatna ;
Essaid, Bilal .
2017 INTERNATIONAL CONFERENCE ON SMART DIGITAL ENVIRONMENT (ICSDE'17), 2017, :14-18
[5]  
Clausen T., 2003, Rfc3626: Optimized link state routing protocol (olsr)
[6]  
Clausen T., 2010, P 2010 IEEE INT C WI, DOI [10.17487/RFC7181, DOI 10.17487/RFC7181]
[7]   Balancing Interference and Delay in Heterogeneous Ad Hoc Networks With MIMO [J].
Cui, Haixia ;
Feng, Wanmei ;
Wang, Yide ;
He, Yejun .
IEEE ACCESS, 2017, 5 :19225-19232
[8]   Adaptive and intelligent energy efficient routing for transparent heterogeneous ad-hoc network by fusion of game theory and linear programming [J].
Das, Santosh Kumar ;
Tripathi, Sachin .
APPLIED INTELLIGENCE, 2018, 48 (07) :1825-1845
[9]  
Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[10]  
Fendji J.L.E.K., 2019, INT J WIREL MOB NETW, DOI DOI 10.5121/IJWMN.2019.11102