scholarly journals A Genetic-Algorithm-Based Optimization Routing for FANETs

2021 ◽  
Vol 15 ◽  
Author(s):  
Xing Wei ◽  
Hua Yang ◽  
Wentao Huang
Keyword(s):  
Genetic Algorithm ◽  
Routing Protocol ◽  
High Mobility ◽  
Destination Node ◽  
Improved Genetic Algorithm ◽  
On Demand ◽  
Link Stability ◽  
Variation Operators ◽  
The Stability ◽  
Route Search

In view of the characteristics of high mobility of FANETs nodes, combined with the features of Topology-based class routing protocol on-demand search, a Genetic-algorithm-based routing (GAR) protocol is proposed for FANETs which based on improved genetic algorithm for FANETs route search, and it taking into account the link stability, link bandwidth, node energy, and other factors. GAR improves the selection, crossover, and variation operators of the genetic algorithm so that GAR can finally plan an optimized route from the communication initiating node to the destination node quickly using a smaller cost. The experimental results show that GAR can largely improve the throughput, reduce the delay and improve the stability of the network, which is more suitable for FANETs.

The Study of Optimal Fuzzy PID-Smith Control Based on Genetic Algorithm

2013 ◽  
Vol 313-314 ◽  
pp. 448-452
Author(s):  
Dian Ting Liu ◽  
Hai Xia Li
Keyword(s):  
Genetic Algorithm ◽  
Simulation Model ◽  
Control Method ◽  
Order System ◽  
Membership Functions ◽  
Fuzzy Pid ◽  
Improved Genetic Algorithm ◽  
Simulation Results ◽  
The Stability ◽  
Better Than

In this paper, the improved genetic algorithm is applied to optimize the quantization factors and the scaling factors of fuzzy control, and the optimized rule table and membership functions is obtained according to certain performances. Then a kind of optimal fuzzy PID-Smith control method based on genetic algorithm is proposed and its simulation model is built in this paper, a second-order system is simulated and analyzed. The results show that requirements of deterministic performances of the new control method are better than the conventional methods through the simulation results in the stability, rapidity and robustness.

scholarly journals Comparative Performance Evaluation of On-Demand Multicast Routing Protocols for MANET

2018 ◽  
Vol 7 (S1) ◽  
pp. 123-129
Author(s):  
K. Kavitha
Keyword(s):  
Routing Protocol ◽  
Multicast Routing ◽  
High Mobility ◽  
On Demand ◽  
Control Overhead ◽  
End To End Delay ◽  
Multicast Routing Protocol ◽  
Membership Management ◽  
End To End ◽  
And Control

A Mobile Ad hoc NETwork (MANET) is a collection of wireless nodes communicating with each other in the absence of any infrastructure. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route traffic. Such networks may operate by themselves or may be connected to the larger Internet. In this paper, we compare the performance of On-Demand Multicast Routing Protocol (ODMRP), Adaptive demand driven Multicast Routing Protocol (ADMR) With Efficient Geographic Multicast Routing Protocol (EGMP) under different mobility models such as Random Way Point Model, Manhattan Model and Random Drunken Model. Using these models, performance metrics such as Packet Delivery Ratio, End-to-End Delay and Control Overhead are evaluated. ODMRP dynamically builds the route and manages the group membership. In ADMR, Multicast routing state is dynamically established and maintained only for active groups and only in nodes located between multicast senders and receivers. ADMR detects the high mobility without the use of GPS or other positioning system. EGMP supports a zone-based scheme to efficiently handle the two-tier membership management, and takes advantage of the membership management structure to efficiently track the locations of all the group members. The simulation result shows that the throughput of ADMR is higher than that of ODMRP and EGMP at high mobility and EGMP is high at low mobility. End to end delay and control overhead of EGMP is higher than that of ODMRP and ADMR.

Shape and Cross-Section Optimization of Spatial Grid Structures Using Genetic Algorithm

2012 ◽  
Vol 479-481 ◽  
pp. 1463-1467
Author(s):  
Jian Chun Xiao ◽  
Jing Chen ◽  
Qi Li ◽  
Shao Quan Xia
Keyword(s):  
Genetic Algorithm ◽  
Cross Section ◽  
Physical Property ◽  
Structural Deformation ◽  
Improved Genetic Algorithm ◽  
Integer Variables ◽  
Optimization Function ◽  
Spatial Grid ◽  
The Stability ◽  
Mixed Codes

The optimization of the structures is difficult because the variables have different physical property or different quantitative attribute. The shape and cross-section optimization of spatial grid structures is performed by an improved genetic algorithm. The constraint conditions are composed of the structural deformation, the stability of the compressive members, the slender ratios, and etc. The treatment of the constraint conditions and the optimization function gives an unconstrained analytic function by adopting Lagrange multipliers. The method enhances the running efficiency of the genetic algorithm. The programme for structural optimization containing the mixed codes of continuous real variables, discontinuous real variables, and integer variables is coded by using MATLAB Toolbox functions for genetic algorithm. The analysis of examples shows that the programme is reliable, and the convergence of the algorithm is fast as well.

SBADR: stable and bandwidth aware dynamic routing protocol for mobile ad hoc network

2020 ◽  
Vol 16 (3) ◽  
pp. 205-221
Author(s):  
Anupama Sharma ◽  
Abhay Bansal ◽  
Vinay Rishiwal
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
High Mobility ◽  
Dynamic Routing ◽  
Network Simulator ◽  
High Quality ◽  
Content Type ◽  
Path Stability ◽  
The Stability

