Next Article in Journal
Detecting Hateful and Offensive Speech in Arabic Social Media Using Transfer Learning
Previous Article in Journal
Weld Defect Segmentation in X-ray Image with Boundary Label Smoothing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Impact of Nonlinear Mobility Models on Straight Line Conflict Detection Algorithm for UAVs

by
Maram Alajlan
* and
Abdelfettah Belghith
College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia
*
Author to whom correspondence should be addressed.
Appl. Sci. 2022, 12(24), 12822; https://doi.org/10.3390/app122412822
Submission received: 30 October 2022 / Revised: 7 December 2022 / Accepted: 9 December 2022 / Published: 14 December 2022

Abstract

:
Conflict detection is an essential issue in flying ad hoc networks (FANETs) to ensure the safety of unmanned aerial vehicles (UAVs) during flights. This paper assesses the applicability and utilization of a conflict detection algorithm that sees immediate trajectory as a straight line for short periods with nonlinear mobility models such as Gauss–Markov (GM). First, we use a straight line conflict detection algorithm with two nonlinear mobility models. Then, we perform an extensive simulation study to evaluate the performance. Additionally, we present a comprehensive discussion to tune the collision detection parameters efficiently. Simulation results indicate that an algorithm considering the immediate trajectory as a straight line to predict conflicts between UAVs can be applied with nonlinear mobilities and can provide an acceptable performance measured in false and missed alarms.

1. Introduction

Recently, unmanned aerial vehicles (UAVs), also known as drones, have gained a lot of attention in several fields because of their versatility, autonomous mobility, and fast deployment, alongside line-of-sight link connections between them, which gives a communication advantage. Researchers investigate the multi-UAV systems to employ them in civil and military applications with minimum human involvement. Drones can be used for remote visual inspection [1,2], packages delivery [3], and search and rescue [4] applications, to name a few. It is possible to utilize multiple UAVs to form flying swarms that can be used to create a self-organizing flying ad hoc network (FANET) without the need for a centralized administration or network infrastructure [5]. FANETs have the advantage of possible deployment in critical and risky situations when terrestrial mobile devices cannot operate or when the communication infrastructure is not available or destroyed.
One of the essential concerns when flying drones is ensuring their safety, including detecting and avoiding conflicts and eventual collisions in the shared space. Conflict happens when the distance between two drones becomes less than a specific value, i.e., loss of separation. Therefore, the conflict detection process predicts the loss of separation between the drones. Conflict detection is important to ensure flight safety, as it forecasts potential collisions. Several works in the literature tackled the conflict detection problem, such as [6,7]. These works assume that the drones will move in a straight line. However, the drones do not move in a strictly straight line but they fluctuate throughout the way. Thus, this work aims to study the performance of a conflict detection algorithm that views the immediate trajectories as straight lines for short periods to predict possible conflicts while using nonlinear mobility models. The mobility models are a major factor that affects protocol simulation [8] and play an essential role in the performance evaluation of ad hoc networks [9] as they represent the node movement and how the speed, position, and acceleration vary over time [10]. Testing a protocol with nonrealistic mobility models that not mimic the nodes’ movement well may lead to inaccurate conclusions.
The contribution of this paper is first to integrate a straight line conflict detection algorithm with two nonlinear mobility models, which are known to better emulate drone trajectories and movement. Secondly, we investigate the performance and usability of the detection algorithm with nonlinear mobility models and study the impact of this change on different metrics, such as the number of missed alarms, number of false alarms, and maneuver time.
The rest of this paper is organized as follows. Section 2 introduces UAV mobility models. Section 3 focuses on nonlinear mobility models. Section 4 briefly describes the used conflict detection algorithm. Section 5 presents the performance evaluation for several nonlinear mobility models with the conflict detection algorithm. Section 6 provides the discussion and possible future directions. Finally, Section 7 concludes the paper.

2. Unmanned Aerial Vehicle Mobility Model

FANET is a type of mobile ad hoc network (MANET). MANETs typically use the random waypoint (RWP) mobility model [11]. The RWP chooses the velocity of the node and the direction randomly, and then the mobile node moves to the destination in a straight line. When the node reaches its destination, it pauses and chooses a new destination. Thus, using the RWP, the node is subject to sudden changes in speed and directions and sudden stops. Moreover, with RWP, a node can undergo a 180 turn. Figure 1a shows an example of a path generated using this model. However, the UAVs have aerodynamic and mechanical restrictions that prevent them from performing such turns (illustrated in red circles in Figure 1a) [12]. Obviously, this mobility model is unrealistic for UAVs and may lead to inaccurate results when using simulations to study protocol performance. Additionally, the work in [13] shows that using typical MANET mobility models may produce undesirable trajectories for UAV applications. Different UAV formations and movements directly affect the mobility of multi-UAV systems. To address this issue, FANET mobility models are proposed.

3. Nonlinear Mobility Model

3.1. Gauss–Markov Mobility Model

