PLoS ONE
Public Library of Science
image
A dynamic source routing protocol based on path reliability and link monitoring repair
DOI: 10.1371/journal.pone.0251548, Volume: 16, Issue: 5, Pages: 0-0
Article Type: research-article, Article History
Abstract

The two most essential factors for mobile self-organizing networks applicable to drones are reliability and stability. In harsh communication environments, such as mountainous regions and natural disasters, the use of satellites and terrestrial communication stations has severe time delays due to the high speed of UAVs, resulting in frequent communication interruptions with UAVs. Therefore, UAVs need to establish self-organizing networks for communication and information sharing. High-speed movement will lead to rapid changes in the network topology, resulting in established links being in an unstable connection state and even frequent routing errors, thus preventing the establishment of stable communication links. In order to improve the communication quality of UAVs under high-speed movement, we propose a dynamic source routing protocol based on path reliability and monitoring repair mechanism (DSR-PM). The model performs data transmission by filtering the best reliability path. The link state information is monitored during transmission and broken links are repaired in time to ensure the communication stability and reliability of the links and improve the data transmission efficiency. We simulated the approach in NS2 software and the simulation results show that the DSR-PM protocol effectively reduces parameters such as overhead, packet loss and delay, improves network throughput, and provides better communication performance.

1 Introduction

With the development of communication technology, the current technical standards related to 5G communication have been basically completed and 5G has been commercialized in some countries and regions [1,2]. Along with the gradual solidification of 5G standardization, many researchers have started to consider the future 6G communication network [3]. 5G communication technology has achieved high-speed data transmission and its ability to provide services for different devices in different application scenarios [4]. Mobile self-organizing network is a multi-hop temporary autonomous system composed of mobile nodes with wireless transmission capability [57], and its application under 5G communication system is bound to be the future development direction. Routing technology, as a key technology in mobile self-organizing networks, needs to be further studied and improved to make it applicable to the communication scenario of UAVs. Due to the fast speed of UAVs, their communication status is easily affected by the complex geographical environment, and the communication through satellite or ground base station sometimes has high delay and instability. Therefore, the communication stability and reliability of routing protocols need to be further improved [8]. In order to apply UAVs to various complex communication scenarios, many researchers have conducted in-depth research and optimization of routing protocols in various scenarios.

To improve the security of communication, R. Thillaikarasi proposed an effective DSR protocol for detecting black hole attacks in wireless sensor networks [9]. This method effectively stops the black hole attack by detecting malicious nodes in the network, improves the security of communication and ensures the transmission of information. V. V. Mandhare also proposed a fast detection method based on DSR protocol to detect malicious nodes in the network [10]. Since mobile self-organizing networks are vulnerable to various attacks, malicious nodes occupy processor threads and memory space by sending multiple packets, thus preventing these nodes from receiving redundant data and information. This approach effectively identifies and detects malicious nodes, applies a reasonable node penalty system, and reconsiders node usage to ensure that each node is in the correct working state and improves the communication security of the protocol. Since wireless nodes have very limited cache space, Mandhare proposed a cache update method based on multipath DSR protocol [11]. This method is used to handle the invalid paths in the routing information to improve the cache space utilization, while recording and providing valid routing information to improve the quality of service of DSR protocol. Salari-Moghaddam also proposed a trust management system to improve the quality of service of DSR protocols [12]. This trust management approach can be used to design trust-based routing protocols to avoid attacks from malicious nodes and based on this trust management system, a method is proposed to reduce energy consumption and improve quality of service. The communication quality can be improved by increasing the packet transmission rate and residual energy while maintaining the end-to-end delay. To improve the privacy of DSR protocol, Armir Bujari proposed a security scheme for DSR protocol [13]. This scheme requires key authentication for each node in the communication, which improves the information security of the routing protocol, prevents information leakage, and ensures that the information can be delivered securely to the target node. Mythili also proposed a new secure routing mechanism, the spatial and energy-aware trusted dynamic distance DSR algorithm, for improving the survival time of wireless sensor networks [14]. Quality of service-based energy-aware routing algorithm is used to balance the effectiveness of spatial information, energy level and data quality. Based on this, a new hierarchical trust mechanism is proposed which classifies nodes based on speed, data size, energy and respective recommendations to remove nodes with abnormal behavior and increase transmission rate while ensuring security.

