# UAV Routing Protocol Based on Link Stability and Selectivity of Neighbor Nodes in ETX Metrics

Authors: Jinze Huang; Fengbiao Zan; Xin Liu; Da Chen
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

With the extensive application of UAVs in various fields, it becomes more important to design a routing protocol that ensures stable transmit between UAV groups. This is because UAV groups are densely packed, move fast, and communication links are fragile. Aiming at the intensive and highly maneuverable UAV group, the AODV-NLS-ETX—a routing protocol based on the link stability of neighbor nodes—is proposed on the basis of the ETX metric based AODV protocol. The protocol is simulated and compared with other protocols. The simulation results show that AODV-NLS-ETX is superior to other protocols in packet delivery rate and throughput under high shift speed, dense nodes, and high routing overhead. It can effectively reduce the high delay brought by the ETX mechanism. The delay is the most stable and is not easy to cause network congestion. It can be better applied to dense and highly mobile unmanned aerial vehicles.


---

## Body

## 1. Introduction

Nowadays, the advancement of science and technology has greatly promoted the wide use of UAVs. From the structural point of view, UAVs mainly include four types: fixed wing, rotating flapping wing, hybrid wing, and gas envelope [1], and it plays a huge role in high-altitude pesticide spraying, agricultural, forestry spectral monitoring, vertical take-off landing military monitoring, transportation of rescue materials, obstacle sensing, and satellite cooperative communication [2–7].Generally, UAVs work collaboratively in the form of clusters, so relevant researches tend to replace UAVs with network nodes. The Manhattan model, random waypoint model, and random street model [8] are the major three simulation models that are suitable for UAVs, among which the random waypoint model is selected in this research. In the UAV ad hoc network, nodes move faster in a relatively limited area. When there is a long communication distance between the destination node and source node, the UAV ad hoc network, by virtue of its high dynamics, enables the two nodes to forward data packets at high-speed through relay nodes. In the real scenario, the internal data transmission between UAVs is completed via the dynamic variability of ad hoc network. Figure 1 shows the communication structure of UAV ad hoc network. The base station transmits the signal to UAV A, where the UAV A is equivalent to the source node in the network simulation scenario, while UAV B is the relay node, and UAV C is the destination node. When the communication distance between A and is C within the maximum communication range, then A will directly send data to C. Otherwise, A will firstly send data to B, and then B will forward to C so as to complete the communication.Figure 1
Communication structure of UAV ad hoc network.Since UAV ad hoc network is featured by high intensity and dynamic, especially in the cluster operation, the problems of signal noise interference and communication system identification performance are particularly prominent [9, 10]. So it becomes a hotspot to improve the communication quality between UAVs, thereby making it significant to choose an appropriate ad hoc network routing protocol. Compared with other ad hoc network routing protocols, AODV is widely used in UAV ad hoc network as it is convenient and efficient performance [11]. In contrast, the traditional AODV protocol is often faced with broken communication links and insufficient data information transmission in the UAV ad hoc network that is intensive, highly dynamic, and drastically changing. Designing a more efficient and stable routing protocol becomes quite important.In response to such problems, many scholars proposed various stable and efficient protocols based on AODV. Bahloul et al. [12] designed a cluster-based UAV routing protocol (BR-AODV), which calculates in accordance with the on-demand routing mechanism of AODV and achieves routing maintenance as well as data transmission by introducing the base station discovery mechanism and Boids mechanism; Ramesh et al. [13] put forward a congestion adaptive routing protocol (CA-AODV) with a mechanism for monitoring node congestion, in which a warning will be issued between nodes once congestion occurs in the routing path so as to avoid node congestion; Wu et al. [14] mentioned an optimized protocol based on node residual energy and relative movement speed (EV-AODV), which considered the power of node receiving signal, the number of link hops and the node residual energy, normalized relative movement speed, as well as strengthened the node link mechanism; Tan et al. [15] presented an efficient digital signature algorithm based on elliptic curve cryptosystem and applied it to the AODV protocol; Chen et al. [16] proposed a greedy perimeter stateless routing protocol (TQNGPSR), which implemented flow balancing and evaluated the quality of wireless links by taking advantage of the neighboring congestion packets. In addition to above, there are still many other studies achieved good results in various indicators [17–22].The ETX metric mechanism of AODV is suitable for slow-topologically stable networks. However, in the highly dynamic UAV ad hoc network, the ETX metric mechanism performs worse than the hop count metric mechanism of AODV. It is easy to cause network congestion and high delay, and the two mechanisms will generate much routing overhead in the large-scale mobility UAV ad hoc network, which affects the network performance. The current common research is how to reduce the routing overhead and improve its performance. For example, PAODV is mentioned in [23], which improves network performance by reducing routing overhead. Reference [24] proposed ND-AODV based on PAODV, further reducing the routing overhead and improving its performance. Reference [25] proposed three ETX mechanisms to reduce the routing overhead because of the high routing overhead of the ETX metric mechanism. But none of them consider enhancing their network performance in the case of high routing overhead.Aiming at this problem, this paper proposes an ETX metric protocol AODV-NLS-ETX based on neighbor node link stability. This protocol reduces the retransmission information by using the neighbor node information and the HELLO packet setting information. Meanwhile, the node link stability is strengthened through taking ETX metric as the unit of AODV instead of hop count. In the case of high routing overhead, its network performance is further enhanced, making the ETX mechanism suitable for highly dynamic and dense UAV ad hoc networks.To verify its performance, we compare and analyze the AODV-NLS-ETX protocol with the AODV protocol, the AODV-ETX protocol, the ND-AODV-ETX protocol and the ND-AODV protocol. The ND-AODV-ETX protocol is designed by combining the ND-AODV protocol with the ETX metric.