A Gauss–Markov (GM) mobility model is a nonlinear and random model. It was first proposed in [14] and is motivated by the requirement for a closer to reality model in the sense that the UAV will accelerate, deaccelerate, and turn gradually. Thus, the movement (direction and speed) in GM is related to the previous movement through Gaussian equations using average direction and speed of the movement, as well as random Gaussian noise, besides a parameter that controls the degree of the dependency of the previous movement. In that sense, GM is also considered as a temporal dependency model, as the time is divided into slots, and the movement at each time slot depends on the movement of the previous time slot. Thus, the movements are correlated [15]. Figure 1b shows a sample of a trajectory generated by the GM mobility model.
The GM mobility model emulates the real environment for drone communications [16]. The GM was adopted for use in several recent FANET-related studies [16,17,18,19,20].
GM works as follows. In the beginning, each drone will have a specific direction and speed. After that, the direction and speed will be changed at each time period. The new direction ( θ t ) and speed ( v t ) will depend on the previous direction and speed and will be calculated as follows [21]:
θ t = α θ t 1 + ( 1 α ) μ θ + σ θ 1 α 2 w θ t 1 v t = α v t 1 + ( 1 α ) μ v + σ v 1 α 2 w v t 1
where t is the discrete unit of time; α is the tuning parameter which adapt the required level of randomness; θ t 1 and v t 1 are the previous direction and speed at time t 1 ; μ θ and μ v are the mean of the direction and speed, respectively; σ θ and σ v are the standard deviation of the direction and speed, respectively; w θ t 1 and w v t 1 are random variables from Gaussian distribution with mean equal 0 and unit variance.
The x and y are then calculated based on the direction and speed as follows:
x t = x t 1 + v t 1 cos θ t 1 y t = y t 1 + v t 1 sin θ t 1
where ( x t , y t ) is the x and y coordinate for the node at tth time interval, and ( x t 1 , y t 1 ) is the x and y coordinate for the node at t 1 time interval.

3.1.1. Gauss–Markov Variables

GM has several adjustable variables. The main tuning parameter is α , which controls the level of randomness of the model. Another important parameter is time step, which represents how frequently the new values are calculated, and, additionally, the values of the standard deviation of the speed and direction. In the following, we explain the effect of each of these variables.
Alpha α : The variable α is the tuning parameter for GM. Setting α to a value between 0 and 1 allows us to adjust the degree of the model randomness. When α = 1 , the model will be predictable and lose all of its randomnesses, and the new direction and velocity will be the same as the previous direction and velocity. Thus, when α = 1 , the drone moves in a straight line:
v t = v t 1 θ t = θ t 1
On the other hand, when α = 0 , the model will become memoryless, and the new direction and velocity will depend on the mean and standard deviation values of the direction and velocity and the Gaussian random variables.
v t = μ v + σ v w v t 1 θ t = μ θ + σ θ w θ t 1
Time step: The time step greatly affects the dynamics of GM. As the speed and direction will be fixed until the next time step, choosing a large time step will cause a long period of straight movements.
Standard deviation: The value of the standard deviation for the different variables will directly impact the trajectories as it affects the range of possible change of these variables. A much greater standard deviation than the averages produces different movement patterns than if the value is small. Choosing small values for the standard deviation of the direction will make a small direction change at each step, which leads to smoother turns. On the other hand, choosing large values for the standard deviation of the direction can lead to more significant direction change at each step, which leads to sharper turns.
The same thing applies for the speed; choosing small values for the standard deviation of the speed will make a small speed change at each step. For example, if the average speed equals 3, if we want speed values to be within the interval [2.5–3.5] (approximately), the speed standard deviation should be 0.1, but if we want speed values to be in the interval [2–4] (approximately), the speed standard deviation should be 0.2, and so on.
Thus, the standard deviations need to be set carefully based on the physical characteristics of the UAV.

3.1.2. Boundary Handling

There were several proposals on how the model should behave around the boundaries. Bai and Helmy in [15] proposed a direction change close to the boundaries without specifying how to make that change. In [22], the authors proposed a 180 turn around the boundaries. However, this strategy conflicts with one of the main reasons for proposing this model, which is to avoid sharp turns. Additionally, it will eliminate the temporal dependency feature as the direction is not based on the previous direction.
The works in [23,24] proposed forcing the mobile node away from the edge by changing the average of the direction when the node enters into a specific margin zone. In that way, the node moves away from the boundary progressively toward the center of the area. Figure 2 shows the proposed angle change.

3.1.3. Extending GM to Three Dimensions

The GM can be extended to 3D in several ways. First, the GM process can be applied to the three dimensions directly, as follows:
x t = α x t 1 + ( 1 α ) μ x + σ 1 α 2 w t 1 y t = α y t 1 + ( 1 α ) μ y + σ 1 α 2 w t 1 z t = α z t 1 + ( 1 α ) μ z + σ 1 α 2 w t 1
The issue with this way is that it is uncharacteristic to model the UAV flight. It is not easy to represent the UAV flight based on the UAV velocity in each direction. UAV flight can be modeled more accurately using a variable for velocity, a variable for direction, and a variable for pitch [25]. In this approach, the velocity and direction are calculated as in the two-dimensional Gauss–Markov, then we add another variable to track the vertical pitch, as follows:
v t = α v t 1 + ( 1 α ) μ v + σ 1 α 2 w t 1 θ t = α θ t 1 + ( 1 α ) μ θ + σ 1 α 2 w t 1 p t = α p t 1 + ( 1 α ) μ p + σ 1 α 2 w t 1
Then, the x, y, and z are calculated as follows:
x t = x t 1 + v t 1 cos ( θ t 1 ) cos ( p t 1 ) y t = y t 1 + v t 1 sin ( θ t 1 ) cos ( p t 1 ) z t = z t 1 + v t 1 sin ( p t 1 )

3.2. Enhanced Gauss–Markov