Because of the fast movement of UAVs, the high-speed movement inevitably leads to drastic changes in the network topology, which makes the established transmission links break and further affects the transmission performance of the protocol. The complex and variable communication environment in which UAVs are located also affects the communication performance of routing protocols, so in order to improve the communication stability and reliability of UAVs in complex environments, this paper conducts further research and optimization for this problem.

Our main contributions in this paper are as follows. First, we propose a reliability model to filter the valid paths to the target node. By computing the reliability weights of each path, we select the path with the highest reliability weights for data transmission. Secondly, in order to improve the stability of the link and the effectiveness of data transmission, we adopt a monitoring and repair mechanism to monitor the state information of the link during the data transmission process and repair the broken link in time through its neighbor nodes to provide assurance for the data transmission. Finally, the experimental results show a good improvement in the communication performance.

The rest of this article is arranged as follows: in section 2, introduced the main contents of the DSR routing protocol. In section 3, shows the optimization methods of other researchers for DSR protocol. In section 4, presents the proposed improvement methods and optimization mechanisms. In section 5, describes the simulation environment of the experiment and the analysis of the experimental results. Finally, summarize the experimental results and the methods used.

2 Background information

The dynamic source routing (DSR) protocol is a multi-jump on-demand routing protocol designed specifically for mobile nodes. When using the protocol, the network is fully self-organized and autonomic connected, and not use the ground base station and the satellite to build the communication between the nodes [1517]. The source dynamic routing protocol consists of two main mechanisms, Routing discovery mechanism and routing maintenance mechanism [18].

2.1 Routing discovery mechanism

When a source node s produces a new data packet that needs to be transmitted to a destination node d, the source node s will add to a source route in the header of the data group, so that the source routing data is transmitted to the node of the destination [19]. Normally, the source node s can search for its local routing memory to find a route to the destination node. If no available routing is found, the source node s will initialize the routing to find an agreement to dynamically find a route to the destination node d. Therefore, the source node s and the destination node d are called initiating nodes and target nodes [20].

After the intermediate node receives the routing request, it is divided by the source node and the target node’s id and its information in the request packet, which can divide into the following situations:

    • If this node is the target node for this route, the node will send a "route response", which is collected by the reply bag from the response bag, which contains the resulting routing record, and the initiator node receives the message from the response package, and stores the information in the packet in its own routing memory for subsequent communication.
    • If the address information of this node is found in the request packet in the routing request package, the node will conclude that the request package has been received and discarded.
    • If there is no address information of this node in the routing request package, the node will record its information in the request package and then forward the routing request according to the local broadcast method until it reaches the target node.

2.2 Routing maintenance mechanism

When communicating, each intermediate node that sends a data packet is responsible for verifying whether the data packet can pass through the node to reach the next hop node [21,22].

Fig 1 shows the path from the source node A to the destination node D. Node A is responsible for verifying the link from A to B, node B confirms the link from B to C, and node C confirms the link from C to D. As can be seen from the figure above, the link D from node C to node is damaged, and the data packet cannot be passed to D through C.

Routing maintenance example: Node C cannot forward the packet of node A to the next hop of the route.
Fig 1
Routing maintenance example: Node C cannot forward the packet of node A to the next hop of the route.

The verification method can determine whether a link can carry out data transmission. In wireless networks, it is often possible to provide validation at no cost [23]. If a retransmission of a confirmation request has reached the maximum allowable number of retransmissions and no response is received, the sending node considers that the link to the next hop has been broken, removes the link from its routing memory, and returns to the source node with a routing error [24].

3 Related work

To reflect the contribution and value of the content of the work in this paper, we have carefully compared and analyzed it with other similar optimization methods and experimentally compared it with some of them.