## 2. ND-AODV Protocol Principle

As a classic routing protocol, the AODV protocol will not be introduced here. The principle of ND-AODV protocol and ND-AODV-ETX is the same, except that the hop number mechanism is changed to the ETX mechanism, so we only introduce the ND-AODV protocol. The ND-AODV protocol is improved based on PAODV. PAODV sets two probability parametersp1 and p2 according to the node density. Choose p1 when the node density is small, and choose p2 when the node density is high. In order to judge whether the network density is sparse or dense, a threshold Avg is introduced, and its calculation formula is as follows:
(1)Avg=∑i=1nNBi/n.The threshold can judge the density of the network. However, the probabilitiesp1 and p2 do not specify the optimal probability value in the reference [23], so the threshold is also difficult to calculate. In order to solve this problem, the reference [24] proposed the ND-AODV protocol.The ND-AODV protocol introduces a new parameterpi; its calculation formula is as follows:
(2)pi=min1,k/NBi.According to the number of neighborhood node density,pi can be easily calculated, which solves the problem that p1 and p2 and the threshold in PAODV are difficult to calculate. However k as a constant value, it is necessary to judge its optimal value. In reference [24], k=11 is optimal. k taking a high value will result in a high routing overhead. The range 10≤k≤15 protocol has both high overhead and good performance. The range k<10 reduce performance and low overhead. Since this paper studies how to improve the performance of the UAV ad hoc network under high routing overhead, but we also need a low-overhead comparison. Therefore, after careful consideration, the k value in ND-AODV and ND-AODV-ETX is chosen to be one without considering the optimal value.


## 3. Working Principle of Node Link

In this research, the proposed protocol includes two aspects: one is the selection of ETX node link and the other is the sending state and sending selection mechanism algorithm of HELLO packet in neighbor node. The protocol is designed to reduce retransmissions and strengthen link stability. Its working principle is introduced as follows.


### 3.1. Selection of ETX Node Link

As can be learned from the introduction in [26], the ETX metric mechanism monitors the expected number of transmissions on a link by installing a probe in each data packet. The traditional hop number mechanism in the AODV protocol will be replaced by the ETX metric in order to find out the propagation link with the smallest propagation value. If the node communication link is re-established, then the ETXr in a node link can be obtained by calculating the probability of successful forward transmission as well as reverse retransmission of the link. The ETXr is calculated as follows:
(3)ETXr=1fr×fd.fr is the probability of successful link forward transmission, and fd is the probability of successful link reverse transmission, indicating the ACK packet received from the destination node to the source node. Both of which can be calculated through data probe monitoring. The probability of successful link forward transmission cannot be directly calculated, but the fr can be obtained according to the data probe detection in the period T during communication from the source node to the destination node. The reverse retransmission probability fd is obtained by data probe packet transmission within w seconds, and the formula [26] is as follows:
(4)fd=countt−w,tw/T.In Formula (4), the numerator represents the data probe packet actually received during the window w when the data packet is transmitted on the link, and the denominator represents the data probe packet that shall be received theoretically. Where we set the denominator to one and directly calculate the probability through the numerator.The ETX of the overall network link can be calculated by calculating the ETX through a single link.
(5)ETX=∑i=1rETXr.Assuming that there arer links in the network environment, then the overall ETX is the overall addition of a single link, as shown in Formula (5) [26]. In order to select a more stable ETX link, a threshold value of chain stability is set up. Since the probabilities of successful link forward transmission and reverse retransmission are fr and fd, respectively, then the probability of successful node link is f:
(6)f=fr×fd.The probability of failed data transmission on a single node link can be calculated throughf, which is the probability of node link breakage fl. In this research, fl is set as the threshold, and the probabilities of failed reverse retransmission are fld. When the threshold fl<fld or fl=fld, the link will be discarded so as to select a more stable ETX link. In the transmission process of the ETX link, the probability of reverse retransmission is generally very small. However, the probability of retransmission will greatly increase in a highly dynamic UAV ad hoc network, which can be effectively reduced by setting the constraint condition of fl<fld. When in reverse transmission, set fld=fl, which indicates that the ETX transmission can be reduced when the probability of successful reverse transmission is almost equal to the successful transmission of the entire link f≈fd, thereby selecting a more stable link. fl, fld, and the constraints are
(7)fl=1−f,(8)fld=1−fd,(9)ETX=∑i=1rETXr,fl<fldfl=fld0.ETX will be accumulated link by link within the constraints, while the unreliable links will be discarded outside the constraints; 0 in Formula (9) means that ETX is not calculated. In this case, the ETX metric becomes more stable, the retransmissions of data probe packets are reduced in the selected node link, and the reliability and stability of node link are improved, which contributes to a stable transmission of data probe packets and higher successful rate of data transmission.


