重庆邮电大学 机构 通信与信息工程学院,重庆,400065
纸质出版:2017
移动端阅览
刘科征, 黄春妮, 胡敏, 徐超. 基于连通时序效用的延迟容忍网络路由算法[J]. 微电子学与计算机, 2017, 34(5): 95-99.
LIU Ke-zheng, HUANG Chun-ni, HU Min, et al. A Routing Algorithm for DTN Based on Connected Sequence of Utility[J]. 2017, 34(5): 95-99.
针对延迟容忍网络现有社区内路由算法在选择中继节点未考虑节点间有序连接而高估通信路径可达性问题
提出一种基于连通时序效用的路由算法——RBCSU (Routing Based on Connected Sequence of Utility)
该算法采用社区内节点间连通时序估计节点间通信路径状态
进而考虑节点可达率、时延度以及相似度计算节点效用值
并通过比较其效用值来选择出最优的中继节点转发消息.仿真结果表明
相比于Epidemic、PRoPHET和SimBet算法
该算法能够有效提高消息投递率、降低消息传输时延和网络开销.
To solve overestimate the communication path accessibility in select relay node ignore order of connection
an Routing Based on Connected Sequence of Utility (RBCSU) is proposed. This algorithm estimate the connection status by using the community between nodes connected sequence. Furthermore
using node of reachable rate
time-delay degree and similarity to calculate the utility value
and then the preferable relay peers could be chosen by compare to the utility value. The result of simulation
which is compared to other well-known algorithms
indicated that this algorithm is improves the message delivery rate and reduce the overhead ratio.
Margalho M, Efrat A, Johnson T. Improving Robustness in DTN Networks that Carries Large Medical Files in Amazonia[J]. IEEE Latin America Transactions, 2016, 14(1): 349-355. DOI: 349
Caini C, Firrincieli R, Livin M. DTN bundle layer over TCP: Retransmission algorithms in the presence of channel disruptions[J]. Journal of Communications, 2010, 5(2): 106-116. DOI: 106
Huang Hongcheng, Xu Chao. Community-based with the Connection Strength and Similarity for DTN Message Transmission Strategy[J]. Journal of Computational Information Systems, 2015, 11(6): 2227-2235. DOI: 2227
Bhattacharjee S, Roy S, Bandyopadhyay S. Exploring an energy-efficient DTN framework supporting disaster management services in post disaster relief operation[J]. Wireless Networks, 2015, 21(3): 1033-1046. DOI: 1033
KERÄNEN A, OTT J, KÄRKKÄINEN T. The ONE simulator for DTN protocol evaluation[C]//Proceedings of the 2nd International Conference on Simulation Tools and Techniques. Brussels, Belgium: ICST, 2009: 1-10.
Penurkar M R, Deshpande U A. Max-Util: A utility-based routing algorithm for a vehicular delay tolerant network using historical information[C]//Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics. Springer India, 2016: 587-598.
蔡青松, 牛建伟, 刘燕. 机会网络中的消息传输路径特性研究[J]. 计算机研究与发展, 2011, 48(5): 793-801. DOI: 793
王博, 黄传河, 杨文忠. 时延容忍网络中基于效用转发的自适应机会路由算法[J]. 通信学报, 2010 (10): 36-47. DOI: 36
吴大鹏, 张普宁, 王汝言. 节点连接态势感知的低开销机会网络消息传输策略[J]. 通信学报, 2013, 34(3): 44-52. DOI: 44
牛建伟, 周兴, 刘燕, 等. 一种基于社区机会网络的消息传输算法[J]. 计算机研究与发展, 2009, 46(12): 2068-2075. DOI: 2068
吴磊, 武德安, 刘明, 等. 机会网络中面向周期性间歇连通的数据传输[J]. 软件学报, 2013, 24(3): 507-525. DOI: 507
0
浏览量
9
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号