In the literature [25], an MM-DSR routing protocol is proposed that collaborates with cross-layer algorithms to provide quality of service for multiple video sources on the network. The method defines two new parameters: the "Reliability Metric (RM)" and the "Movement Metric (MM)". By evaluating each path and selecting the best transmission path. However, this method is based only on the quality of service of the video source and does not guarantee its communication performance at high speed movements. In the literature [26], Vivek Sharma proposed the use of ANFIS (fuzzy inference system) to improve the DSR routing protocol for MANETs. The parameters of ANFIS system are calculated based on energy, hop count and delay to select the best routing information to ensure that the link can communicate. The paths filtered by this method, although optimal, do not take into account the speed of node movement. The network topology changes drastically when nodes move at high speeds, and more stable and reliable paths need to be selected for data transmission. In the literature [27], Hua yang proposed a DSR protocol based on continuous Hopfield neural network (CHNN-DSR) to improve the communication performance under high-speed movement of nodes. The method uses neural networks to optimize routing protocols as described in this paper to accommodate the high-speed movement of nodes, but its path selection is not the most reliable and its transmission links are susceptible to the high-speed movement of nodes, which leads to low communication quality. The literature [28] proposes a multi-intelligence based adaptive DSR (MA-DSR) protocol that optimizes the entire system through simple node-level management behaviors and incorporates factors such as signal strength into routing metrics in order to predict link disruptions before they occur. Based on this, the communication performance of the DSR protocol can be improved by updating the selection of the optimal path based on congestion measurements and energy levels of each node. The literature [29] proposes a priority-aware dynamic source routing protocol (PA-DSR), which implements a priority-aware mechanism by assigning priorities based on data rates and whose five different priorities correspond to five different connections, providing better communication compared to DSR protocols. Based on this, the communication performance of the DSR protocol can be improved by updating the selection of the optimal path based on congestion measurements and energy levels of each node. Both MA-DSR protocol and PA-DSR protocol are optimized in different aspects based on DSR protocol, but both do not consider the communication stability and reliability of the protocol when the nodes move at high speed, so the optimization method used in this paper aims to improve the communication reliability and stability when the nodes move at high speed, which has some advantages in highly dynamic networks.

We use reliability model and monitoring and repair mechanism to optimize the DSR protocol, aiming to improve the communication stability and reliability of the protocol under high-speed topology changes and provide some guarantee for UAV communication in complex environments.

4 Proposed work

In DSR protocol, the repair mode used by the original routing protocols is network-wide monitoring when a link is broken, which consumes a lot of energy and records a large number of useless route records, resulting in wasted buffers. The original routing protocol uses the shortest path, however, its reliability and stability cannot be guaranteed when the network topology changes rapidly. Therefore, the following improvements have been made to the DSR protocol.

4.1 Path reliability model

We assume the model of UAV Ad hoc network is G = (V, E), where V = {v1,v2,…,vn} is the set of nodes with valid routing information, and E = {e1,e2,…,en} is the path to the destination node. The transmission delay of the k path between the source node s and the destination node d is defined as the length of the path, whose size is half of the total delay recorded in the routing reply packet received by the source node, denoted as

alternatives l ( e k ) = 1 2 D ( s , d )
where D(s,d) is the cumulative transmission time required for the round-trip transmission from the source node to the destination node as recorded in the route forwarder.

Suppose the shortest delay from source node s to destination node d is called the shortest length, denoted as lmin(s,d);suppose the link from node i to node j is represented by (i, j);if lmin(j,d)lmin(i,d), this link is called the effective link. The shortest length to the destination node through link (i, j) is called the effective link length, denoted as

alternatives a l ( i , j ) = l ( i , j ) + l min ( j , d )
Suppose alternatives l ¯ i is the average length of all valid paths connected to node i, then the weight of effective link (i, j) is
alternatives W e ( i ) = exp [ k a l ( i , j ) l ¯ i ]
Where k is the correlation parameter, and the value is determined according to the number of downstream links connected to the node. Then, the weight of node i is the sum of the weights of the effective links connected to i node as
alternatives W n ( i ) = j W e ( i , j )
For any path ek, its path reliability is the product of the weights of all its links and all its nodes.
alternatives W e k = i = 1 n W e ( i ) j = s d W n ( j )
According to the formula, the greater the path weight, the more reliable the path will be.

4.2 Monitoring and repair mechanism