### 3.2. Selection Sending Mechanism Algorithm of HELLO Packet in Neighbor Node

During the transmission, the ETX in the data probe packet of AODV protocol is constantly accumulated to select the routing path with the best quality. In the selection process, the sending of ETX is in line with the transmission mechanism of the HELLO packet, which will not affect the HELLO packet itself. At the same time, HELLO packet is used to detect active routes, and the neighbor nodes determine the existence of active routes accordingly. However, in a highly dynamic UAV ad hoc network, the node link is so fragile that the HELLO packets are bound to be sent excessively in order to detect a new active route, which is likely to cause network congestion. In the case of network congestion, the ETX metric mechanism of AODV is useless as it may lead to higher delay. Therefore, in response to this situation, an algorithm for selecting the sending mechanism of HELLO packet between the neighbor nodes is proposed.Figure2 shows the process of selecting neighbor nodes in this algorithm. First, assume that node A is the source node and node D is the destination node, between which the established of communication link needs to be forwarded by a relay node. This algorithm restricts the node area within a circle. On this basis, when the distance d between two nodes is less than the radius R inside the circle, both nodes are defaulted as neighbor nodes, and then an effective link will be established between the nodes. Otherwise, no effective link will be established between the nodes. According to Figure 2, there are two approaches to establish a link between node A and node D: A-C-D and A-B-D. However, since the distance d between A and B is greater than the circle radius R, no effective path is established between nodes A and B. The dashed arrow in Figure 2 represents an invalid link while the solid arrow indicates a valid link. Similarly, for node B-D and node C-D, no effective link can be established because the distance d between node B and node D is greater than R. Thus, the final path is A-C-D, and stable link is established since neighbor nodes are selected.Figure 2
Neighbor node selection mechanism.After the node link is established, the node will provide connection information by broadcasting a HELLO packet so as to find the active path. At this moment, the data probe packet will be sent to establish a valid link. For the sake of preventing from sending too many HELLO packets, the link stability (LS) is set in this research.(10)LS=fπR2×T.f is the probability of successfully sending data in node link, πR2 is the area of the algorithm limited circle, and T is the sending period. In experimental simulation, the period T is set to 1 s to effectively reduce the synchronous sending effect caused by the data probe packet. By Formula (10), the probability of successfully sending data packets is dispersed to the link established by neighbor nodes inside the circle, the link stability threshold is established, and then the effective range of a link threshold is determined via algorithm simulation. On the condition of within this rang, the node will broadcast a HELLO packet to search for an active path, and the node will establish an ETX metric link. LS is set to unsigned 32 bits and the threshold range is set to 0x0000<LS<0x1111, within which node congestion can be effectively controlled. The overall algorithm flow is shown in Figure 3.Figure 3
Algorithm flow of selecting and sending mechanism of the HELLO packet in neighbor node.


## 3.1. Selection of ETX Node Link

As can be learned from the introduction in [26], the ETX metric mechanism monitors the expected number of transmissions on a link by installing a probe in each data packet. The traditional hop number mechanism in the AODV protocol will be replaced by the ETX metric in order to find out the propagation link with the smallest propagation value. If the node communication link is re-established, then the ETXr in a node link can be obtained by calculating the probability of successful forward transmission as well as reverse retransmission of the link. The ETXr is calculated as follows:
(3)ETXr=1fr×fd.fr is the probability of successful link forward transmission, and fd is the probability of successful link reverse transmission, indicating the ACK packet received from the destination node to the source node. Both of which can be calculated through data probe monitoring. The probability of successful link forward transmission cannot be directly calculated, but the fr can be obtained according to the data probe detection in the period T during communication from the source node to the destination node. The reverse retransmission probability fd is obtained by data probe packet transmission within w seconds, and the formula [26] is as follows:
(4)fd=countt−w,tw/T.In Formula (4), the numerator represents the data probe packet actually received during the window w when the data packet is transmitted on the link, and the denominator represents the data probe packet that shall be received theoretically. Where we set the denominator to one and directly calculate the probability through the numerator.The ETX of the overall network link can be calculated by calculating the ETX through a single link.
(5)ETX=∑i=1rETXr.Assuming that there arer links in the network environment, then the overall ETX is the overall addition of a single link, as shown in Formula (5) [26]. In order to select a more stable ETX link, a threshold value of chain stability is set up. Since the probabilities of successful link forward transmission and reverse retransmission are fr and fd, respectively, then the probability of successful node link is f:
(6)f=fr×fd.The probability of failed data transmission on a single node link can be calculated throughf, which is the probability of node link breakage fl. In this research, fl is set as the threshold, and the probabilities of failed reverse retransmission are fld. When the threshold fl<fld or fl=fld, the link will be discarded so as to select a more stable ETX link. In the transmission process of the ETX link, the probability of reverse retransmission is generally very small. However, the probability of retransmission will greatly increase in a highly dynamic UAV ad hoc network, which can be effectively reduced by setting the constraint condition of fl<fld. When in reverse transmission, set fld=fl, which indicates that the ETX transmission can be reduced when the probability of successful reverse transmission is almost equal to the successful transmission of the entire link f≈fd, thereby selecting a more stable link. fl, fld, and the constraints are
(7)fl=1−f,(8)fld=1−fd,(9)ETX=∑i=1rETXr,fl<fldfl=fld0.ETX will be accumulated link by link within the constraints, while the unreliable links will be discarded outside the constraints; 0 in Formula (9) means that ETX is not calculated. In this case, the ETX metric becomes more stable, the retransmissions of data probe packets are reduced in the selected node link, and the reliability and stability of node link are improved, which contributes to a stable transmission of data probe packets and higher successful rate of data transmission.


