星间网络拓扑的二分图及其关联矩阵表示法  

A Method Representing Inter-satellite Network Topology with Bipartite Graph and Its Incidence Matrix

作　　者：何善宝[1] 李振东[1] 刘崇华[1] 

机构地区：[1]北京空间飞行器总体设计部,北京100094

出　　处：《航天器工程》2009年第4期25-29,共5页Spacecraft Engineering

摘　　要：星间网络拓扑是建立星间链路首要考虑的问题,以往文献中描述星间网络拓扑一般都用直观图形的表示方法,即以卫星作为节点、链路作为边画出的图形。但是这种直观图形表示法,当卫星数量增加时,图形庞大而杂乱难以辨认,同时无法满足分析问题的需要。为此,文章提出了一种利用图论中的二分图及其对应的关联矩阵描述星间网络拓扑的方法,此方法具有图形描述简单明了、关联矩阵描述便于仿真分析的特点。Inter-satellite network topology must be studied before inter-satellite links are built. Traditional graphs, in which satellites are vertices and links are edges, are used to describe network topology in former references. But this kind of graph is too huge and complex to make out if there are more satellites in a constellation. And some problems about inter-satellite links cannot be analyzed with traditional graphs. A novel method representing inter-satellite network topology, which adopts bipartite graph and its incidence matrix in graph theory, is presented in this paper. The method is simple and comprehensible. And it is convenient for simulation and analysis.

关 键 词：卫星 星间链路 网络拓扑 二分图 关联矩阵 

分 类 号：TN927[电子电信—通信与信息系统]