z-logo
Premium
Nodal distance distributions in cluster flight spacecraft network
Author(s) -
Mo Jinrong,
Hu Shengbo,
Shi Yanfeng,
Song Xiaowei,
Yan Tingting
Publication year - 2020
Publication title -
mathematical methods in the applied sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.719
H-Index - 65
eISSN - 1099-1476
pISSN - 0170-4214
DOI - 10.1002/mma.6672
Subject(s) - spacecraft , topology (electrical circuits) , probability density function , mathematics , probabilistic logic , range (aeronautics) , connection (principal bundle) , cluster (spacecraft) , computer science , aerospace engineering , geometry , statistics , engineering , combinatorics , programming language
The high‐speed flight of cluster flight spacecraft modules increases the uncertainty of network topology. In order to better design the orbital of the cluster flight spacecraft and improve the performance of cluster flight spacecraft network (CFSN), this paper studies the nodal distance distributions (NDDs). First, based on twin‐satellites mode, the mobility model of nodes is established. And then by adopting empirical statistical method and curve fitting method, the solution of the nodal distance density function in the CFSN is obtained. Second, the probability density function is applied to the model distance‐dependent path loss, and the probability density of path loss under the model is analyzed. Finally, the distributions of maximum and minimum distance among multiple nodes and the threshold range of nodal connection distance are derived, and the probabilistic connectivity matrix of any time slot in the orbital hyper‐period and spatial–temporal evolution graphs under different thresholds is obtained. The analytical results verify the feasibility of the model and the approximate solution of the NDDs in this paper. This method also provides a theoretical reference for the nodal connection in irregular wireless networks.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here