Enhanced Flooding-Based Routing Protocol for Swarm UAV Networks: Random Network Coding Meets Clustering

Unmanned aerial vehicle is one of the main announced use cases of 5G/IMT2020, which is expected to have various applications in many fields. These devices have limited capabilities in terms of energy and processing. Due to the complex structure of unmanned aerial vehicle networks and the high mobility constraints, design of efficient routing protocol, for supporting such network, is a challenge. Thus, efficient routing of data among unmanned aerial vehicles between source and destination is an important issue in designing unmanned aerial vehicle networks. Proactive routing protocols are one of the main categories of routing protocols developed for mobile ad hoc networks and vehicular ad hoc networks. Optimized link state routing protocol is one of the most common proactive routing protocols that has been modified to support unmanned aerial vehicle networks, considering high mobility feature of the network. In this work, we propose a latency and energy-efficient proactive routing protocol for dense unmanned aerial vehicle networks, with high-density devices, based on optimized link state routing protocol algorithm, referred to as multi-objective optimized link state routing protocol. The proposed routing protocol is topology aware and can be used for low-latency and high-mobility applications. The proposed multi-objective optimized link state routing protocol routing algorithm considers all modified versions of optimized link state routing protocol and introduces a novel method for selecting multipoint relay nodes that considers the traffic load on the communication channel and the load on each unmanned aerial vehicle node. Moreover, the proposed algorithm considers the communication link stability and the energy constraints. The system is simulated over a reliable environment for various scenarios, and it is compared to the original optimized link state routing protocol and its modified versions. Simulation results indicate that the proposed protocol achieves higher efficiency in terms of latency, energy, and reliability.

네트워크 중심전의 실현을 위해 여러 체계들이 개발되고 있다. 그중에서 무인 항공기 체계는 군사적인 응용에서 가장 주목을 받고 있다. 일반적으로 무인 항공기들은 임의로 애드혹 네트워크를 형성할 수 있을 뿐만 아니라 소스 노드와 목적지 노드사이의 홉수도 많이 줄일 수 있다. 하지만 무인 항공기 네트워크 환경은 높은 이동성, 높은 데이터 전송률, 실시간 서비스를 제공해야 하는 특성이 있다. 이러한 무인 항공기 네트워크의 요구사항에 동적으로 적응할 수 있는 멀티홉 라우팅 프로토콜의 설계가 요구되고 있다. 본 논문에서는 소스 노드와 목적지 노드 사이의 제일 짧은 지리적 거리를 사용하여 효율적이고 신뢰적인 전송을 하는 Geographic Routing Protocol의 성능을 분석한다. Geographic Routing Protocol은 비디오 서비스를 제공하는 시나리오에서 TDMA 모델을 사용하여 시뮬레이션을 수행하여 평가하였다. 시뮬레이션 결과 Geographic Routing Protocol은 기존의 MANET 라우팅 프로토콜보다 패킷 수신율, 종단간 지연, 라우팅 트래픽 발생량 등 면에서 더 좋은 성능을 보였다. Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

Due to the high mobility and dynamic topology of the FANET network, maintaining communication links between UAVs is a challenging task. The topology of these networks is more dynamic than traditional mobile networks, which raises challenges for the routing protocol. The existing routing protocols for these networks partly fail to detect network topology changes. Few methods have recently been proposed to overcome this problem due to the rapid changes of network topology. We try to solve this problem by designing a new dynamic routing method for a group of UAVs using Hybrid SDN technology (SDN and a distributed routing protocol) with a highly dynamic topology. Comparison of the proposed method performance and two other algorithms is simulated. The simulation results show that the proposed method has better results than traditional algorithms in the package delivery ratio, average end to end delay, packet loss, throughput and normalized routing Load.

A mobile ad hoc network is a collection of wireless nodes without any existing network infrastructure or centralized administration. It applies some special routing protocols, e.g. Ad hoc On-demand Distance Vector (AODV) routing protocol, having the ability to forward the packets in dynamic network topology. The existing routing protocols can be divided into unsecure and secure protocols. They could not address all possible attacks aiming the disruption of the protocol itself.

