A comparative performance evaluation of routing protocols for flying ad-hoc networks in real conditions

Unmanned aerial vehicles (UAVs) are widely used in our modern society and their development is rapidly accelerating. Flying Ad Hoc Networks (FANETs) have opened a new window of opportunity to create new value-added services. However, the characteristics that make FANETs unique, such as node mobility, node distance, energy constraints, etc., imply that several guidelines need to be considered for their successful deployment. Although numerous routing protocols have been proposed for FANETs, due to the wide range of applications in which FANETs can be applied, not all routing protocols can be used. Due to this challenge, after breaking down and classifying the different types of existing routing protocols for FANET, this paper analyzes and compares the performance of several routing protocols (Babel, BATMAN-ADV, and OLSR) in terms of throughput and packet loss in a real deployment composed of several UAV nodes using 2.4 and 5 GHz WiFi networks. The results show that Babel achieves better performance in the studied metrics than OLSR and BATMAN-ADV, while BATMAN-ADV delivers significantly lower performance. This experimental study confirms the importance of choosing the proper routing protocol for FANETs and their performance evaluation, something that will be extremely important in a few years when this type of network will be common in our day-to-day life.This research was funded by the AEI/FEDER, UE project grant TEC2016-76465-C2-1-R (AIM), project SPID202000X116746SV0 (AriSe2: FINe), and 20740/FPI/18. Fundación Séneca. Región de Murcia (Spain)

Routing schemes in FANETs: a survey

Flying ad hoc network (FANET) is a self-organizing wireless network that enables inexpensive, flexible, and easy-to-deploy flying nodes, such as unmanned aerial vehicles (UAVs), to communicate among themselves in the absence of fixed network infrastructure. FANET is one of the emerging networks that has an extensive range of next-generation applications. Hence, FANET plays a significant role in achieving application-based goals. Routing enables the flying nodes to collaborate and coordinate among themselves and to establish routes to radio access infrastructure, particularly FANET base station (BS). With a longer route lifetime, the effects of link disconnections and network partitions reduce. Routing must cater to two main characteristics of FANETs that reduce the route lifetime. Firstly, the collaboration nature requires the flying nodes to exchange messages and to coordinate among themselves, causing high energy consumption. Secondly, the mobility pattern of the flying nodes is highly dynamic in a three-dimensional space and they may be spaced far apart, causing link disconnection. In this paper, we present a comprehensive survey of the limited research work of routing schemes in FANETs. Different aspects, including objectives, challenges, routing metrics, characteristics, and performance measures, are covered. Furthermore, we present open issues

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

Power-aware Intelligent Water Drops Routing Algorithm for Best Path Selection in MANETs

The absence of a central framework, the constantly fluctuating layout, the restricted resources, and the dispersed structure of Mobile Ad hoc Networks (MANETs), among other characteristics, make routing a critical problem. A proficient, energy-aware routing path selection algorithm can improve network performance. In this paper, a routing mechanism for path selection called the Power-aware Intelligent Water Drops Routing Algorithm (PIWDRA) is proposed, which is based on a physics-water metaheuristic called Intelligent Water Drops (IWD). In the algorithm, the global best path is selected based on a cost function that takes into consideration minimum energy, hop count, and time delay. Minimum energy has the highest weight factor. The link cost, Heuristic Undesirability (HUD), local update of the soil of a link and the soil of a drop, as well as the update of the soil of the paths that generated the local best path, incorporate one or more factors, which include time delay, energy, and the number of hops. Results obtained after simulating in Network Simulator 3 (NS-3) under variations in pause times and number of active sources show that the PIWDRA outperforms the Intelligent Water Drops Routing Algorithm (IWDRA), the Intelligent Water Drops-Based Optimization Algorithm for Mobile Ad-hoc Networks (IWDHocNet), the Ad-hoc On-Demand Distance Vector (AODV) routing protocol, and the Destination Sequence Distance Vector (DSDV) routing protocol. The performance metrics involved packet delivery ratio, average end-to-end delay, energy consumption, and network lifetime. In future work, the algorithm can be enhanced with congestion techniques such as cross-layer design, queue management, and rate control. Also, a hybrid metaheuristic routing algorithm can be the focus of future work

A Theoretical Review of Topological Organization for Wireless Sensor Network

The recent decades have seen the growth in the fields of wireless communication technologies, which has made it possible to produce components with a rational cost of a few cubic millimeters of volume, called sensors. The collaboration of many of these wireless sensors with a basic base station gives birth to a network of wireless sensors. The latter faces numerous problems related to application requirements and the inadequate abilities of sensor nodes, particularly in terms of energy. In order to integrate the different models describing the characteristics of the nodes of a WSN, this paper presents the topological organization strategies to structure its communication. For large networks, partitioning into sub-networks (clusters) is a technique used to reduce consumption, improve network stability and facilitate scalability

Novel Online Sequential Learning-Based Adaptive Routing for Edge Software-Defined Vehicular Networks

To provide efficient networking services at the edge of Internet-of-Vehicles (IoV), Software-Defined Vehicular Network (SDVN) has been a promising technology to enable intelligent data exchange without giving additional duties to the resource constrained vehicles. Compared with conventional centralized SDVNs, hybrid SDVNs combine the centralized control of SDVNs and self-organized distributed routing of Vehicular Ad-hoc NETworks (VANETs) to mitigate the burden on the central controller caused by the frequent uplink and downlink transmissions. Although a wide variety of routing protocols have been developed, existing protocols are designed for specific scenarios without considering flexibility and adaptivity in dynamic vehicular networks. To address this problem, we propose an efficient online sequential learning-based adaptive routing scheme, namely, Penicillium reproduction-based Online Learning Adaptive Routing scheme (POLAR) for hybrid SDVNs. By utilizing the computational power of edge servers, this scheme can dynamically select a routing strategy for a specific traffic scenario by learning the pattern from network traffic. Firstly, this paper applies Geohash to divide the large geographical area into multiple grids, which facilitates the collection and processing of real-time traffic data for regional management in controller

A Theoretical Review of Topological Organization for Wireless Sensor Network

The recent decades have seen the growth in the fields of wireless communication technologies, which has made it possible to produce components with a rational cost of a few cubic millimeters of volume, called sensors. The collaboration of many of these wireless sensors with a basic base station gives birth to a network of wireless sensors. The latter faces numerous problems related to application requirements and the inadequate abilities of sensor nodes, particularly in terms of energy. In order to integrate the different models describing the characteristics of the nodes of a WSN, this paper presents the topological organization strategies to structure its communication. For large networks, partitioning into sub-networks (clusters) is a technique used to reduce consumption, improve network stability and facilitate scalability

Actas da 10ª Conferência sobre Redes de Computadores

Universidade do MinhoCCTCCentro AlgoritmiCisco SystemsIEEE Portugal Sectio