Link availability estimation based reliable routing for aeronautical ad hoc networks
Introduction
Recently, there has been a clear trend towards the application of the ad hoc networking technology [1] in the civil aviation communication system, and then a novel research field of aeronautical ad hoc networks (AANET) [2], [3], [4], [5] has arisen. AANET has recently gained significant attention, as it can set up a mobile ad hoc network among the free flight airliners, and thus provide a multi-hop communication link among the airliners and the ground base nodes. Therefore, the airliners which are far away from the ground base node can access the Internet with a multi-hop fashion. Through this way, the passengers can access the Internet with low latency and cheap charges.
As the airliners move at a very high speed in AANET, typically 700 km/h to 1000 km/h [6], the network topology will change frequently and unpredictably. Consequently, the multi-hop communication links will be broken frequently, thus decreasing the performance of AANET. Therefore, in order to improve the performance of AANET, one crucial challenge is to develop effective routing schemes which can select reliable paths that last as long as possible. Most of the existing routing schemes [7], [8], [9], [10], [11], [12] are based on the idea of shortest paths, such as Ad-hoc On-demand Distance Vector (AODV) routing [7] and Dynamic Source Routing (DSR) [8]. That is, they use the number of hops in routes as the path selection metric. However, as the nodes in AANET move frequently, the shortest path may be broken immediately after it has been established. In such a case, rediscovering routes will induce high message overheads. Therefore, the shortest path-based routing schemes are inapplicable to AANET.
In order to select more reliable paths, there have been considerable attempts to present algorithms [13], [14], [15], [16], [17], [18], [19] to choose the optimal set of routes. Sakhaee et al. [6] proposed clustering and routing schemes to obtain stable and optimal routes for AANET. They took into account the relative velocity of nodes and the link duration of paths dynamically, and then chose the optimal routes through calculating the Doppler frequency shift. Gu et al. [13] also estimated the relative velocity between arbitrary two mobile nodes with Doppler frequency shift. Then they integrated the relative velocity and expected queuing delay as the route selection metric. Lee et al. [15] considered traffic load of nodes which can lead to network congestion and create bottlenecks as the main path selection metric. Cheng et al. [17] suggest discovering long lifetime routes algorithm to improve the performance of transport layer protocols. Senthilkumar and Somasundaram [18] took power constraint along with QoS constraints into consideration, and then predicted the stability of Link Expiry Time (LET) to select multiple optimal paths. Li et al. [19] propose a scoped flooding and mobility prediction based RGR protocol. This protocol takes advantage of the location information, speed, direction and timestamp of nodes to assess the real-time status of the next hop node. So the nodes have the ability to decide whether to send data packets through the reactive route or switch to GGF immediately. Simulation results have validated the effectiveness of these routing schemes by comparing with the traditional shortest path-based routing protocols. However, these schemes fail to provide a universal analytical model to mimic the mobile trace of the nodes in AANET. In particular, the Doppler frequency shift method does not take into account the actual mobile trace of the mobile nodes.
In order to address the above problems, considerable efforts [20], [21], [22], [23], [24], [25], [26], [27] have been paid to model the smooth movement of mobile nodes and then calculate the link lifetime between arbitrary two mobile nodes. The Random Waypoint (RWP) model [20] was a significant work to estimate the unpredictable movements of the nodes in mobile ad hoc networks. However, Yoon et al. [21], Bettstetter et al. [22], and Blough et al. [23] pointed out the defects of the RWP model respectively. Yoon presented that the speed of nodes in RWP model continuously decreases as the simulation progresses, while the next two works showed that RWP model has non-uniform spatial node distribution at steady state, and thus the closed-form expression of this distribution could not be obtained. Therefore, further and deep analytical studies of this model have not been done. In addition to the above defects, the random mobility models may have unrealistic move behaviors, such as sudden stop, sudden acceleration, and sudden sharp turn, etc. These behaviors are not in accordance with the physical law of motion.
To address the unrealistic move behaviors, Li et al. [24] propose a Markov swarm mobility model for modeling time-dependent changes in the network topology induced by coordinated movements of mobile nodes in mobile ad hoc networks. The network topology of a mobile ad hoc network can be controlled through adjustment of the collaboration degree. Liang and Haas [25] have proposed a Gauss-Markov (GM) mobility model. In this model, the future location of a mobile node is predicted by the probability density function of its current location. The probability density function is calculated by the Gauss-Markov model. Zhao et al. [26], [27] also proposed a novel Semi-Markov Smooth (SMS) model to accurately mimic the behavior of the mobile nodes that allow the physical law of smooth motion. In this model, there are four major movement phases for the mobile nodes, i.e., speed up phase, middle smooth phase, slow down phase, and pause phase, respectively. Based on this model, Wang et al. [28] and Nayebi and Sarbazi-Azad [29] studied the link lifetime among the mobile nodes. This work has motivated and guided research efforts on analyzing the link availability for routing metrics in mobile ad hoc networks.
On the basis of the link lifetime estimation, some works [30], [31], [32], [33] adopted the predicted link availability as routing metric to develop reliable routing schemes. Here, link availability means the probability that a link will be continuously available from time t0 to time (t0 + t). This metric can be used by a node to select more reliable neighbors to form a more stable route than the shortest path metric. In [30], Han et al. employed a probabilistic and statistical computing method to evaluate the link availability among the mobile nodes. This work was based on the random walk mobility model [34]. Afterwards, they developed a link availability prediction-based reliable routing protocol for mobile ad hoc networks. In addition, Jiang et al. [31], [32], [33] also proposed a novel routing protocol based on a reasonable estimation of the link availability.
Although a number of simulation results have validated the effectiveness of the above link availability prediction schemes and routing schemes, there still exist several critical limitations. First of all, all these link availability prediction schemes were designed for modeling the nodes mobility in mobile ad hoc networks where the nodes move at a very slow speed. Therefore, these schemes cannot be applied to accurately model the mobile behavior of the nodes in high speed AANET. Secondly, most of these works only considered four major movement phases for the mobile nodes. However, these phases cannot accurately model the behavior of the mobile nodes in AANET.
In this paper, we primarily introduce a novel Semi-Markov Smooth model to mimic the behavior of mobile nodes in AANET. This model can accurately reflect the mobile trace of the airliners in the sky. Then, we present a mathematical model to analyze the link lifetime. The accuracy of the proposed model is evaluated through simulations. Afterwards, we present a mathematical method to estimate the probability that a link being continuously available for a given time duration. This probability is referred to as the link availability. And we utilize the link availability as the path selection metric to design reliable routing protocol for improving the performance of AANET. Finally, we validate the effectiveness of our routing protocol by comparing the simulation results with the AODV protocol.
In this paper, we present a link availability estimation based reliable routing protocol to improve the performance of AANET. Generally speaking, the major contributions of our work lie in three folds. First, we propose a novel Semi-Markov Smooth mobility model to mimic the behavior of the airliners in the sky. Then we derive the probability density function of the relative speed of two nodes and the expectation of the link lifetime through probabilistic analysis. The accuracy of our model and analysis are validated by comparing the analytical results with that obtained by means of simulations. Finally, we define the link availability factor and use it as the path selection metric to design a reliable routing protocol for AANET.
The remainder of the paper is organized as follows. Section 2 presents the probabilistic analysis of the relative speed and the link lifetime on the basis of the Semi-Markov Smooth mobility model, and defines the link availability factor. The proposed link availability estimation based routing protocol and the discussions on the simulation results are detailed in Section 3. Finally, we conclude this paper in Section 4.
Section snippets
Link availability estimation
In this section, we first propose a Semi-Markov Smooth mobility model for AANET, and then derive the probability density function of the relative speed and the expectation of the link lifetime. We validate our theoretical analysis by simulations. Finally, we define the link availability factor between any two neighboring nodes.
Link availability estimation based routing protocol
In this section, we present a novel link availability estimation based routing (LEBR) protocol for AANET, which takes into account the link availability factor in route selection and update. We further show by simulation results that LEBR gains better performance in comparison with the traditional AODV routing strategy.
Conclusions
The importance of link availability estimation lies in addressing the route breakage problem induced by the unpredicted and frequent network topology changes in AANET. In this work, we developed a link availability estimation based reliable routing protocol to improve the performance of AANET. We first propose a Semi-Markov Smooth mobility model to mimic the behavior of the airliners in the sky. Then we derive the probability density function of the relative speed and the expectation of the
Acknowledgement
This work is supported in part by National Natural Science Foundation of China (No. 61100195, 61301102).
Lei Lei received the Bachelor Degree in electronic and information technology from Northwestern Polytechnical University in 2002, and the Ph.D. degree in communication and information system from Nanjing University of Aeronautics and Astronautics in 2008. Now, he is an associate professor in the College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics. His current research interests are in ad hoc networks and cooperative communications.
References (35)
- et al.
Flying ad-hoc networks (FANETs): a survey
Ad Hoc Netw.
(2013) - et al.
Optimised relay selection for route discovery in reactive routing
Ad Hoc Netw.
(2013) - et al.
Discovering long lifetime routes in mobile ad hoc networks
Ad Hoc Netw.
(2008) - et al.
Improving routing in networks of UAVs via scoped flooding and mobility prediction
in: Wireless Days (WD), 2012 IFIP
(2012) - et al.
Swarm mobility and its impact on performance of routing protocols in MANETs
Comput. Commun.
(2012) - et al.
Analysis of link lifetime in wireless mobile networks
Ad Hoc Netw.
(2012) - et al.
Energy-Spectrum Efficiency Tradeoff for Video Streaming over Mobile Ad Hoc Networks
IEEE J. Select. Areas Commun.
(2013) - et al.
Aeronautical Mobile Ad Hoc Networks
in: 14th European Wireless Conference, 2008. EW 2008
(2008) - W. Yufeng, M.C. Erturk, H. Arslan, R. Sankar, R. In-ho, S. Morgera, Throughput and delay analysis in Aeronautical Data...
- et al.
Analysis of connectivity requirement for aeronautical ad hoc networks
Int. Conf. Electron. Mech. Eng. Inform. Technol. (EMEIT)
(2011)
The global in-flight Internet
IEEE J. Select. Areas Commun.
An efficient on-demand routing approach with directional flooding for wireless mesh networks
J. Commun. Netw.
Trust-based on-demand multipath routing in mobile ad hoc networks
IET Inf. Security
A deadlock-free dynamic reconfiguration scheme for source routing networks using close up∗/down∗ graphs
IEEE Trans. Parallel Distrib. Syst.
Cited by (33)
Drone assisted Flying Ad-Hoc Networks: Mobility and Service oriented modeling using Neuro-fuzzy
2020, Ad Hoc NetworksCitation Excerpt :This technique minimizes computational cost, energy consumption, but does not improve link stability. Link availability estimation-based routing has been proposed while utilizing the link availability parameter for the selection and updates of a route [27]. Firstly, semi- Markov mobility model has been presented to imitate the behavior of airliners, then link availability period, pdf of relative speed between two aircrafts and expected link lifetime have been used to select the reliable route.
MAC protocols for unmanned aerial vehicle ecosystems: Review and challenges
2020, Computer CommunicationsCitation Excerpt :A network is meant to be highly reliable, as it is all-time prone to various network attacks. These attacks can obstruct the functioning and confidentiality of data in UAVs [68]. In past, few incidents were reported such as data link spoofing, DoS attacks like Ping of Death, SYN Flood.
Research on aviation ad hoc network routing protocols in highly dynamic and complex scenarios
2024, Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian UniversityUnmanned-Aerial-Vehicle-Assisted Wireless Networks: Advancements, Challenges, and Solutions
2023, IEEE Internet of Things JournalTailoring Routing Protocols for Flying Ad Hoc Networks: Challenges and Possible Countermeasures
2023, Proceedings - 2023 28th Asia Pacific Conference on Communications, APCC 2023A Dynamic and Local Perspective: A Reliable Q-Routing Protocol based on Fuzzy Logic for FANETs
2023, 2023 IEEE/CIC International Conference on Communications in China, ICCC 2023
Lei Lei received the Bachelor Degree in electronic and information technology from Northwestern Polytechnical University in 2002, and the Ph.D. degree in communication and information system from Nanjing University of Aeronautics and Astronautics in 2008. Now, he is an associate professor in the College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics. His current research interests are in ad hoc networks and cooperative communications.
Dan Wang received the bachelor degree in electronic and information engineering from the Nanchang Institute of Technology in July 2013. He is currently working toward his master degree at the College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics. His research interests are in the area of wireless ad hoc networks.
Liang Zhou received his Ph.D. degree major at Electronic Engineering both from Ecole Normale Supérieure (E.N.S.), Cachan, France and Shanghai Jiao Tong University, Shanghai, China in March 2009. From 2009 to 2010, he was a postdoctoral researcher in ENSTA-ParisTech, Paris, France. From 2010 to 2011, he was a Humboldt Research Fellow in Technical University of Munich, Munich, Germany. Now, he joins in Nanjing University of Posts and Telecommunications, Nanjing, China. His research interests are in the area of multimedia communications and signal processing.
Xiaoming Chen received his B.Sc. degree from Hohai University in 2005, M.Sc. degree from Nanjing University of Science and Technology in 2007, and Ph.D. degree from Zhejiang University in 2011, respectively, all in electronic engineering. He is now with the College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China. His research interests mainly focus on rateless coding, network MIMO, cognitive radio and network coding, etc.
Shengsuo Cai was born in Shandong province, China, in 1988. He is now an undergraduate majoring in Electronic Information Science and Technology, and will receive his diploma in July, 2011. He has been accepted as a candidate for the master’s degree in the College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics. His research interest is TDMA scheduling in ad hoc networks.