## 3.2. Selection Sending Mechanism Algorithm of HELLO Packet in Neighbor Node

During the transmission, the ETX in the data probe packet of AODV protocol is constantly accumulated to select the routing path with the best quality. In the selection process, the sending of ETX is in line with the transmission mechanism of the HELLO packet, which will not affect the HELLO packet itself. At the same time, HELLO packet is used to detect active routes, and the neighbor nodes determine the existence of active routes accordingly. However, in a highly dynamic UAV ad hoc network, the node link is so fragile that the HELLO packets are bound to be sent excessively in order to detect a new active route, which is likely to cause network congestion. In the case of network congestion, the ETX metric mechanism of AODV is useless as it may lead to higher delay. Therefore, in response to this situation, an algorithm for selecting the sending mechanism of HELLO packet between the neighbor nodes is proposed.Figure2 shows the process of selecting neighbor nodes in this algorithm. First, assume that node A is the source node and node D is the destination node, between which the established of communication link needs to be forwarded by a relay node. This algorithm restricts the node area within a circle. On this basis, when the distance d between two nodes is less than the radius R inside the circle, both nodes are defaulted as neighbor nodes, and then an effective link will be established between the nodes. Otherwise, no effective link will be established between the nodes. According to Figure 2, there are two approaches to establish a link between node A and node D: A-C-D and A-B-D. However, since the distance d between A and B is greater than the circle radius R, no effective path is established between nodes A and B. The dashed arrow in Figure 2 represents an invalid link while the solid arrow indicates a valid link. Similarly, for node B-D and node C-D, no effective link can be established because the distance d between node B and node D is greater than R. Thus, the final path is A-C-D, and stable link is established since neighbor nodes are selected.Figure 2
Neighbor node selection mechanism.After the node link is established, the node will provide connection information by broadcasting a HELLO packet so as to find the active path. At this moment, the data probe packet will be sent to establish a valid link. For the sake of preventing from sending too many HELLO packets, the link stability (LS) is set in this research.(10)LS=fπR2×T.f is the probability of successfully sending data in node link, πR2 is the area of the algorithm limited circle, and T is the sending period. In experimental simulation, the period T is set to 1 s to effectively reduce the synchronous sending effect caused by the data probe packet. By Formula (10), the probability of successfully sending data packets is dispersed to the link established by neighbor nodes inside the circle, the link stability threshold is established, and then the effective range of a link threshold is determined via algorithm simulation. On the condition of within this rang, the node will broadcast a HELLO packet to search for an active path, and the node will establish an ETX metric link. LS is set to unsigned 32 bits and the threshold range is set to 0x0000<LS<0x1111, within which node congestion can be effectively controlled. The overall algorithm flow is shown in Figure 3.Figure 3
Algorithm flow of selecting and sending mechanism of the HELLO packet in neighbor node.


## 4. Working Mechanism of AODV-NLS-ETX

### 4.1. Route Request and Route Reply Process

The AODV-NLS-ETX protocol is improved based on AODV-ETX protocol [27]. The packet format of RREQ and RREP is the same as that of AODV-ETX, so its route request and route reply process are in accordance with ETX metric [26]. The packet format is as follows.According to Table1 and Table 2, the ETX metric mechanism is added to the packet formats of both RREQ and RRE P so that the corresponding routing table will be updated once a node sends such a packet. Figure 4 shows the process of AODV-NLS-ETX routing request and reply.Table 1
RREQ packet format.
TypeJRGDUReservedHop countRREQ IDDestination IP addressDestination sequence numberOriginator IP addressOriginator sequence numberETXTable 2
RREP packet format.
TypeRAReservedPrefix SzHopCountDestination IP addressDestination sequence numberOriginator IP addressLife timeETXFigure 4
AODV-NLS-ETX routing request and reply process.In Figure4, node A is the source node, and node E is the destination node. Theoretically, there are three ways to establish a link from node A to node E: A-B-C-E, A-B-D-E, and A-B-C-D-E. First, node A sends an RREQ packet to node B. At this moment, the initial value of ETX is set to 0, and node D and node C separately receive the RREQ packet from node B so that the ETX value is calculated. In addition to receiving the RREQ packet from node B, node D also receives RREQ packet from node C. Different from the AODV protocol that discards the RREQ information from node D immediately, AODV-NLS-ETX protocol calculates the ETX value carried by node B and node D and discards the RREQ packet with larger ETX so as to select the link with the smallest ETX value. Similarly, the destination node E also selects the link with the smallest ETX value while receiving the RREQ packet from nodes D and C. As shown in Figure 4, the actual link finally selects A-B-C-E possibly because that the A-B-C-E link has the smallest ETX value and the lowest energy loss compared with the other two links. Then, the destination node E receives the RREQ packet, generates a RREP packet, replies to node A, and continuously updates the overall routing table.


### 4.2. Routing Maintenance Process