The work in [12] proposed an enhancement to GM (EGM), trying to limit the sudden stops and sharp turns and guarantee smooth paths around the boundaries. In EGM, a direction deviation is calculated first using the following formula:
θ d e v t = α × θ d e v t 1 + ( 1 α ) μ θ d e v + 1 α 2 w θ t 1
where θ d e v t 1 is the direction deviation in previous time t 1 . At the beginning it is chosen randomly from the range [ 10 , + 10 ] . The μ θ d e v is the mean for direction deviation and it is chosen to be 0. w θ t 1 is a random variable from Gaussian distribution with mean equal to zero and variance equal to 6.2 .
These values are chosen to make the direction deviation small to guarantee gradual direction change, and this will result in more smooth paths.
After that, the new direction is calculated as follows:
θ t = θ t 1 + θ d e v t
The x and y are then calculated based on the speed and direction as follows:
x t = x t 1 + v t 1 sin θ t y t = y t 1 + v t 1 cos θ t
Note that EGM considers two dimensions GM, and the speed is calculated as in the regular GM. Figure 3 shows a path for a UAV using the proposed enhancement implemented in OMNeT++.
To produce more smooth turns around the boundaries using EGM, the following changes will be applied when the drone approaches any boundary:
  • The mean of the direction deviation will be changed to 22.5 or + 22.5 (depending on the current direction of the UAV).
  • Reduction of the variance of the Gaussian distribution to 0.388 instead of 6.2.
These changes will be applied when the drone moves close to the boundary with a specified distance (margin). The value of this margin should be selected based on the drone’s speed and the value of the time step.

4. Conflict Detection Algorithm (SLIDE)

In [6], the authors proposed a mathematical model for the 3D conflict detection and a new algorithm called “SLIDE”. “SLIDE” is a straight line conflict detection and alerting algorithm for a group of drones to share a common airspace. SLIDE views the drones’ trajectories in the very near future as straight lines and depends only on the position and velocity information which are exchanged periodically between the drones. It does not require a priori knowledge of each drone’s trajectory; the drones can dynamically change their trajectories based on the flight situations and the surrounding environment. Additionally, it does not require any remote visual inspection (RVI) tools such as high-resolution cameras.
To ensure safe navigation in the 3D airspace, each drone is surrounded with a virtual spherical area called the protected zone. The protected zone for any drone should not overlap with any other drone’s protected zone. SLIDE predicts a conflict between two drones if their protected zones overlap at any time (t) within its prediction time (also called look ahead time) T l . SLIDE is a distributed algorithm; each drone individually uses its state information along with the states received from its neighbor drones to decide whether it is going to lose the safe zone during the prediction period. Each drone periodically sends (in each broadcast cycle T b ) its state information message, which contains its current position, velocity, and the radius of its protected zone. More specifically, SLIDE works as follows:
  • Input: T b and T l .
  • Output: Whether the drone will encounter conflicts during the T l , and the timing of the conflicts (if any).
  • Process: Each drone broadcast its information periodically every T b in a STATE message that contains the following:
    Current position;
    Current speed;
    The protected zone radius.
    When a drone receives the STATE message, it will calculate if there is a potential conflict during the T l , assuming that the two drones will continue in a straight line path. Each drone maintains a conflict table to record all information about conflicts, such as the identifiers of conflicting drones and the starting and ending time of the conflict. The start time of a conflict is when the overlap between the protected zones is expected to begin. The end time of a conflict is when the overlap between the protected zones is expected to finish. The conflict times are calculated using the drone’s local time, so there is no need for synchronization between the drone’s clocks.
Back-off time T o f f is used to avoid losing STATE messages when several drones try to send simultaneously. Each drone will wait for some random number chosen randomly and uniformly distributed from the interval [ 0 , T o f f ] . The maximal T o f f should be selected based on the network density. For high density, T o f f should be increased to avoid simultaneous broadcasts.

5. Performance Evaluation

SLIDE is implemented using the OMNeT++ simulator [26]. A comprehensive performance evaluation for SLIDE using RWP mobility can be found in [6]. The aim of this paper is to validate SLIDE and its usability with different mobility models, or, more specifically, with nonlinear mobility models (GM and EGM).

5.1. Simulation Setup

In the simulation setup, we consider the specifications of small drones, specifically Parrot AR.Drone [27]. The dimensions of AR.Drone are 51.7 cm × 51.7 cm, equipped with an 802.11 radio, and it can fly with its maximal speed of 5 m/s for approximately 12 min.
In each scenario, we consider the following:
  • N drones flying for 10 min in a confined space with the dimensions 500 m × 400 m × 30 m.
  • All drones have the same protected zone radius R.
  • All drones have the same communication range σ .
  • The drones use IEEE 802.11 protocol to communicate with each other directly.
  • The maximal back-off time is set to 1 s.
  • The environment is static, with no obstacles except the other drones and the boundary limits.
Every scenario is repeated 30 times. Table 1 contains the considered parameters for the simulation environment and Table 2 contains the considered parameters for GM and EGM. Figure 4 and Figure 5 show samples of the paths generated using these parameters.

5.2. Slide Behavior with Different Mobility Models

In this section, we investigate the performance of SLIDE after changing the mobility model. We compare the performance of SLIDE under three different mobility models. First, we study the effect of the simulation parameters (broadcast cycle T b , velocity v, communication range σ , look ahead time T l , and the protected zone R). Second, we compare the scalability. Finally, we study the effect of the mobility model parameters.

5.2.1. Effect of Simulation Parameters

