Enhanced OLSR routing for airborne networks with multi-beam directional antennas

Delay-Aware and Link-Quality-Aware Geographical Routing Protocol for UANET via Dueling Deep Q-Network

“…Furthermore, the included route energy and route lifetime into the topology control message. In [ 30 ], the authors used multibeam directional antenna (MBDA) technology to forward a packet in different directions without radio frequency interference, which ensured that OLSR had a low probability of detection. In addition, a multipath-enhanced OLSR based on MADA was proposed, and a social network concept was applied to select the multipoint relays with small broadcast overheads.…”

Energy Efficient Routing for Wireless Mesh Networks with Directional Antennas: When Q-learning meets Ant systems

“…In [32], the authors discuss a multipath enhanced OLSR Optimized link state routing (OLSR) exploiting the benefit of multi-beam directional antennas, and allowing simultaneous antennas delivery. The paper proposes a social networkinspired algorithm for Multi-Point relays (MPR) selection which chooses the nodes with higher connectivity level with other routing nodes as MPR to reach all nodes using a limited broadcast.…”

“…Paper objective and Resolution approach Antennas Optimized metrics OA DA Energy Throughput Capex [14], [15] ILOG Cplex to solve the joint optimization of the deployment cost and the energy consumption [16] Column generation algorithm to solve the capacity maximization and Energy minimization problems [11] GLPK to solve a joint optimization of the energy consumption and the end-to-end delay modeled as a MILP [9] A heuristic based on the Ant-Colony (AC) algorithm to solve the joint routing and scheduling optimization problem [10] An optimization framework is proposed for network design [17] Iterative Local Search (ILS) to maximize the packet delivery ratio and reduce the end to end delay [26] ILOG Cplex to maximize the minimum flow and to minimize the number of antenna directions or beams [27] Inspired by Ant Colony system, a topology control and routing assignment joint optimization problem (TORA) is proposed [29] Volcano: Multi-Pipe High-Throughput Routing Protocol with Hole Avoidance for Multi-Beam Directional Mesh Networks [28] Using the generalized Benders decomposition approach, a Channel Assignment, Link DAs algorithm proposed to solve a mixed integer nonlinear problem (MINLP) [33] The exact method branch-and-priceFair is used for flow rate optimization by effective placement of directional antennas in wireless mesh networks [19] Throughput and energy-aware routing for 802.11 based mesh networks by switching off as many APs as possible [18] Energy Savings in Wireless Mesh Networks in a Time-Variable Context problem is formulated and solved as a MILP [20] SpeeD-IoT, a multi-hop routing scheme allowing IoT device energy preservation and end to end rate optimization. [21] DEER, a protocol for wireless sensor networks improving average network lifetime [22] SEEK, a distributed cross layer optimized routing algorithm based on location available information [23] ATEER, a clustering cross layer routing protocol for wireless sensor networks proposing to group sensor nodes into clusters [24] Efficient primary and backup paths are built to counteract route failures for a source-destination pair [30] A new version of AODV is highlighted with Directional antennas with multiple network interface [31] A directional routing and scheduling algorithm to calculate sub-optimal link scheduling results and to reduce the end-to-end delay [32] A social network inspired algorithm for MPR selection [25] A demo based o...…”

Intelligent route discovery towards rushing attacks in ad hoc wireless networks

“…The ADABCP has two stages of route organization and route reorganization [36] [44] [45]. A partial solution with individual exploration and collective experience is generated in the pattern reorganization used in the pattern reorganization [44] [46]. During the step pattern reorganization, the probability information is used to decide if the current solution should still be explored in the next step or the newly selected area is to be started.…”