This protocol modifies the format of HELLO packet by adding the node link stability (LS). The modified format is shown in Table3.Table 3
HELLO packet format.
TypeReservedDestination IP addressDestination sequence numberHop countLife timeETXLink stabilityThe modification of HELLO packet format not only enables protocol to reduce the number of RREQ packet requests in highly dynamic and intensive network topology, but also improves the reliability of data transmission and lowers the delay caused by link disconnection. The routing maintenance process of AODV-NLS-ETX is shown in Figure5.Figure 5
AODV-NLS-ETX routing maintenance processAs indicated in Figure5, it is assumed that there are two links between the source node A and the destination node E: A-B-C-E and A-B-D-E. When node B is ready to transmit HELLO packet to node C and node D during a certain period of time, first, node B and node C will check the link stability. When confirming within the specified range, node B will transmit HELLO packet to node C, or if the link has been disconnected, then node B will receive the RERR packet within specified time to repair the route or choose a new path. If the node link stability between node B and node D exceeds the threshold, then the HELLO packet will not be transmitted (the dotted line in the figure represents the unsuccessful transmission). As a result, the corresponding RREQ packet will not be sent, thereby reducing the number of requests and decreasing the sending of HELLO packet. Through this mechanism, the selected ETX metric link is more stable and firm so that the data transmission success rate is improved.


## 4.1. Route Request and Route Reply Process

The AODV-NLS-ETX protocol is improved based on AODV-ETX protocol [27]. The packet format of RREQ and RREP is the same as that of AODV-ETX, so its route request and route reply process are in accordance with ETX metric [26]. The packet format is as follows.According to Table1 and Table 2, the ETX metric mechanism is added to the packet formats of both RREQ and RRE P so that the corresponding routing table will be updated once a node sends such a packet. Figure 4 shows the process of AODV-NLS-ETX routing request and reply.Table 1
RREQ packet format.
TypeJRGDUReservedHop countRREQ IDDestination IP addressDestination sequence numberOriginator IP addressOriginator sequence numberETXTable 2
RREP packet format.
TypeRAReservedPrefix SzHopCountDestination IP addressDestination sequence numberOriginator IP addressLife timeETXFigure 4
AODV-NLS-ETX routing request and reply process.In Figure4, node A is the source node, and node E is the destination node. Theoretically, there are three ways to establish a link from node A to node E: A-B-C-E, A-B-D-E, and A-B-C-D-E. First, node A sends an RREQ packet to node B. At this moment, the initial value of ETX is set to 0, and node D and node C separately receive the RREQ packet from node B so that the ETX value is calculated. In addition to receiving the RREQ packet from node B, node D also receives RREQ packet from node C. Different from the AODV protocol that discards the RREQ information from node D immediately, AODV-NLS-ETX protocol calculates the ETX value carried by node B and node D and discards the RREQ packet with larger ETX so as to select the link with the smallest ETX value. Similarly, the destination node E also selects the link with the smallest ETX value while receiving the RREQ packet from nodes D and C. As shown in Figure 4, the actual link finally selects A-B-C-E possibly because that the A-B-C-E link has the smallest ETX value and the lowest energy loss compared with the other two links. Then, the destination node E receives the RREQ packet, generates a RREP packet, replies to node A, and continuously updates the overall routing table.


## 4.2. Routing Maintenance Process

This protocol modifies the format of HELLO packet by adding the node link stability (LS). The modified format is shown in Table3.Table 3
HELLO packet format.
TypeReservedDestination IP addressDestination sequence numberHop countLife timeETXLink stabilityThe modification of HELLO packet format not only enables protocol to reduce the number of RREQ packet requests in highly dynamic and intensive network topology, but also improves the reliability of data transmission and lowers the delay caused by link disconnection. The routing maintenance process of AODV-NLS-ETX is shown in Figure5.Figure 5
AODV-NLS-ETX routing maintenance processAs indicated in Figure5, it is assumed that there are two links between the source node A and the destination node E: A-B-C-E and A-B-D-E. When node B is ready to transmit HELLO packet to node C and node D during a certain period of time, first, node B and node C will check the link stability. When confirming within the specified range, node B will transmit HELLO packet to node C, or if the link has been disconnected, then node B will receive the RERR packet within specified time to repair the route or choose a new path. If the node link stability between node B and node D exceeds the threshold, then the HELLO packet will not be transmitted (the dotted line in the figure represents the unsuccessful transmission). As a result, the corresponding RREQ packet will not be sent, thereby reducing the number of requests and decreasing the sending of HELLO packet. Through this mechanism, the selected ETX metric link is more stable and firm so that the data transmission success rate is improved.


## 5. Analysis of Simulated Results

### 5.1. Performance Index