Figure 6 shows the number of missed alarms using various broadcast cycles and velocities for SLIDE using GM, EGM, and RWP, respectively. The number of drones N is 40, the protected zone R is 1 m, and the look ahead time is 8 s.
As expected, increasing the broadcast cycle leads to an increase in missed alarms. With the RWP, the broadcast cycle should be less than σ 2 R 2 v to avoid missed alarms, thus, less than 3.8 s when the speed equals 3 s and 2.3 s when the speed equals 5 s. With the nonlinear mobilities, as there is a randomness factor, the drone’s next position may differ from the expected position. For EGM, the direction standard deviation is 2.49, which will make the next angle vary approximately by the range [ 5.6 , + 6.4 ] (the range is different around the boundary). For the GM, we set the angle standard deviation to 10, so the next angle varies approximately by the range [ 17 + 17.7 ] . For instance, when speed equals 3 m/s and the time step equals 0.5, if the angle changes by 4.5 degrees, the distance between the expected and the actual location will be around 15 cm. These values have a small but cumulative effect on the drone’s path, so GM and EGM performance are close for lower broadcast cycles and speed. However, as the broadcast cycle and speed increase, we can see that the EGM outperforms GM because the angle change is less using EGM. Besides that, EGM produced more smoothed paths around the borders; Figure 7 shows examples of how GM and EGM behave around borders.
Notably, the number of missed alarms for higher broadcast cycles is lower than that of the RWP. It is because the number of actual collisions is lower using GM and EGM. A possible reason for this is their movement pattern. Several works in the literature compared RWP with GM and concluded that GM leads to uneven node distribution, and they became more isolated for some time [28]. Figure 8 shows the movement pattern for three nodes with RWP and GM.
Figure 9 shows the number of missed alarms using different communication ranges and velocities for SLIDE using RWP, GM, and EGM, respectively. The considered broadcast cycle is 2, protected zone R is 1, and the look ahead is 8. These figures show clearly that the number of missed alarms decreases when the communication range increases. The algorithm will receive additional state information with larger communication ranges, enhancing the general performance.
Figure 10 shows the impact of the look ahead time T l , communication range σ , and protected zone radius R on the number of false alarms. The figures clarify that increasing T l , R, and σ lead to an increase in false alarms. For a particular R and σ , when T l increases, false alarms increase until they reach some maximum value. For instance, with RWP, when R = 2.5 and σ = 25, there were around two false alarms when T l = 2 s, and 4.9 false alarms when T l = 10 s, then the false alarms stabilize at this point. Similar behavior appears with GM and EGM but with larger false alarm values. This indicates that the prediction performance depends directly on the accuracy of the expected paths. The more distant in advance a prediction is, the less likely it is that such a prediction will be accurate because unexpected turning maneuvers are more likely to occur. SLIDE is a straight line conflict detection algorithm, yet it can provide acceptable performance for some small look ahead times with nonlinear mobilities such as GM and EGM. In fact, when the σ is 25, the benefit of a large look ahead is reduced, as this communication range gives us around 4 s on average for maneuvering even with RWP (Figure 11c).
If the σ is 25 m and the speed is 3 m/s, and assuming two drones enter each other’s range and head to each other, this will give 8 s until the collision. Such conflict cannot be predicted before that. Therefore, a minimum of 8 s for look ahead is required in this case ( σ = 25 and speed = 3) to detect such conflicts. However, we should avoid larger look ahead values with nonlinear mobility as they will negatively impact undetected conflicts and false alarms. Using GM and EGM, the drones will change their heading at each step (the considered time step (update interval) for both GM and EGM is 0.5 s), and the actual position in the near future may differ from the expected position by SLIDE. Figure 12 shows a sample of a GM path and compares it with the expected straight line path for 60 s. The distance between them reaches 7 m after 39 s.
The same applies to the EGM, with the difference that with EGM, in the beginning, the difference between the paths is less than the GM case, then the drone starts heading in a completely different direction (Figure 13).
Furthermore, for a specific T l and σ , the false alarms will rise by increasing the protected zone radius R from 1 m to 2.5 m. For example, with GM, when T l = 10 s and σ = 25 m, the number of false alarms is 12 when R = 1 m and becomes 30 when R is increased to 2.5 . We see the same behavior with the EGM; the false alarms increased from around 10 to 26. The reason for this rise is that the radius of the protected zone will increase the number of actual conflicts. For instance, with GM, the number of actual conflicts is 8 with a protected zone radius of 1 m and 60 conflicts with a protected zone radius of 2.5 m. This rise in the number of actual conflicts will increase the number of detected conflicts, and accordingly, the probability of false alarms will increase. In the same way, for a fixed T l and R, the number of false alarms will rise by increasing the communication range σ from 25 m to 65 m because each drone will have more nearby drones to consider, which will also increase the possibility of false alarms.
Figure 11 shows the average maneuver time and its relation with T l , σ , and R. For both GM and EGM, the maneuver time increases by increasing T l , σ , and R until it converges at some maximum value.
From the analysis of Figure 10 and Figure 11, we can conclude that the selections of T l and σ are a trade-off between the disturbance alarms and higher safety margin. Raising T l or σ will raise the maneuvering time but at the expense of raising the false alarms. On the other hand, lowering T l or σ will reduce the false alarms at the expense of reducing the maneuvering time, which may become not enough for avoidance maneuver.
Table 3 shows the number of false alarms under different airspace dimensions. We consider two speeds, v = 3 and v = 5 , and two look ahead times, T l = 2 and T l = 8 . The broadcast cycle is set to 2 s. We can see that the false alarms for all mobility models reduce as the airspace expands and the speed dropps. In larger airspaces, the drones will move in straight lines more frequently and have fewer turns, whereas in smaller airspaces and with faster speed, the drone will reach the boundaries faster, and the change of direction will be larger. Thus, to avoid large false alarms in smaller airspaces, we should use smaller T l .

