提出一种基于连通时序效用的路由算法——RBCSU (Routing Based on Connected Sequence of Utility)
该算法采用社区内节点间连通时序估计节点间通信路径状态
进而考虑节点可达率、时延度以及相似度计算节点效用值
并通过比较其效用值来选择出最优的中继节点转发消息.仿真结果表明
相比于Epidemic、PRoPHET和SimBet算法
该算法能够有效提高消息投递率、降低消息传输时延和网络开销.
Abstract
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.
关键词
Keywords
references
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.