Purpose Quality communication is a big challenge in mobile ad hoc networks because of a restricted environment for mobile devices, bandwidth-constrained radio connections, random mobility of connected devices, etc. High-quality communication through wireless links mainly depends on available bandwidth, link stability, energy of nodes, etc. Many researchers proposed stability and link quality methods to improve these issues, but they still require optimization. This study aims to contribute towards better quality communication in temporarily formed networks. The authors propose the stable and bandwidth aware dynamic routing (SBADR) protocol with the aim to provide an efficient, stable path with sufficient bandwidth and enough energy hold nodes for all types of quality of service (QoS) data communication. Design/methodology/approach The proposal made in this work used received signal strength from the media access control (MAC) layer to estimate the stability of the radio connection. The proposed path stability model combines the stability of the individual link to compute path stability. The amount of bandwidth available for communication at a specific time on a link is defined as the available link bandwidth that is understood as the maximum throughput of that link. Bandwidth as a QoS parameter ensures high-quality communication for every application in such a network. One other improvement, towards quality data transmission, is made by incorporating residual energies of communicating and receiving nodes in the calculation of available link bandwidth. Findings Communication quality in mobile ad hoc network (MANET) does not depend on a single parameter such as bandwidth, energy, path stability, etc. To address and enhance quality communication, this paper focused on high impact factors, such as path stability, available link bandwidth and energy of nodes. The performance of SBADR is evaluated on the network simulator and compared with that of other routing protocols, i.e. route stability based QoS routing (RSQR), route stability based ad-hoc on-demand distance vector (RSAODV) and Ad-hoc on-demand distance vector (AODV). Experimental outcomes show that SBADR significantly enhanced network performance in terms of throughput, packet delivery ratio (PDR) and normalized control overhead (NCO). Performance shows that SBADR is suitable for any application of MANET having random and high mobility. Research limitations/implications QoS in MANET is a challenging task. To achieve high-quality communication, the authors worked on multiple network parameters, i.e. path stability, available link bandwidth and energy of mobile nodes. The performance of the proposed routing protocol named SBADR is evaluated by a network simulator and compared with that of other routing protocols. Statistical analysis done on results proves significant enhancement in network performance. SBADR is suitable for applications of MANET having random and high mobility. It is also efficient for applications having a requirement of high throughput. Practical implications SBADR shows a significant enhancement in received data bytes, which are 1,709, 788 and 326 more in comparison of AODV, RSAODV and RSQR, respectively. PDR increased by 21.27%, 12.1%, 4.15%, and NCO decreased by 9.67%, 5.93%, 2.8% in comparison of AODV, RSAODV and RSQR, respectively. Social implications Outcomes show SBADR will perform better with applications of MANET such as disaster recovery, city tours, university or hospital networks, etc. SBADR is suitable for every application of MANET having random and high mobility. Originality/value This is to certify that the reported work in the paper entitled “SBADR: stable and bandwidth aware dynamic routing protocol for mobile ad hoc network” is an original one and has not been submitted for publication elsewhere. The authors further certify that proper citations to the previously reported work have been given and no data/tables/figures have been quoted verbatim from the other publications without giving due acknowledgment and without permission of the author(s).

A Study of Speed Aware Routing for Mobile Ad Hoc Networks

2013 ◽  
pp. 190-212
Author(s):  
Kirthana Akunuri ◽  
Ritesh Arora ◽  
Ivan G. Guardiola
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
High Mobility ◽  
Node Mobility ◽  
On Demand ◽  
Expiration Time ◽  
Mobile Ad Hoc ◽  
Demand Routing ◽  
Hoc Networks

The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network (MANET) routing. This research proposes a novel on-demand routing protocol, Speed-Aware Routing Protocol (SARP) to mitigate the effects of high node mobility by reducing the frequency of route disconnections in a MANET. SARP identifies a highly mobile node which forms an unstable link by predicting the link expiration time (LET) for a transmitter and receiver pair. NS2 was used to implement the SARP with ad hoc on-demand vector (AODV) as the underlying routing algorithm. Extensive simulations were then conducted using Random Waypoint Mobility model to analyze the performance of SARP. The results from these simulations demonstrated that SARP reduced the overall control traffic of the underlying protocol AODV significantly in situations of high mobility and dense networks; in addition, it showed only a marginal difference as compared to AODV, in all aspects of quality-of-service (QOS) in situations of low mobility and sparse networks.

An Improved Genetic Algorithm Based Annulus-sector Clustering Routing Protocol for Wireless Sensor Networks

2021 ◽  
Author(s):  
Wang Chu-hang ◽  
Liu Xiao-li ◽  
Youjia Han ◽  
Hu Huang-shui ◽  
Wu Sha-sha
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Fitness Function ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Optimal Routing ◽  
Improved Genetic Algorithm

Abstract In wireless sensor networks, uniform cluster formation and optimal routing paths finding are always the two most important factors for clustering routing protocols to minimize the network energy consumption and balance the network load. In this paper, an improved genetic algorithm based annulus-sector clustering routing protocol called GACRP is proposed. In GACRP, the circular network is divided into sectors with the same size for each annulus, whose number is determined by calculating the minimum energy consumption of each annulus. Each annulus-sector forms a cluster and the best node in this annulus-sector is selected as cluster head. Moreover, an improved genetic algorithm with a novel fitness function considering energy and load balance is presented to find the optimal routing path for each CH, and an adaptive round time is calculated for maintaining the clusters. Simulation results show that GACRP can significantly improve the network energy efficiency and prolong the network lifetime as well as mitigate the hot spot problem.

Sign in / Sign up

Export Citation Format

Share Document