The indicator of routing overhead has been mentioned earlier in this article. Next, we will combine PDR, average end-to-end delay, and throughput to test the performance of five protocols in the UAV ad hoc network. The introduction of the four indicators is as follows.PDR is the ratio of the data packet received by the destination node to that sent by the source node, which manifests the protocol reliability. The higher the ratio, the more reliable the protocol data transmission will be:(11)PDR=receivedpacketssentpackets.The average end-to-end delay is the ratio of the time the destination node receives the data packet minus the time the source node sends the data packet to the overall network receives the data packet. The smaller the delay, the better the network quality will be:(12)Delay=∑i=1packetsendtime−starttimepacketsum.Throughput is the ratio of the total bytes received by the destination node to the network transmission time, which reflects the amount of network transmission information. The greater the ratio, the greater the amount of information, and the higher the protocol transmission efficiency will be:(13)Throughput=8∗ryBetesTranmissiontime.Routing overhead is the ratio of the routing control packet sent by the network to the data packet received. The smaller the routing overhead, the fewer the additional control packets will be:(14)Overhead=routingcontrolpacketsreceivedpackets.


### 5.2. Experimental Environment

In this research, the open source software NS3 is applied to simulate the UAV ad hoc network under the4000m×4000m rectangular ideal environment. For each simulation, the period is 300 s, the data packet size are 64 bytes, the transmission rate is 2048 bps, the MAC layer protocol is IEEE802.11b, and the maximum communication distance of the node is 1000 m. In the simulation environment, we selected two environments. One is to increase the moving speed to simulate a high mobility network, and the other is to increase the number of nodes to simulate a dense network. Change the random seed 10 times and take the average. Table 4 and Table 5 show the simulation scenarios.Table 4
Simulation scenario under different number of nodes.
Simulation parameterParameter settingSimulation area4000m×4000mSimulation modelRandom waypointCommunication link10Business sourceCBRMAC layer protocolIEEE802.11bNumber of nodes50, 55, 60, 65, and 70Node movement speed40 m/sMax. Communication distance1000 mTable 5
Simulation scenario under different node movement speed.
Simulation parameterParameter settingSimulation area4000m×4000mSimulation modelRandom waypointCommunication link10Business sourceCBRMAC layer protocolIEEE802.11bNumber of nodes40Node movement speed20,25,30,35,and 40 (m/s)Max. Communication distance1000 m


### 5.3. Experimental Results

Figure6 shows the change of PDR of five protocols with the number of nodes. As can be seen from the figure, the PDR of the AODV-NLS-ETX protocol is better than other protocols. The AODV-NLS-ETX protocol establishes links and sets constraints according to the neighbor node selection mechanism, enhancing the ETX link stability and improving the reliability of data transmission. The overall PDR of AODV-NLS-ETX is about 11% higher than that of AODV-ETX and about 11% higher than ND-AODV-ETX. Due to maintaining a fixed node moving speed, the transmission of the ETX measurement mechanism is better than the hop transmission mechanism. The PDR of AODV-ETX and ND-AODV-ETX is better than AODV and ND-AODV.Figure 6
PDR under different number of nodes.Figure7 shows how the throughput of the five protocols changes with the number of nodes. The throughput of the AODV-NLS-ETX protocol is also better than that of other protocols. In the early stage, with the node density increase, AODV-NLS-ETX needs to establish a stable ETX link through the probe packet, so the throughput decreases. With the establishment of the link, the data can be transmitted stably, so the throughput gradually increases. The throughput of the AODV-NLS-ETX protocol is about 12% higher than that of AODV-ETX and about 12% higher than that of the ND-AODV-ETX protocol.Figure 7
Throughput with different number of nodes.Figure8 shows the change in the delay of the five protocols with the number of nodes. Compared with AODV-ETX and ND-AODV-ETX protocols, the delay of the AODV-NLS-ETX protocol is significantly reduced, and the delay is not different from that of AODV and ND-AODV protocols, and it is very stable. This is because the AODV-NLS-ETX protocol reduces the detection of reverse data probe packets and retransmission to a certain extent. In addition, because a more stable link is selected, it is not easy to generate network congestion, so the delay is very stable. The reverse retransmission of AODV-ETX and ND-AODV-ETX will bring a high delay, and the performance is even inferior to the hop number mechanism of AODV and ND-AODV protocols.Figure 8
Delay with different number of nodes.Figure9 shows the change in the overhead of the five protocols with the number of nodes. Compared with other protocols, the overhead of AODV-NLS-ETX is significantly higher than that of different protocols. This is because AODV-NLS-ETX needs to broadcast more RREQ packets than AODV-ETX and ND-AODV-ETX to establish a stable link to generate a lot of overhead. The ETX mechanism itself occupies many bytes in the routing control packet, which will also produce a high routing overhead. Therefore, the overhead of the three protocols will be higher than that of AODV and ND-AODV.Figure 9
Overhead under different number of nodes.Figure10 describes the changes of PDR of the five protocols with the node speed. It can be seen that the PDR of ND-AODV-ETX and AODV-NLS-ETX shows a downward trend between 25 and 30 speeds. This is because the ETX link of the two protocols is broken in this speed range and the ETX link needs to be re-established to transmit data. However, because the link established by the ND-AODV-ETX protocol is not as stable as that of the AODV-NLS-ETX protocol, PDR shows a downward trend in an extended speed shift period overall performance is not superior to that of AODV-NLS-ETX. The PDR of AODV-NLS-ETX is about 11% higher than that of AODV-ETX and about 7% higher than that of ND-AODV-ETX.Figure 10
PDR at different node speeds.Figure11 depicts the change of throughput with node moving speed. With the increase in node moving speed, the throughput of the AODV-NLS-ETX protocol is better than that of other protocols. Because the transmission link of the AODV-NLS-ETX protocol is relatively stable, the throughput will also show corresponding advantages. The throughput of the AODV-ETX protocol increases suddenly when the speed is shifted to 35 m/s. It may be that the throughput of AODV-ETX increases due to the relative rise of PDR and the increase of transmitted data. After that, the throughput decreases gradually and tends to be flat because the information remains effectively transmitted. The throughput of AODV-NLS-ETX is about 11% higher than that of AODV-ETX and about 5% higher than that of ND-AODV-ETX.Figure 11
Throughput at different node speeds.Figure12 shows the change of average end-to-end delay with node moving speed. It can be seen that the delay of AODV-ETX and ND-AODV-ETX is always higher than that of the AODV-NLS-ETX protocol. Because the ETX mechanism is easy to break the node-link in the high-speed scenario, and the reverse link data monitoring will also bring many retransmissions, the delay of these two protocols is very high. In the early speed change, the delay of ND-AODV and AODV is almost the same. This is because when the node density is relatively sparse, ND-AODV has little advantage over AODV, so the delay performance is the same. Due to network congestion, when the node speed is 35 m/s, the delay of both protocols suddenly increases. Although AODV-NLS-ETX has a slightly higher delay than the hop number mechanism protocols, its delay change is the most stable due to a stable link. It is not easy to cause network congestion, so it can be determined that AODV-NLS-ETX has more advantages in a high-speed environment.Figure 12
Delay at different node speeds.Figure13 shows how the routing overhead changes with the node speed. With the increase of the node speed, the routing overhead of each protocol is relatively high. Because AODV-NLS-ETX broadcasts more RREQ request packets and ETX itself adds larger routing control packets, the overhead is the highest. The routing overhead of the AODV-ETX protocol is almost the same as that of the ND-AODV-ETX protocol. The overhead of ND-AODV is significantly higher than that of AODV. This is because in the case of relatively sparse nodes, the increase of node moving speed causes an increase in routing request packets.Figure 13
Overhead at different node speeds.