5.2.2. SLIDE Scalability

Table 4 displays the number of actual conflicts, missed and false alarms, the probability of missed and false alarms, and the average maneuver time under a different number of drones. As the experiments from the previous section show that the performance of SLIDE is affected directly by the tuning parameters T l and T b , their values should be carefully selected to ensure acceptable performance for conflict detection. The considered value of T b is 2 s, and T l is 8 s.
Table 4 shows that, regardless of the growth of the number of drones from 40 to 120 and the growth of the number of actual conflicts from around 8 to 80 s, the probability of missed and false alarms remains almost constant for all mobility models. The same applies to the average maneuver times, in which it stays stable. For instance, with GM, SLIDE maintains a stable and low probability of missed alarms (around 0.2), an acceptable and stable probability of false alarms (around 1.5), and a stable average maneuver time of approximately 2 s. With EGM, also, SLIDE keeps a stable and lower probability of missed alarms (around 0.15), an acceptable and stable probability of false alarms (around 1.5), and a steady average maneuver time of approximately 2.5 s. Indeed, Table 4 shows that SLIDE is still scalable to an increasing number of drones even with nonlinear mobilities.

5.2.3. Effect of Mobility Model Parameters

The parameters of GM give the flexibility to adjust the model to be suitable for different movement patterns. Thus, they need to be chosen based on the physical characteristics of the UAV. In this section, we perform several experiments to evaluate the performance of SLIDE when changing the mobility model parameters. The considered T b is 2 s, T l is 8 s, and speed is 3 m/s.
First, we test the model with different time step values. Figure 14 shows the number of missed alarms under the following time steps (0.1 s, 0.25 s, 0.5 s, 0.75 s, 1 s, and 1.5 s). The figure shows that when the time step increases, the number of missed alarms decreases. With a larger time step, the drone will move with the same speed and direction for a longer period. In SLIDE, the drones periodically send their current locations and velocities. When a drone receives this information, it calculates if any possible conflict will occur in the near future. This calculation assumes that each drone will continue in the same direction, thus in a straight line. However, using GM, the direction will change randomly at each time step. For example, if the broadcast cycle is 0.5 s and the time step is 0.1 s, each drone will change its heading four times before sending its information again. On the other hand, if the broadcast cycle is 0.5 s and the time step is 1.5 s, the drones will change their heading once after sending their information so that the location will be accurate for around 1 s.
To understand how changing the standard deviation affects SLIDE’s performance, we vary the standard deviation of the angle, pitch, and speed in Figure 15a–c, respectively. For instance, Figure 15a depicts the result of changing the standard deviation of the angle from 0.5 to 20. The average number of missed alarms remains constant for the standard deviation from 0.5 to 7.5, then increases incrementally. Changing the angle’s standard deviation controls the direction change in each step, then the node will move in the new direction until the next time step. We can also see a similar effect from changing the pitch standard deviation in Figure 15b. We vary the standard deviation of the pitch from 0.1 to 20. The average number of missed alarms remains constant for the standard deviation from 0.1 to 7.5, then increases incrementally. Changing the standard deviation of the pitch controls how high (or low) the drone can move far from the initial altitude. With higher values for the pitch standard deviation, the drone altitude difference is more.
Figure 15c shows the result of changing the standard deviation of the speed from 0.1 to 1. As with the other standard deviations (angle and pitch), the number of missed alarms increases when the standard deviation increases. However, the algorithm is more sensitive to the speed change than the angle or altitude change. For instance, if the selected speed is 3, and the speed standard deviation is 0.5, the speed can reach 5 m/s. As the drone will move in the new direction for a longer distance, the errors will be accumulated much faster.

6. Discussion and Future Work

There are two main reasons for missed alarms using SLIDE: the first is when the messages are not received. The second is because a conflict will be considered as detected only if the conflict’s position and timing are both correct.
  • Losing messages: This has more effect when using GM and EGM (or nonlinear) mobility, as the drone’s direction will change more frequently. However, when using RWP, if a message is received, the drone will stay on the same line for some time, so all (or most) conflicts within the look ahead time can be detected, even if the next message is lost. In other words, there are several chances to detect a conflict, especially with small broadcast cycles. Thus, to avoid losing messages or to minimize its effect, the broadcast cycle should be small, and the density of the drones must be suitable for the environment.
  • Conflict time/place: SLIDE will not only predict if there is a conflict or not, but it also specifies the conflict interval, i.e., the time of the beginning of the conflict and the time of the end of the conflict. Using GM and EGM, the drones will change their heading at each step (the considered update interval is 0.5 s), and the actual position in the near future may differ from the predicted position by SLIDE. As an example, in one of the scenarios, a conflict between two drones happened at the time 20.5; SLIDE using GM predicts that the conflict will start at the time 21.1, the difference here is 0.6 s, and the algorithm considers this as undetected conflict (for the difference in timing). To minimize the errors in calculating the time and place, the changes in the angle and speed should not be large. For the experiments in Section 5.2.1, we tested the algorithm with high values for the standard deviations to present the general performance of the algorithm. The experiments in Section 5.2.3 show that the performance will improve when the standard deviations decrease.