After the source node receives a route reply packet from the target node, it will select the appropriate path for data communication after retrieving and copying the information in the packet. While forwarding the packet, the neighbor nodes around the path monitor the path’s status information. Once a link of the path is broken, the node at the break point will look for whether a nearby neighboring node has a path to the destination node. If a path to the destination node exists, the node upstream of the link break is immediately notified and data is transmitted via the found path. If no valid route information to the destination node is found after the neighbor node, the source node is immediately notified to reselect the route to be transmitted or to restart the route search process.

The routing monitoring repair mechanism is divided into the following steps, which will be explained in detail through examples and flow charts.

    • At the time of data transmission, start the routing monitoring repair mechanism to monitor link status information.
    • If the link is detected to be disconnected, immediately look up the routing information of the surrounding nodes. If no link break is detected, the link is in a normal transmission state.
    • If an effective route is found, data transmission will continue along the route found immediately. Otherwise, the source node is notified to reselect the path or restart the route discovery process.

We illustrate the route monitoring repair mechanism with an example. Fig 2 shows the transmission path from node A to E. When transmitting from C to D, since the CD link is broken, the neighboring nodes detect this situation and immediately look for a valid path to the destination node E in the local cache. After the search, the path to the destination node is found at node H.Node H immediately notifies node C to continue the packet forwarding until the packet reaches the destination node E.

Example diagram of routing detection and repair.
Fig 2
Example diagram of routing detection and repair.

In order to explain the specific steps of this mechanism more vividly, we draw the process for further explanation. Fig 3 shows the specific steps for the repair strategy.

Flow chart of the monitoring repair mechanism.
Fig 3
Flow chart of the monitoring repair mechanism.

We summarize the reliability model and the specific operational steps of the link monitoring and repair mechanism, which are listed in Table 1. The table contains the specific calculation order and routing maintenance methods.

table-wrap
Table 1
Summary of overall algorithm.
Algorithm 1 summarizes the detailed steps of the proposed model and mechanism
1. Search for routing information to the destination node
2. Use the following steps to filter effective paths
3. Calculate the transmission delay for all paths l(ek)
4. Calculate the average transmission delay for all paths alternatives l i ¯
5. Calculate the weight of each node for all paths wn(i)
6. Calculate the weights of all paths alternatives w e k
7. Select the path with the maximum weight value path to transmit information
8. During data transmission, use the link monitoring and repair mechanism to detect the path information
9. If the path is broken, immediately repair the link through neighboring nodes
    If find valid routing information and immediately transmit through the path found
    Else notify the source node to reselect the path or restart the routing search mechanism
  Else normal data transmission
10. Data transmission completed

5 Experimental and simulation analysis

5.1 The simulation environment

In order to evaluate the communication performance of the protocol in complex environments, we designed a relatively large simulation area to meet the needs of UAV scenarios in various random environments. We set the number of simulation nodes to 50, and the communication range of each node is 250 meters, which is just enough to cover the simulation area and meet the communication needs of the nodes. On this basis, we set the speed of the nodes to be 10-100m/s, which is close to the flight speed of the actual UAV. Other specific simulation parameters are shown in Table 2.

table-wrap
Table 2
Simulation environment parameters table.
parameter numerical value
The size of scene/m 2000 × 2000
Communication radius/m 250
Packet types CBR
Packet size/Byte 512
Number of data streams 10
Type of antenna OmniAntenna
Wireless propagation model TwoRayGround
Channel type WirelessChannel
Number of nodes 50
Node maximum velocity/(m/s) 10–100
simulation time/s 100

5.2 Simulation analysis

5.2.1 Packet loss rate

During the movement of each node, packet loss condition occurs due to network topology changes or environmental factors. Packet loss ratio is the ratio of packets lost by a node to packets sent by a node.

Fig 4 shows the packet loss rate comparison of DSR, CHNN-DSR, MA-DSR, PA-DSR and DSR-PM protocols at speeds of 10-100m/s. Compared with the DSR protocol, the packet loss rates of all other protocols are reduced, with the DSR-PM protocol having the lowest packet loss rate. As can be seen from the figure, the packet loss rate of DSR protocol and other protocols exceeds 10% on average, however, the packet loss rate of DSR-PM protocol is less than 10%, and there is a lower number of packet loss for the same number of packets transmitted. Before performing data transmission, the reliability weight of each transmission path is calculated and the path with the highest reliability is selected for data transmission, which enhances the stability of the link, reduces the number of link breaks, and allows more valid data to be sent and improves the data transmission efficiency. During data transmission, we employ a link detection mechanism to repair broken links and resume communication in a timely manner, providing a guarantee for effective data transmission.

