QoS-PAR: a routing protocol for wireless ad hoc networks using a cross-layer autonomic architecture

Author(s):  
Wafa Berrayana ◽  
Habib Youssef ◽  
Rami Langar ◽  
Guy Pujolle
Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 449
Author(s):  
Sifat Rezwan ◽  
Wooyeol Choi

Flying ad-hoc networks (FANET) are one of the most important branches of wireless ad-hoc networks, consisting of multiple unmanned air vehicles (UAVs) performing assigned tasks and communicating with each other. Nowadays FANETs are being used for commercial and civilian applications such as handling traffic congestion, remote data collection, remote sensing, network relaying, and delivering products. However, there are some major challenges, such as adaptive routing protocols, flight trajectory selection, energy limitations, charging, and autonomous deployment that need to be addressed in FANETs. Several researchers have been working for the last few years to resolve these problems. The main obstacles are the high mobility and unpredictable changes in the topology of FANETs. Hence, many researchers have introduced reinforcement learning (RL) algorithms in FANETs to overcome these shortcomings. In this study, we comprehensively surveyed and qualitatively compared the applications of RL in different scenarios of FANETs such as routing protocol, flight trajectory selection, relaying, and charging. We also discuss open research issues that can provide researchers with clear and direct insights for further research.


2008 ◽  
Author(s):  
Marco Carvalho ◽  
Robert Winkler ◽  
Carlos Perez ◽  
Jesse Kovach ◽  
Steve Choy

2013 ◽  
Vol 9 (3) ◽  
pp. 170 ◽  
Author(s):  
Nyoman Gunantara ◽  
Gamantyo Hendrantoro

This paper focuses in the selection of an optimal path pair for cooperative diversity based on cross-layer optimization in multihop wireless ad hoc networks. Cross-layer performance indicators, including power consumption, signal-to-noise ratio, and load variance are optimized using multi-objective optimization (MOO) with Pareto method. Consequently, optimization can be performed simultaneously to obtain a compromise among three resources over all possible path pairs. The Pareto method is further compared to the scalarization method in achieving fairness to each resource. We examine the statistics of power consumption, SNR, and load variance for both methods through simulations. In addition, the complexity of the optimization of both methods is evaluated based on the required computing time.


Sign in / Sign up

Export Citation Format

Share Document