## 5.1. Performance Index

The indicator of routing overhead has been mentioned earlier in this article. Next, we will combine PDR, average end-to-end delay, and throughput to test the performance of five protocols in the UAV ad hoc network. The introduction of the four indicators is as follows.PDR is the ratio of the data packet received by the destination node to that sent by the source node, which manifests the protocol reliability. The higher the ratio, the more reliable the protocol data transmission will be:(11)PDR=receivedpacketssentpackets.The average end-to-end delay is the ratio of the time the destination node receives the data packet minus the time the source node sends the data packet to the overall network receives the data packet. The smaller the delay, the better the network quality will be:(12)Delay=∑i=1packetsendtime−starttimepacketsum.Throughput is the ratio of the total bytes received by the destination node to the network transmission time, which reflects the amount of network transmission information. The greater the ratio, the greater the amount of information, and the higher the protocol transmission efficiency will be:(13)Throughput=8∗ryBetesTranmissiontime.Routing overhead is the ratio of the routing control packet sent by the network to the data packet received. The smaller the routing overhead, the fewer the additional control packets will be:(14)Overhead=routingcontrolpacketsreceivedpackets.


## 5.2. Experimental Environment

In this research, the open source software NS3 is applied to simulate the UAV ad hoc network under the4000m×4000m rectangular ideal environment. For each simulation, the period is 300 s, the data packet size are 64 bytes, the transmission rate is 2048 bps, the MAC layer protocol is IEEE802.11b, and the maximum communication distance of the node is 1000 m. In the simulation environment, we selected two environments. One is to increase the moving speed to simulate a high mobility network, and the other is to increase the number of nodes to simulate a dense network. Change the random seed 10 times and take the average. Table 4 and Table 5 show the simulation scenarios.Table 4
Simulation scenario under different number of nodes.
Simulation parameterParameter settingSimulation area4000m×4000mSimulation modelRandom waypointCommunication link10Business sourceCBRMAC layer protocolIEEE802.11bNumber of nodes50, 55, 60, 65, and 70Node movement speed40 m/sMax. Communication distance1000 mTable 5
Simulation scenario under different node movement speed.
Simulation parameterParameter settingSimulation area4000m×4000mSimulation modelRandom waypointCommunication link10Business sourceCBRMAC layer protocolIEEE802.11bNumber of nodes40Node movement speed20,25,30,35,and 40 (m/s)Max. Communication distance1000 m


## 5.3. Experimental Results