Packet loss rate comparison diagram.
Fig 4
Packet loss rate comparison diagram.

5.2.2 Network overhead

During network transmission, some redundant data are inevitably added to the signal and the data format needs to be changed, which are necessary for transmission, and the proportion of these redundant data in the data source is called overhead.

Fig 5 shows a comparison graph of the overhead of DSR, CHNN-DSR, MA-DSR, PA-DSR and DSR-PM protocols for speeds of 10–100 m/s. The overhead curves of DSR, CHNN-DSR and RE-DSR protocols are shown in Fig 5. When the speed is lower than 60 m/s, the overhead of DSR and other protocols is relatively large, while DSR-PM protocol has a lower overhead. When the speed is greater than 60m/s, the network overhead of all protocols increases sharply as the speed increases, but the routing overhead of DSR-PM protocol increases at a slower and lower rate compared to the other protocols. The higher the speed, the more drastic the network topology changes. The optimization method we use can effectively reduce the overhead of protocols moving at high speed, reduce the waste of resources while transmitting the same amount of data, and improve the transmission performance of the protocols.

Overhead comparison diagram.
Fig 5
Overhead comparison diagram.

5.2.3 Throughput

It is necessary to evaluate the data throughput of the UAV in high-speed flight. The throughput is the total size of the data received from the starting point to the end node. To improve the high-speed communication performance of UAVs, it is important to establish a reliable and stable link to increase their throughput.

Fig 6 shows the throughput histograms of DSR, CHNN-DSR, MA-DSR, PA-DSR, and DSR-PM protocols. Both DSR and the other improved DSR protocols show significant improvements when the speed is below 50m/s, with the DSR-PM protocol taking the lead in throughput. As the speed increases, when the speed is greater than 50m/s, the network topology changes rapidly, resulting in an unstable transmission link, and its throughput gradually decreases, but the throughput of DSR-PM protocol still outperforms the other protocols. With the rapid flight of UAVs, the link state will become very unstable and the link throughput will be reduced accordingly. We adopt the link reliability model to improve the stability of the link and the corresponding link repair mechanism to extend the survival time of the link, the link can maintain a longer effective transmission time, and thus its throughput will increase accordingly.

Throughput comparison diagram.
Fig 6
Throughput comparison diagram.

5.2.4 End-to-end delay

End-to-end delay is an important factor in mobile self-organizing networks and refers to the transmission time from the source node to the target node.

Fig 7 shows the graphs of transmission delays for DSR, CHNN-DSR, MA-DSR, PA-DSR and DSR-PM protocols at speeds of 10-100m/s. It can be seen from the graph that the delay jitter is relatively sharp for all protocols, and although the DSR-PM protocol has a lower delay than the other protocols, there is still delay jitter. Nodes moving too fast can cause frequent interruptions in the established links, which leads to transmission delay jitter. Therefore, the improved method in this paper can quickly repair broken links, thus reducing the number of returns to the source node for re-path selection and reducing the transmission delay of data. Compared with returning to the source node for path rescreening, timely repair of broken links through intermediate nodes enables faster recovery of data transmission.

Delay comparison diagram.
Fig 7
Delay comparison diagram.

6 Conclusion and prospect

In this paper, we propose two methods to optimize the DSR routing protocol to improve the reliability and stability of this routing protocol. First, we propose a reliability model to select the most reliable route to ensure reliable communication between UAVs. Secondly, we propose a link monitoring and repair mechanism. During data transmission, broken links can be repaired by neighboring nodes in time to ensure effective data transmission. Finally, it can be concluded from the simulation experiments that the DSR-PM protocol proposed in this paper effectively improves the performance parameters such as throughput, network overhead, packet loss rate and delay of routing protocols with better transmission performance compared to DSR protocol and other improved DSR protocols.

