基于位置信息的仓储容迟网络路由算法  

Warehouse Delay Tolerant Network Routing Algorithm Based on Location Information

作　　者：张永晖[1,2] 林漳希[3] 刘建华[1] 梁泉[1] 

机构地区：[1]福建工程学院福建省汽车电子与电驱动技术重点实验室,福州350118 [2]中南大学信息科学与工程学院,长沙410083 [3]德克萨斯理工大学商学院,卢伯克794092101

出　　处：《电信科学》2012年第11期81-85,共5页Telecommunications Science

基　　金：福建省自然科学基金资助项目(No.2012J01243);福建省工商发展资金2011年企业技术创新专项省属项目"闽经贸计财"(No.[2011]704)

摘　　要：仓储网络接入环境适合使用容迟网络(DTN)协议,然而渡轮的计划移动有时间的概率不确定性,从而导致DTN路由算法的先验知识计算复杂。本文提出基于位置信息的路由算法,由接入基站参数矩阵决定接入路由器集合,使用广义k任播缓解流量爆炸问题,最终使用效用最大化的规划模型,在整个许可时间段和k个路由器之间进行路由和资源分配,结合DTN的托管传送,可以实现对多个目的地同时传送数据分组。仿真结果表明,其传输性能和顽健性整体较优,能更灵活地支持仓储容迟网络拓扑结构的变化。Warehouse network must deal with frequent network disruption and network segmentation, which can be solved with DTN. However, scheduled ferry mobility is of probabilistic uncertain, so that the knowledge oracle in warehouse network, that DTN routing algorithms need, shows complex. So a space-based routing algorithm with location information is proposed to eliminate it. Access router information matrixes in path predictable environment are designed to decided k-anycast router aggregate, so that the generalized k-anycast can moderate traffic explosion. Utility maximization model allocates bandwidth resources to k eligible access routers in access period, with DTN custody transfer, can be transmitted packets simultaneously to multiple destination. Simulations show that it gains better transmission performance and robustness and more flexibility to support warhouse network topology changes.

关 键 词：仓储接入网络 容迟网络 k任播 DTN路由 效用 

分 类 号：TN929.53[电子电信—通信与信息系统]