检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]天津工业大学计算机技术与自动化学院,天津300160 [2]北京大学信息科学技术学院,北京100871 [3]东北大学网络与通信中心,辽宁沈阳110004
出 处:《小型微型计算机系统》2006年第4期577-581,共5页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(69973011)资助;国家"八六三"项目(863-708-4-5)资助
摘 要:国内外现有的LEO、MEO卫星网络星间链路图都以纯图形的表示方法给出,在卫星网络系统路由选择、系统性能分析及管理的研究中发现,图形化的表示方法难以满足分析问题的需要,尤其是当卫星数量增加和多高度卫星星座联合组网时,图形杂乱难以辨认.针对上述问题提出用抽象的图表示卫星星间链路的思想;提出了星间链路图抽象表示的原则;提出了卫星星间链路图两种新的表示方法,其一是基于极点扩张的星间链路图表示方法,其二是基于卫星轨道特征的星间链路图表示方法,并用C++设计了实现这两种表示方法的软件.软件运行结果表明,卫星星间链路图两种新的表示方法切实可行、具有应用价值.The existing LEO,MEO intersatellite links map at home and abroad is given by the representation method of pure graph. We found from the routing of satellite network system,performance analysis of system and management research that the representation method having graphic feature is difficult to satisfy the requirement of analyzing problems ,especially graphics are difficult to distinguish due to their disorder when the quantity of satellites increase and satellite constellation with multiple height combine-building network. In view of the above problem,an idea of representing intersatellite links by applying abstract map was proposed,and the principle of abstractedly representing intersatellite links map was put forward in this paper. Two new representation methods for satellite intersatellite links map were proposed, one of which was the representation method of intersatellite links map on the basis of polar expansion and another one was based on the features of satellite orbit, and a software for implementing these two representation methods was designed by using C + +. Operational results of the software showed that two kinds of new representation methods for satellite intersatellite links map were practical and had applicable value.
分 类 号:TP333.4[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.188