• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Aerospace science and technology >Topology control in self-organized optical satellite networks based on minimum weight spanning tree
【24h】

Topology control in self-organized optical satellite networks based on minimum weight spanning tree

机译：基于最小权重生成树的自组织光学卫星网络的拓扑控制

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we first propose a distributed minimum spanning tree (DMST) algorithm for optical satellite networks (OSNs). The OSNs are characterized by high dynamic topology, long-distance beam, directional links and supported up to several Gbps data rates. In addition, each satellite node has limited optical transceivers. The problem of constructing a minimum weight spanning tree (MST) in a network is NP-hard due to the transceiver limitation. What makes this problem more challenging is the requirement to deploy the network topology in a distributed scenario, since each node can have only direct information of its neighbors. A fully distributed approximation algorithm is developed, which constructs a spanning tree with approximate minimum average edge weight. We prove that the proposed algorithm can definitely produce a feasible solution. And then, based on the MST constructed by proposed algorithm, we also develop a connectivity guarantee (CG) algorithm to construct a robust topology. The CG algorithm can guarantee the requirement of number of incident links to each node, in order to postpone the performance degradation when a topology variation is taking place. Simulation results show that, compared with existing technologies, the proposed algorithms can achieve better performance with low computational complexity. (C) 2017 Elsevier Masson SAS. All rights reserved.
机译：在本文中，我们首先提出了一种用于光卫星网络（OSN）的分布式最小生成树（DMST）算法。 OSN具有高动态拓扑，长距离波束，定向链路的特点，并支持高达几Gbps的数据速率。另外，每个卫星节点具有有限的光收发器。由于收发器的限制，在网络中构造最小权重生成树（MST）的问题非常困难。使这个问题更具挑战性的是，要求在分布式方案中部署网络拓扑，因为每个节点只能拥有其邻居的直接信息。开发了一种完全分布式的近似算法，该算法构造具有最小最小平均边缘权重的生成树。我们证明了所提出的算法肯定可以产生可行的解决方案。然后，基于提出的算法构造的MST，我们还开发了一种连接保证（CG）算法来构造鲁棒的拓扑。 CG算法可以保证对每个节点的事件链接数量的要求，以便在发生拓扑变化时推迟性能下降。仿真结果表明，与现有技术相比，所提算法能够以较低的计算复杂度实现更好的性能。 （C）2017 Elsevier Masson SAS。版权所有。

著录项

  • 来源
    《Aerospace science and technology》 |2017年第10期|449-457|共9页
  • 作者

    Zheng Yongxing; Zhao Shanghong; Liu Yun; Tan Qinggui; Li Yongjun; Jiang Yong;

  • 作者单位

    Air Force Engn Univ, Informat & Nav Coll, Xian 710077, Shaanxi, Peoples R China|Natl Key Lab Sci & Technol Space Microwave, Xian 710000, Shaanxi, Peoples R China|Chongqing Commun Coll, Chongqing 400035, Peoples R China;

    Air Force Engn Univ, Informat & Nav Coll, Xian 710077, Shaanxi, Peoples R China;

    Air Force Engn Univ, Informat & Nav Coll, Xian 710077, Shaanxi, Peoples R China;

    Natl Key Lab Sci & Technol Space Microwave, Xian 710000, Shaanxi, Peoples R China;

    Air Force Engn Univ, Informat & Nav Coll, Xian 710077, Shaanxi, Peoples R China;

    Air Force Engn Univ, Informat & Nav Coll, Xian 710077, Shaanxi, Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Optical satellite networks; Topology control; Minimum spanning tree; Minimum edge weight;

    机译：光卫星网络;拓扑控制;最小生成树;最小边缘权重;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号