Analysis of Planes’ Connectivity Probability In AANET

摘要

As the connectivity problem is one of the most fundamental issues ofrnaeronautical ad hoc networks (AANET), we work out the probability that arnplane can connect to a base station under an arbitrary AANET with multiplernflight tracks in this paper. First, a model for the AANET is given, whichrntakes the minimum safe distance between two adjacent planes in a samerntrack into account. Then, we find all the valid paths between a plane and arnbase station. Each path has an existing probability in our model and wernwork out the probability that at least one path exists through probabilityrntheory. At last, two random scenarios are generated to verify the correctnessrnof our work and some future works for AANET based on our model are alsornintroduced.