Figure6 shows the change of PDR of five protocols with the number of nodes. As can be seen from the figure, the PDR of the AODV-NLS-ETX protocol is better than other protocols. The AODV-NLS-ETX protocol establishes links and sets constraints according to the neighbor node selection mechanism, enhancing the ETX link stability and improving the reliability of data transmission. The overall PDR of AODV-NLS-ETX is about 11% higher than that of AODV-ETX and about 11% higher than ND-AODV-ETX. Due to maintaining a fixed node moving speed, the transmission of the ETX measurement mechanism is better than the hop transmission mechanism. The PDR of AODV-ETX and ND-AODV-ETX is better than AODV and ND-AODV.Figure 6
PDR under different number of nodes.Figure7 shows how the throughput of the five protocols changes with the number of nodes. The throughput of the AODV-NLS-ETX protocol is also better than that of other protocols. In the early stage, with the node density increase, AODV-NLS-ETX needs to establish a stable ETX link through the probe packet, so the throughput decreases. With the establishment of the link, the data can be transmitted stably, so the throughput gradually increases. The throughput of the AODV-NLS-ETX protocol is about 12% higher than that of AODV-ETX and about 12% higher than that of the ND-AODV-ETX protocol.Figure 7
Throughput with different number of nodes.Figure8 shows the change in the delay of the five protocols with the number of nodes. Compared with AODV-ETX and ND-AODV-ETX protocols, the delay of the AODV-NLS-ETX protocol is significantly reduced, and the delay is not different from that of AODV and ND-AODV protocols, and it is very stable. This is because the AODV-NLS-ETX protocol reduces the detection of reverse data probe packets and retransmission to a certain extent. In addition, because a more stable link is selected, it is not easy to generate network congestion, so the delay is very stable. The reverse retransmission of AODV-ETX and ND-AODV-ETX will bring a high delay, and the performance is even inferior to the hop number mechanism of AODV and ND-AODV protocols.Figure 8
Delay with different number of nodes.Figure9 shows the change in the overhead of the five protocols with the number of nodes. Compared with other protocols, the overhead of AODV-NLS-ETX is significantly higher than that of different protocols. This is because AODV-NLS-ETX needs to broadcast more RREQ packets than AODV-ETX and ND-AODV-ETX to establish a stable link to generate a lot of overhead. The ETX mechanism itself occupies many bytes in the routing control packet, which will also produce a high routing overhead. Therefore, the overhead of the three protocols will be higher than that of AODV and ND-AODV.Figure 9
Overhead under different number of nodes.Figure10 describes the changes of PDR of the five protocols with the node speed. It can be seen that the PDR of ND-AODV-ETX and AODV-NLS-ETX shows a downward trend between 25 and 30 speeds. This is because the ETX link of the two protocols is broken in this speed range and the ETX link needs to be re-established to transmit data. However, because the link established by the ND-AODV-ETX protocol is not as stable as that of the AODV-NLS-ETX protocol, PDR shows a downward trend in an extended speed shift period overall performance is not superior to that of AODV-NLS-ETX. The PDR of AODV-NLS-ETX is about 11% higher than that of AODV-ETX and about 7% higher than that of ND-AODV-ETX.Figure 10
PDR at different node speeds.Figure11 depicts the change of throughput with node moving speed. With the increase in node moving speed, the throughput of the AODV-NLS-ETX protocol is better than that of other protocols. Because the transmission link of the AODV-NLS-ETX protocol is relatively stable, the throughput will also show corresponding advantages. The throughput of the AODV-ETX protocol increases suddenly when the speed is shifted to 35 m/s. It may be that the throughput of AODV-ETX increases due to the relative rise of PDR and the increase of transmitted data. After that, the throughput decreases gradually and tends to be flat because the information remains effectively transmitted. The throughput of AODV-NLS-ETX is about 11% higher than that of AODV-ETX and about 5% higher than that of ND-AODV-ETX.Figure 11
Throughput at different node speeds.Figure12 shows the change of average end-to-end delay with node moving speed. It can be seen that the delay of AODV-ETX and ND-AODV-ETX is always higher than that of the AODV-NLS-ETX protocol. Because the ETX mechanism is easy to break the node-link in the high-speed scenario, and the reverse link data monitoring will also bring many retransmissions, the delay of these two protocols is very high. In the early speed change, the delay of ND-AODV and AODV is almost the same. This is because when the node density is relatively sparse, ND-AODV has little advantage over AODV, so the delay performance is the same. Due to network congestion, when the node speed is 35 m/s, the delay of both protocols suddenly increases. Although AODV-NLS-ETX has a slightly higher delay than the hop number mechanism protocols, its delay change is the most stable due to a stable link. It is not easy to cause network congestion, so it can be determined that AODV-NLS-ETX has more advantages in a high-speed environment.Figure 12
Delay at different node speeds.Figure13 shows how the routing overhead changes with the node speed. With the increase of the node speed, the routing overhead of each protocol is relatively high. Because AODV-NLS-ETX broadcasts more RREQ request packets and ETX itself adds larger routing control packets, the overhead is the highest. The routing overhead of the AODV-ETX protocol is almost the same as that of the ND-AODV-ETX protocol. The overhead of ND-AODV is significantly higher than that of AODV. This is because in the case of relatively sparse nodes, the increase of node moving speed causes an increase in routing request packets.Figure 13
Overhead at different node speeds.


## 6. Conclusion

This paper proposes an ETX metric UAV routing protocol (AODV-NLS-ETX) based on the link stability of neighbor nodes. Compared with the other four protocols, the AODV-NLS-ETX protocol has higher overhead, but has good performance. It is superior to other protocols in packet delivery rate and throughput. In terms of delay, this protocol reduces the high delay brought by the ETX mechanism. Although the delay is slightly increased compared with AODV and ND-AODV, it is the most stable and is not easy to cause network congestion. Especially in the high-speed and intensive UAV ad hoc network scenario, this protocol has stronger stability and reliability, is suitable for high-speed large-scale drone scenarios, and can also meet more network requirements.



---

*Source: 5428280-2022-05-14.xml*