In future work, it is very necessary to continuously optimize the protocol to ensure more stable communication performance of UAVs in high-speed motion.

References

Yu L , Wu J , Zhou A , et al . Massively Distributed Antenna Systems With Nonideal Optical Fiber Fronthauls: A Promising Technology for 6G Wireless Communication Systems[J]. IEEE Vehicular Technology Magazine, 2020, 15(4): 4351. doi: 10.1109/MVT.2020.3018100

Dang S , Amin O , Shihada B , et al . What should 6G be? [J]. Nature Electronics, 2020, 3(1): 2029. doi: 10.1038/s41928-019-0355-6.

Han S , Liu X , Huang H , et al . Research on energy-efficient routing algorithm based on SWIPT in multi-hop clustered WSN for 5G system[J]. EURASIP Journal on Wireless Communications and Networking, 2021, 2021(1): 126. doi: 10.1186/s13638-021-01931-5.

Barakabitze A A , Ahmad A , Mijumbi R , et al . 5G network slicing using SDN and NFV: A survey of taxonomy, architectures and future challenges[J]. Computer Networks, 2020, 167: 106984. doi: 10.1016/j.comnet.2019.106984.

Arora B , Nipur. An Adaptive Transmission Power Aware Multipath Routing Protocol for Mobile Ad hoc Networks[J]. Procedia Computer Science, 2015, 57:12421248. doi: 10.1016/j.procs.2015.07.424.

Preetha K G , Unnikrishnan A . Improving the Routing Performance of Mobile Ad hoc Networks Using Domination Set[J]. Procedia Computer Science, 2015, 46: 12091215. doi: 10.1016/j.procs.2015.01.035.

Upadhyay R ,  Bhatt U R and Tripathi H . DDOS Attack Aware DSR Routing Protocol in WSN[J]. Procedia Computer Science, 2016, 78: 6874. doi: 10.1016/j.procs.2016.02.012.

Leung R, Liu J, Poon E, et al. MP-DSR: a QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks[C]//Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks. IEEE, Tampa, FL, USA, 2001: 132–141. doi: 10.1109/LCN.2001.990778

Thillaikarasi R , Bhanu S M S . An Efficient DSR Protocol to Detect Blackhole Attacks in WMN Using Cross Layer Approach[J]. Wireless Personal Communications, 2017, 95(3): 34773492. doi: 10.1007/s11277-017-4008-7.

10 

Mohammadi P , Ghaffari A . Defending Against Flooding Attacks in Mobile Ad-Hoc Networks Based on Statistical Analysis[J]. Wireless Personal Communications, 2019, 106(2): 365376. doi: 10.1007/s11277-019-06166-8.

11 

Mandhare V V , Manthalkar R R , Thool V R . Novel Approach for Cache Update on Multipath DSR Protocol in MANET for QoS Support[J]. Wireless Personal Communications, 2018, 98(1): 505519. doi: 10.1007/s11277-019-06166-8.

12 

Moghaddam S S , Taheri H , Karimi A . Trust Based Routing Algorithm to Improve Quality of Service in DSR Protocol[J]. Wireless Personal Communications, 2019, 109(1): 116. doi: 10.1007/s11277-019-06546-0.

13 

Kojima H , Yanai N , Cruz J P . ISDSR plus: Improving the Security and Availability of Secure Routing Protocol[J]. IEEE ACCESS, 2019, 7: 7484974868. doi: 10.1109/ACCESS.2019.2916318

14 

Mythili V , Suresh A . SEAT-DSR: Spatial and energy aware trusted dynamic distance source routing algorithm for secure data communications in wireless sensor networks[J].Cognitive Systems Research, 2019, 58: 143155. doi: 10.1016/j.cogsys.2019.02.005.

15 

Ali H A , Areed M F , Elewely D I . An on-demand power and load-aware multi-path node-disjoint source routing scheme implementation using NS-2 for mobile ad-hoc networks[J]. Simulation Modelling Practice and Theory, 2018, 80: 5065. doi: 10.1016/j.simpat.2017.09.005.

16 

Bujari A , Palazzi C E , Ronzani D . A Comparison of Stateless Position-based Packet Routing Algorithms for FANETs[J]. IEEE Transactions on Mobile Computing, 2018, 17(11): 24682482. doi: 10.1109/TMC.2018.2811490

