检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:毛一丁 田洲 赵雨[1] 孙汉汶[1] 徐伟琳[1] 赵毅[1] MAO Yiding;TIAN Zhou;ZHAO Yu;SUN Hanwen;XU Weilin;ZHAO Yi(China Academy of Space Technology(Xi′an),Xi′an 710100,China)
机构地区:[1]中国空间技术研究院西安分院,陕西西安710100
出 处:《西北工业大学学报》2020年第S01期113-119,共7页Journal of Northwestern Polytechnical University
摘 要:在空间延迟容忍网络(DTN)中,由于卫星节点运行轨道的限制,造成节点运动并不具有典型随机性。节点间历史接触时间的长短和未来接触的概率往往存在正相关,并且根据卫星运行轨道的异同,接触的可能也存在较大差异。针对以上特点,结合现有DTN路由算法的优势,设计了一种基于历史信息统计的DTN分组路由策略,通过将卫星节点按运行轨道分组,并结合历史接触时长计算接触概率,以适应卫星网络节点运动场景,使接触概率预测更加准确,进而提高消息下一跳选择的准确性。仿真结果表明,该路由策略与现有路由算法相比,具有较低的缓存消耗,并有较高的消息投递率和较优的投递时延。In the space delay tolerant network(DTN),the node motion is not typically random due to the limitation of the orbit of the satellite.There is a positive correlation between the length of historical contact time and the probability of future contact between nodes,and according to the similarities and differences of satellite orbit,the possibility of contact is also quite different.This paper aims at the above characteristics,combined with the advantages of existing DTN routing algorithms,designed a DTN packet routing strategy based on historical information statistics.By grouping satellite nodes into operational orbits,the contact probability is calculated by the historical contact time,and adapt to the motion of satellite network.To get more accurate contact probability predict,and improve the accuracy of next hop selection.The simulation results show that compared with the existing routing algorithm,this routing strategy has lower cache consumption,higher message delivery rate and better delivery delay.
关 键 词:延迟容忍网络(DTN) 分组路由 接触概率
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.53.120