In summary, to eliminate or minimize the missed alarms, SLIDE parameters, along with the mobility model parameters, need to be adjusted, and the environment needs to be studied carefully. From the experiments, SLIDE is expected to provide acceptable performance in predicting conflicts in large spaces with lower drone speed. Considering all these factors, SLIDE provides acceptable performance in predicting conflicts with nonlinear mobilities, with one missed alarm, on average, in most scenarios for 40 drones when the broadcast cycle is 2 or less. Thus, if we guarantee that all messages arrive and bound the angle change to some upper and lower limits, the errors in calculations will be reduced. This point can be further investigated in the future. Another interesting direction to explore is to study the impact of using 4G communication technology instead of the IEEE 802.11 protocol. From the provided experiments and analysis, it is expected that changing the communication model will directly impact the performance.

7. Conclusions

This paper investigates the performance and usability of a straight line conflict detection algorithm with nonlinear mobility models. First, we present two implementations of nonlinear mobility models for drones. Namely, Gauss–Markov and enhanced Gauss–Markov (EGM) [12]. Then, we compare the results using these nonlinear mobility models with the performance under a straight line mobility model (particularly, RWP). The results show that the straight line conflict detection algorithm can provide scalable and acceptable performance if the parameters are tuned carefully based on the environment for each mobility model.

Author Contributions

