On Connectivity of Flying Ad Hoc Networks in the Presence of Ground Terminal

The Unmanned Aerial Vehicle(UAV)technologies are envisioned to play an important role in the era of Air-Space-Ground integrated networks.In this paper,we investigate the connectivity of a Flying Ad hoc Network(FANET)in the presence of a groundbased terminal.In particular,the connected probability of the UAV-to-UAV (U2U) link as well as that of the UAV-to-Ground (U2G) link in a three dimensional (3D) space are analyzed.Furthermore,to mitigate the aggregate interference from UAV individuals,a priority based power control scheme is implemented for enhancing the connectivity of both U2U and U2G links.Numerical results illustrate the effectiveness of the proposed analysis.

Pattern dynamics and bifurcation in delayed SIR network with diffusion network

The spread of infectious diseases often presents the emergent properties,which leads to more dificulties in prevention and treatment.In this paper,the SIR model with both delay and network is investigated to show the emergent properties of the infectious diseases'spread.The stability of the SIR model with a delay and two delay is analyzed to illustrate the effect of delay on the periodic outbreak of the epidemic.Then the stability conditions of Hopf bifurcation are derived by using central manifold to obtain the direction of bifurcation,which is vital for the generation of emergent behavior.Also,numerical simulation shows that the connection probability can affect the types of the spatio-temporal patterns,further induces the emergent properties.Finally,the emergent properties of COVID-19 are explained by the above results.

Research of the multi-way connectivity probability for platoon-based vehicle-to-infrastructure communication network

Vehicles travelling as platoons can reduce the huge traffic jams on the highway. Platoon members can share vehicle information such as speed and acceleration via vehicular ad hoc networks （VANETs） communication to maintain a constant inter-vehicle and inter-platoon distances. However, connectivity is a fundamental measurement to indicate the linking quality of VANETs. This paper analyzes the access and connectivity probability between the vehicles and the road side units （RSUs） of the multi-way platoon-based VANETs with roadside infrastructure. We denote the connectivity probability as the probability that the vehicles on the highway can access to at least one RSU besides the road within a designated number of hops. Moreover, besides considering the connection on the same road, we study the connection between the vehicles and the RSU via vehicles on the nearby neighbor roads. The analytical results have been validated by simulations and results show that the connectivity probability can be improved when there are platoons in a network. Meanwhile, the connectivity probability is higher in the multi-way vehicle-to-infrastructure （V2I） communication network than that in a one-way V2I communication network. The results in this paper can help to reduce the jams on the highway and achieve intelligent driving. Then the safety and comfort of the drivers and passengers on the highway can be improved. Moreover, these results can provide forceful theoretical support to the future intelligent transportation system （ITS） design.

Connectivity in finite ad-hoc networks

Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distributed in a closed interval [0, Z]（z ∈ R^＋）, we derive a generic formula for the probability that the network is connected. The finite connected ad-hoc networks is analyzed. And we separately suggest necessary conditions to make the ad-hoc network to be connected in one and two dimensional cases, facing possible failed nodes （f-nodes）. Based on the necessary condition and unit-disk assumption for the node transmission, we prove that the nodes of the connected two-dimensional ad-hoc networks （G2） can be divided into at most five different groups. For an f-node no in either of the five groups, we derive a close formula for the probability that there is at least one route between a pair of nodes in G2 -- {no}.