Premium
Perfect match model‐based link assignment to design topology for satellite constellation system
Author(s) -
Liu Zhe,
Guo Wei,
Deng Changlin,
Hu Weisheng,
Zhao Yanbin
Publication year - 2015
Publication title -
international journal of satellite communications and networking
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.388
H-Index - 39
eISSN - 1542-0981
pISSN - 1542-0973
DOI - 10.1002/sat.1117
Subject(s) - computer science , link (geometry) , satellite constellation , constellation , satellite , topology (electrical circuits) , bipartite graph , matching (statistics) , node (physics) , bandwidth (computing) , greedy algorithm , graph , computer network , algorithm , theoretical computer science , mathematics , physics , astronomy , statistics , combinatorics , quantum mechanics
Summary In satellite constellation network, the satellites visible from one satellite are more than communication terminals (CTs) equipped. Each inter‐satellite link (ISL) would occupy one CT on each of two satellites connected by this ISL. Therefore, a fundamental problem considering link assignment is how to assign limited CTs for each satellite to establish ISLs with its visible satellites. Link assignment scheme based on perfect match model (LAS‐PMM) is proposed to make full use of huge bandwidth provided by CT. In LAS‐PMM, the problem of assigning all the CTs of each satellite to establish ISLs is modeled as a perfect matching problem, where a perfect matching is searched over a mixed complete bipartite graph. Simulation results show that LAS‐PMM is better than the regular and greedy LASs, in terms of CT utilization and average node‐to‐node distance. Copyright © 2015 John Wiley & Sons, Ltd.