Conceptualization, M.A. and A.B.; methodology, M.A. and A.B.; software, M.A. and A.B.; formal analysis, M.A. and A.B.; investigation, M.A.; data curation, M.A.; writing—original draft preparation, M.A.; writing—review and editing, M.A. and A.B.; visualization, A.B.; supervision, A.B.; project administration, A.B.; All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Deanship of Scientific Research at King Saud University.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank the Deanship of Scientific Research at King Saud University for funding and supporting this research through the initiative of DSR Graduate Students Research Support (GSR).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Balsi, M.; Moroni, M.; Chiarabini, V.; Tanda, G. High-Resolution Aerial Detection of Marine Plastic Litter by Hyperspectral Sensing. Remote Sens. 2021, 13, 1557. [Google Scholar] [CrossRef]
  2. Filkin, T.; Sliusar, N.; Ritzkowski, M.; Huber-Humer, M. Unmanned Aerial Vehicles for Operational Monitoring of Landfills. Drones 2021, 5, 125. [Google Scholar] [CrossRef]
  3. Saponi, M.; Borboni, A.; Adamini, R.; Faglia, R.; Amici, C. Embedded Payload Solutions in UAVs for Medium and Small Package Delivery. Machines 2022, 10, 737. [Google Scholar] [CrossRef]
  4. Ho, Y.H.; Tsai, Y.J. Open Collaborative Platform for Multi-Drones to Support Search and Rescue Operations. Drones 2022, 6, 132. [Google Scholar] [CrossRef]
  5. Pasandideh, F.; da Costa, J.P.J.; Kunst, R.; Islam, N.; Hardjawana, W.; Pignaton de Freitas, E. A Review of Flying Ad Hoc Networks: Key Characteristics, Applications, and Wireless Technologies. Remote Sens. 2022, 14, 4459. [Google Scholar] [CrossRef]
  6. Mahjri, I.; Dhraief, A.; Belghith, A.; AlMogren, A.S. SLIDE: A Straight Line Conflict Detection and Alerting Algorithm for Multiple Unmanned Aerial Vehicles. IEEE Trans. Mob. Comput. 2018, 17, 1190–1203. [Google Scholar] [CrossRef]
  7. Wan, Y.; Tang, J.; Lao, S. Distributed Conflict-Detection and Resolution Algorithm for UAV Swarms Based on Consensus Algorithm and Strategy Coordination. IEEE Access 2019, 7, 100552–100566. [Google Scholar] [CrossRef]
  8. Yassein, M.B.; Alhuda, N. Flying ad-hoc networks: Routing protocols, mobility models, issues. Int. J. Adv. Comput. Sci. Appl. (IJACSA) 2016, 7. [Google Scholar] [CrossRef] [Green Version]
  9. Camp, T.; Boleng, J.; Davies, V. A survey of mobility models for ad hoc network research. Wirel. Commun. Mob. Comput. 2002, 2, 483–502. [Google Scholar] [CrossRef]
  10. Wheeb, A.H.; Nordin, R.; Samah, A.A.; Alsharif, M.H.; Khan, M.A. Topology-Based Routing Protocols and Mobility Models for Flying Ad Hoc Networks: A Contemporary Review and Future Research Directions. Drones 2022, 6, 9. [Google Scholar] [CrossRef]
  11. Brown, T.X.; Doshi, S.; Jadhav, S.; Himmelstein, J. Test Bed for a Wireless Network on Small UAVs. In Proceedings of the AIAA 3rd “Unmanned Unlimited” Technical Conference, Workshop and Exhibit, Chicago, IL, USA, 20–23 September 2004; pp. 20–23. [Google Scholar]
  12. Biomo, J.M.M.; Kunz, T.; St-Hilaire, M. An enhanced Gauss-Markov mobility model for simulations of unmanned aerial ad hoc networks. In Proceedings of the 2014 7th IFIP Wireless and Mobile Networking Conference (WMNC), Vilamoura, Portugal, 20–22 May 2014; pp. 1–8. [Google Scholar]
  13. Kuiper, E.; Nadjm-Tehrani, S. Mobility models for UAV group reconnaissance applications. In Proceedings of the 2006 International Conference on Wireless and Mobile Communications (ICWMC’06), Bucharest, Romania, 29–31 July 2006; p. 33. [Google Scholar]
  14. Liang, B.; Haas, Z.J. Predictive distance-based mobility management for PCS networks. In Proceedings of the IEEE INFOCOM’99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No. 99CH36320), New York, NY, USA, 21–25 March 1999; Volume 3, pp. 1377–1384. [Google Scholar]
  15. Bai, F.; Helmy, A. A survey of mobility models. Wirel. Adhoc Netw. Univ. South. Calif. USA 2004, 206, 147. [Google Scholar]
  16. Li, Y.; Wang, W.; Gao, H.; Wu, Y.; Su, M.; Wang, J.; Liu, Y. Air-to-ground 3D channel modeling for UAV based on Gauss-Markov mobile model. AEU—Int. J. Electron. Commun. 2020, 114, 152995. [Google Scholar] [CrossRef]
  17. Jo, Y.i.; Lee, S.; Kim, K.H. Overlap Avoidance of Mobility Models for Multi-UAVs Reconnaissance. Appl. Sci. 2020, 10, 4051. [Google Scholar] [CrossRef]
  18. Anjum, M.N.; Wang, H. Mobility Modeling and Stochastic Property Analysis of Airborne Network. IEEE Trans. Netw. Sci. Eng. 2020, 7, 1282–1294. [Google Scholar] [CrossRef]
  19. Chen, Y.J.; Liao, K.M.; Ku, M.L.; Tso, F.P.; Chen, G.Y. Multi-Agent Reinforcement Learning Based 3D Trajectory Design in Aerial-Terrestrial Wireless Caching Networks. IEEE Trans. Veh. Technol. 2021, 70, 8201–8215. [Google Scholar] [CrossRef]
  20. Korneev, D.A.; Leonov, A.V.; Litvinov, G.A. Estimation of Mini-UAVs Network Parameters for Search and Rescue Operation Scenario with Gauss-Markov Mobility Model. In Proceedings of the 2018 Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO), Minsk, Belarus, 4–5 July 2018; pp. 1–7. [Google Scholar] [CrossRef]
  21. Roy, R.R. Random Gauss–Markov Mobility. In Handbook of Mobile Ad Hoc Networks for Mobility Models; Springer: Boston, MA, USA, 2011; pp. 311–344. [Google Scholar] [CrossRef]
  22. Amoussou, G.; Mahanna, H.; Zblgnlew, D.; Kadoch, M. An OpNet implementation of Gauss-Markov mobility model and integration of link prediction algorithm in DSR protocol: A cross-layer approach. In Proceedings of the OPNETWORK 2005, Washington, DC, USA, 12–14 October 2005; pp. 22–26. [Google Scholar]
  23. Tolety, V. Load Reduction in Ad Hoc Networks Using Mobile Servers. Master’s Thesis, Colorado School of Mines, Golden, CO, USA, 1999. [Google Scholar]
  24. Alenazi, M.; Sahin, C.; Sterbenz, J.P. Design Improvement and Implementation of 3D Gauss-Markov Mobility Model; Technical Report; Air Force Test Center: Edwards Air Force Base, CA, USA, 2013. [Google Scholar]
  25. Rohrer, J.P.; Çetinkaya, E.K.; Narra, H.; Broyles, D.; Peters, K.; Sterbenz, J.P.G. AeroRP performance in highly-dynamic airborne networks using 3D Gauss-Markov mobility model. In Proceedings of the 2011-MILCOM 2011 Military Communications Conference, Baltimore, MD, USA, 7–10 November 2011; pp. 834–841. [Google Scholar] [CrossRef]
  26. Varga, A. The omnet++ discrete event simulation system. In Proceedings of the ESM’01, Prague, Czech Republic, 6–9 June 2001. [Google Scholar]
  27. Krajník, T.; Vonásek, V.; Fišer, D.; Faigl, J. AR-Drone as a Platform for Robotic Research and Education. In Proceedings of the Research and Education in Robotics-EUROBOT 2011, Prague, Czech Republic, 15–17 June 2011; Obdržálek, D., Gottscheber, A., Eds.; Springer: Berlin/Heidelberg, Germany, 2011; pp. 172–186. [Google Scholar]
  28. Peters, K.J. Design and Performance Analysis of a Geographic Routing Protocol for Highly Dynamic MANETs. Ph.D. Thesis, University of Kansas, Lawrence, KS, USA, 2010. [Google Scholar]