The multicast routing protocols used in wire network, such as distance vector multicast routing protocol(DVMRP), multicast open shortest path first(MOSPF), core based tree(CBT), do not run very well in ad hoc network because the dynamic net topology may destroy the distribution tree. Besides, distribution tree usually needs global routing structure. Which produces extra processing cost because the dynamic topology will introduce frequent exchange of routing vector or routing state between nodes. To deal with these problems multicast forwarding group routing protocol (MFGRP) which is based on route grid is designed on basis of dynamic source routing protocol (DSR). MFGRP ensures the multicast packets are sent to destination through dynamic topology network using multicast route grid.

Group missions of autonomous aerial vehicles have attracted a big interest in the last years due to its vast coverage area and its capability of executing complex tasks in a short amount of time. To ensure a high QoS in this collaborative work, the designed routing protocol must overcome the constraints imposed by this type of wireless ad hoc network that are mainly driven by the rapid mobility of the UAVs. In this paper, we give a brief overview on flying ad hoc routing protocols, then, we theoretically present and argue about our bio-inspired routing protocol proposition that uses a smart multi-agent system communities followed with some adaptations of two existing routing protocols that we believe it can deliver a higher QoS.KeywordsFANETUAVs networkDrone’s fleetRouting protocolMulti-agent system

Mobile Ad-hoc network is an autonomous system of mobile wireless nodes connected dynamically without any preexisting infrastructure. Here, since the nodes are mobile, the network topology changes rapidly and unpredictably over time. The QoS routing has challenging problems due to the network's dynamic topology. The multi hop wireless forwarding of packets, broadcasting of control traffic and the fact that, all nodes may act as routers in addition to being sources and sinks of data in ad-hoc networks produce different queuing behaviour. Hence, a scheduling algorithm to schedule the packets based on their respective priorities improves the performance of the network. Here, we present an efficient fuzzy based priority scheduler for mobile ad-hoc networks, to determine the priority of the packets. The performance of this scheduler is studied using GloMoSim and evaluated in terms of quantitative metrics such as packet delivery ratio, average end to end delay and throughput. It is found that the scheduler provides overall improvement in the performance of the system with various mobility models, when tested with different routing protocols.

With the increasing underwater applications, underwater wireless sensor networks (UWSNs) have become a research hotspot. Routing protocols used to keep network connectivity and reliable transmission are essential in UWSNs. Due to the specific limitations in UWSNs, such as serious ocean interference, high propagation latency, and dynamic network topology, it is challenging to balance multiple performances, such as real timeness and energy efficiency in a routing protocol. To this end, this article proposes a localization-free routing scheme, termed energy-efficient guiding-network-based routing (EEGNBR) protocol, to provide a time saving and reliable routing for UWSNs, which is a good choice for applications characterized by intermittent connectivity. For reducing the network delay, EEGNBR cites the advantageous distance-vector mechanism and establishes a guiding network to provide underwater sensor nodes with the shortest route (minimum hop counts) toward the sinks. Moreover, EEGNBR innovatively replaces the waiting mechanism used in traditional opportunistic routing with a novel data forwarding mechanism named concurrent working mechanism, which could greatly reduce the forwarding delay while guaranteeing reliable routing. In order to ensure routing reliability as well as avoid duplicate transmission, the forwarding protection mechanism is adopted to save energy consumption and extend the service life of the network. Simulation results show that EEGNBR performs significantly better than some classical related protocols in terms of network delay while maintaining comparable or even better energy consumption and packet delivery ratio.

As the scale of the network increases, especially wireless and mobile networks comes into fashion, the problem of network dynamic topology management turns into a focus topic in the network world. When network information changes, frequent route computing and network state updates can cause computing and traffic overhead, respectively. Therefore, minimum of influence to network structure has been identified as one of the key issues in designing dynamic network routing protocols. A novel protocol, which is based on Aggregation Tree Routing Model (ATRM) as well as an effective ball-and-string algorithm, is introduced in this paper which aims to minimize the alteration of network topology and to speed up the minimum cost route computation. This routing protocol is applicable to all kinds of networks, including Internet, ad hoc and wireless sensor networks. The simulations show that our protocol not only results in significantly lower overhead, but also gives high levels of dynamic network topology management performance while keeping practical.

Due to the constantly moving of the communication nodes in the combat environment, the network topology is highly dynamic and uncertain. However, combat missions require the real-time and accurate information transmission through the military network. Therefore, it is of great practical interest to design a dynamic routing algorithm to accommodate to the dynamic and uncertain network topology. We consider this important problem in this paper and make the following contributions. First, a semi-Markov prediction model is proposed to predict the uncertainty of the network topology. Second, a dynamic resource table is updated by the formation transition probability which can describe the dynamic of the network topology. Third, the Q-learning method is applied to find an optimal routing in the uncertain and dynamic network topology. Numerical experiments demonstrate that the proposed method can predict the network topology more accurate and obtain an optimal routing strategy with improved transmission efficiency and reduced transmission delay.KeywordsMilitary networksSemi-MarkovTopology predictionQ-learningDynamic routing

Recent years have seen a huge growth in Wireless body area network (WBAN) for monitoring human health, for processing and transmission of data and information. In WBAN tiny sensors are attached on the human body that monitor different parameters of the body and then send data further to the hospital server with the help of internet. This technology will make the human life more healthy and cheerful. WBAN faces many stringent problems in phases of delay, power, temperature and community lifetime which need to be taken into intention inside the design of various routing protocols. These routing protocol play a critical position in the general system performance in phases of delay like energy consumption, and temperature. WBAN is vital in radical look at on existing routing protocols. Mainly this paper contributes to review existing Ad-Hoc routing protocols. This paper also provides an overview on WBAN in health care, architecture of WBAN, non-medical and medical application and discussion about ad-hoc network routing protocol for WBAN.

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any fixed networking infrastructure, and a dynamic network topology. Routing protocols for such networks typically use exchanges of control packets, either at fixed intervals of time or in response to a requirement to adapt to the changing network topology. Balancing the optimality of the routes used in an ad hoc network as well as the overhead incurred from transmissions of routing packets is a challenging task. We propose a hybrid routing scheme that combines proactive route optimization with a reactive routing protocol, for reducing the average end-to-end delay in packet transmissions without exceeding the routing overhead. The proposed scheme uses a pre-emptive route discovery to replace an existing route by a shorter route when the route has been used for a given interval of time. The optimum time for making the pre-emptive search is obtained by studying the statistical distributions of the link and route lifetimes. The preemptive search is restricted within a limited distance from the old route by using a query-localization method. Performance evaluations of the proposed hybrid scheme in comparison with a purely on-demand routing protocol are presented.

Vehicle-to-vehicle networks have gained significant interest in recent times from researchers all around the world. V2V/V2I are emerging as an efficient solution for achieving road safety and securely transmitting data from one vehicle to other. However, in such opportunistic environments such as a sparse vehicular network where disruption, dynamic network topology, fast vehicle movement, and environmental conditions are the major concerns, data forwarding is extremely challenging. Traditional ad-hoc routing protocols like Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) fail to deliver in such laborious conditions. Routing protocols of Delay/Disruption Tolerant Networks(DTN) exploit the Store-Carry-Forward Mechanism (SCF) strategy in these cases. Taking advantage of temporary connections to disseminate information is the focus of DTN. DTN helps to increase information propagation coverage in sparse areas where there are very few devices. In this paper, we first compare the performance of AllJoyn framework and Direct Delivery protocol in a single-hop scenario and then draw the attention towards a multi-hop scenario by comparing other three routing protocols that use DTN as the underlying paradigm. These protocols are Flooding, Epidemic, and PRoPHET. The performances are evaluated by transmitting the files of size 1, 4, and 10 MB from a static sender to a mobile receiver in the multi-hop scenario. We also develop an Android application that contains the implementation of these routing protocols along with file sharing functionality. From the outcomes of this experiment, it can be said that Epidemic routing protocol performs the best in our considered multi-hop scenario in terms of transfer delay, coverage, and throughput whereas, Direct Delivery routing protocol performs better than AllJoyn in single-hop communication.

An adaptive and multi-path greedy perimeter stateless routing protocol in flying ad hoc networks

Mobile ad hoc networking enables communication in mobile wireless network by incorporating routing functionality into mobile nodes. In Mobile ad hoc network, nodes can formulates multi-hop dynamic topology which is sometimes rapidly changing and likely composed of bandwidth-constrained and variable capacity wireless links. Over such type of network choice of appropriate routing protocol that could offer efficient communication is obligatory. To elucidate this issue, paper presents the simulation analysis to investigate the performance of selected proactive and reactive routing protocols in a dynamic ad hoc environment considering UDP traffic. Paper also examines the impact of various conditions triggered due to node mobility.