17 

Carolina D V S , Carlos M P , Aldaya I , et al . New Detection Paradigms to Improve Wireless Sensor Network Performance under Jamming Attacks[J]. Sensors, 2019, 19(11): 2489. doi: 10.3390/s19112489.

18 

Tilwari V , Dimyati K , Hindia M H D , et al . Mobility, residual energy, and link quality aware multipath routing in MANETs with Q-learning algorithm[J]. Applied Sciences, 2019, 9(8): 1582. doi: 10.3390/app9081582.

19 

Hong J , Zhang D H . TARCS: A Topology Change Aware-Based Routing Protocol Choosing Scheme of FANETs[J]. Electronics, 2019, 8(3): 274293. doi: 10.3390/electronics8030274.

20 

Choi H H , Lee J R . Local Flooding-Based on-Demand Routing Protocol for Mobile Ad Hoc Networks[J]. IEEE Access, 2019, 7: 8593785948. doi: 10.1109/ACCESS.2019.2923837

21 

Sivaram M , Porkodi V , Mohammed A S , et al . Retransmission DBTMA Protocol With Fast Retransmission Strategy to Improve the Performance of MANETs[J]. IEEE Access, 2019, 7:8509885109. doi: 10.1109/ACCESS.2019.2918723

22 

Lenin G D , Esteve P S , et al . A novel dynamic reputation-based source routing protocol for mobile ad hoc networks[J]. EURASIP Journal on Wireless Communications and Networking, 2019, 1:116. doi: 10.1186/s13638-019-1375-7.

23 

Yimin Z , Song X , Hong H G , et al . A Constrained Coding-Aware Routing Scheme in Wireless Ad-Hoc Networks[J]. 2019, 19(10): 2252. doi: 10.3390/s19102252.

24 

Annan Y , Bo L , Zhong J Y , Mao Y . A Bi-Directional Carrier Sense Collision Avoidance Neighbor Discovery Algorithm in Directional Wireless Ad Hoc Sensor Networks[J]. Sensors, 2019, 19(9): 2120. doi: 10.3390/s19092120.

25 

Frias V C , Delgado G D , Ayala A Z , et al . MM-DSR: Multipath QoS routing for multiple multimedia sources over Ad Hoc mobile networks[J]. IEEE Latin America Transactions, 2007, 5(6): 448456. doi: 10.1109/TLA.2007.4395234

26 

Sharma V, Alam B, Doja M N. An improvement in DSR routing protocol of MANETs using ANFIS[M]. Applications of Artificial Intelligence Techniques in Engineering, 2019.

27 

Yang H , Liu Z . An optimization routing protocol for FANETs[J]. EURASIP Journal on Wireless Communications and Networking, 2019, 2019(1): 18. doi: 10.1186/s13638-019-1442-0.

28 

Preetha K G , Unnikrishnan A . Enhanced domination set based routing in mobile ad hoc networks with reliable nodes[J]. Computers & Electrical Engineering, 2017, 64: 595604. doi: 10.1016/j.compeleceng.2017.04.028.

29 

Arafat M Y , Moh S . A Survey on Cluster-Based Routing Protocols for Unmanned Aerial Vehicle Networks[J], IEEE Access, 2018, 7: 498516. doi: 10.1109/ACCESS.2018.2885539
https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
https://www.researchpad.co/tools/openurl?pubtype=article&doi=10.1371/journal.pone.0251548&title=A dynamic source routing protocol based on path reliability and link monitoring repair&author=&keyword=&subject=Research Article,Engineering and Technology,Telecommunications,Social Sciences,Sociology,Communications,Research and Analysis Methods,Simulation and Modeling,Physical Sciences,Astronomical Sciences,Celestial Objects,Black Holes,Computer and Information Sciences,Network Analysis,Signaling Networks,Wireless Sensor Networks,Computer and Information Sciences,Neural Networks,Biology and Life Sciences,Neuroscience,Neural Networks,Earth Sciences,Natural Disasters,Computer and Information Sciences,Software Engineering,Computer Software,Engineering and Technology,Software Engineering,Computer Software,