Figure 1. Sample paths under (a) random waypoint; (b) Gauss–Markov.
Figure 1. Sample paths under (a) random waypoint; (b) Gauss–Markov.
Applsci 12 12822 g001
Figure 2. Change of mean angle near the boundaries.
Figure 2. Change of mean angle near the boundaries.
Applsci 12 12822 g002
Figure 3. Drone trajectory in 2D using EGM.
Figure 3. Drone trajectory in 2D using EGM.
Applsci 12 12822 g003
Figure 4. Samples of the generated paths using GM.
Figure 4. Samples of the generated paths using GM.
Applsci 12 12822 g004
Figure 5. Samples of the generated paths using EGM.
Figure 5. Samples of the generated paths using EGM.
Applsci 12 12822 g005
Figure 6. Average missed alarms under different T b using (a) GM; (b) EGM; (c) RWP.
Figure 6. Average missed alarms under different T b using (a) GM; (b) EGM; (c) RWP.
Applsci 12 12822 g006
Figure 7. Samples of the paths around the boundary using (a) GM; (b) EGM.
Figure 7. Samples of the paths around the boundary using (a) GM; (b) EGM.
Applsci 12 12822 g007
Figure 8. Traveling patterns of nodes with (a) RWP; (b) GM.
Figure 8. Traveling patterns of nodes with (a) RWP; (b) GM.
Applsci 12 12822 g008
Figure 9. Average missed alarms under different σ using (a) GM; (b) EGM; (c) RWP.
Figure 9. Average missed alarms under different σ using (a) GM; (b) EGM; (c) RWP.
Applsci 12 12822 g009
Figure 10. Number of false alarms under different T l , σ , and R using (a) GM; (b) EGM; (c) RWP.
Figure 10. Number of false alarms under different T l , σ , and R using (a) GM; (b) EGM; (c) RWP.
Applsci 12 12822 g010
Figure 11. Average maneuver time under different T l , σ , and R using (a) GM; (b) EGM; (c) RWP.
Figure 11. Average maneuver time under different T l , σ , and R using (a) GM; (b) EGM; (c) RWP.
Applsci 12 12822 g011
Figure 12. Sample of GM path and the expected straight line path for 60 s.
Figure 12. Sample of GM path and the expected straight line path for 60 s.
Applsci 12 12822 g012
Figure 13. Sample of EGM path and the expected straight line path for (a) 60 s; (b) 15 s.
Figure 13. Sample of EGM path and the expected straight line path for (a) 60 s; (b) 15 s.
Applsci 12 12822 g013
Figure 14. Impact of time step on the number of missed alarms.
Figure 14. Impact of time step on the number of missed alarms.
Applsci 12 12822 g014
Figure 15. Impact of the standard deviation on the number of missed alarms: (a) angle SD; (b) pitch SD; (c) speed SD.
Figure 15. Impact of the standard deviation on the number of missed alarms: (a) angle SD; (b) pitch SD; (c) speed SD.
Applsci 12 12822 g015
Table 1. Simulation parameters for the environment.
Table 1. Simulation parameters for the environment.
ParametersValue
Number of drones40
Area dimensions500 × 400 × 30
Simulation time600 s
Back-off time1 s
Table 2. Simulation parameters for GM and EGM.
Table 2. Simulation parameters for GM and EGM.
ParametersGMEGM
alpha α 0.860.86
Speed standard deviation0.10.1
Pitch standard deviation100 (fixed altitude)
Angle standard deviation10-
Direction standard deviation-2.49
Time step (updateInterval)0.50.5
Margin25 m for v = 3 & 40 m for v = 525 m for v = 3 & 40 m for v = 5
Table 3. Average false alarms with different airspace dimensions.
Table 3. Average false alarms with different airspace dimensions.
With GMTl = 2 s
v = 3 m/s
Tl = 2 s
v = 5 m/s
Tl = 8 s
v = 3 m/s
Tl = 8 s
v = 5 m/s
450 × 350 × 304.9013.0014.9720.07
500 × 400 × 303.979.2311.7714.57
500 × 400 × 352.777.808.9313.30
550 × 450 × 351.635.806.7311.20
With EGM
450 × 350 × 303.4710.7010.0714.73
500 × 400 × 302.277.578.1312.37
500 × 400 × 352.336.416.6010.33
550 × 450 × 351.535.605.488.38
With RWP
450 × 350 × 300.371.000.871.67
500 × 400 × 300.470.670.871.57
500 × 400 × 350.330.700.771.20
550 × 450 × 350.170.230.600.87
Table 4. SLIDE scalability.
Table 4. SLIDE scalability.
Number of UAVs406080100120
With GM
Actual conflicts8.4021.4736.4058.4784.00
Number of missed alarms1.673.375.509.4014.07
Number of false alarms11.7727.8746.2072.6398.10
Missed alarms probability0.200.160.150.160.17
False alarms probability1.751.541.501.481.40
Maneuver time (s)2.132.132.202.202.33
With EGM
Actual conflicts8.7320.4034.4755.2080.87
Number of missed alarms1.333.234.839.2713.97
Number of false alarms8.1319.6332.3054.3775.73
Missed alarms probability0.150.160.140.170.17
False alarms probability1.101.141.091.181.13
Maneuver time (s)2.572.562.722.792.74
With RWP
Actual conflicts13.0726.3352.1377.73108.53
Number of missed alarms0.370.901.933.203.93
Number of false alarms0.831.972.604.505.83
Missed alarms probability0.030.030.040.040.04
False alarms probability0.070.080.050.060.06
Maneuver time (s)3.433.243.263.223.25
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Alajlan, M.; Belghith, A. The Impact of Nonlinear Mobility Models on Straight Line Conflict Detection Algorithm for UAVs. Appl. Sci. 2022, 12, 12822. https://doi.org/10.3390/app122412822

AMA Style

Alajlan M, Belghith A. The Impact of Nonlinear Mobility Models on Straight Line Conflict Detection Algorithm for UAVs. Applied Sciences. 2022; 12(24):12822. https://doi.org/10.3390/app122412822

Chicago/Turabian Style

Alajlan, Maram, and Abdelfettah Belghith. 2022. "The Impact of Nonlinear Mobility Models on Straight Line Conflict Detection Algorithm for UAVs" Applied Sciences 12, no. 24: 12822. https://doi.org/10.3390/app122412822

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop