关键词: 延迟容忍网络, 路由, 最大消息副本数, 社会性, 网络协议

Abstract:

As the flooding-based routing algorithms for delay-tolerant networks have a serious message copy redun- dancy and the copies of message in some social networks diffuse locally, a routing algorithm based on copy restriction and sociality （RACS） is proposed, in which the message copy redundancy is reduced by restricting the maxi- mum number of message copies, and the centralities of nodes during the diffusion are compared to provide more message copies for a node with higher centrality rank. Thus, the diffusing and delivering of message copies are both well implemented. Simulated results show that, as compared with other routing algorithms, the proposed algorithm makes the delivering ratio increase by 5% and the average delivering delay decrease by 10% when the maximum number of message copies is 6.

Key words: delay-tolerant network, routing, maximum message copy number, sociality, network protocol