中文摘要：

针对Bubble Rap路由算法的路由开销不理想的问题,提出一种利用节点相遇历史信息和删除消息副本相结合的低开销路由（LCMT）算法。利用与目的节点相遇次数进行消息转发改变了Bubble Rap单一的消息转发评判标准,使其对不同数据集场景的适应性得到提高,并结合效用函数对消息副本数进行控制,从而减小了路由开销。和Bubble Rap路由算法相比,仿真结果表明在Infocom06和MIT数据集中,该算法可在保证良好消息传输成功率的前提下显著降低路由开销。

英文摘要：

For solving the problem that routing overhead is not ideal in the social opportunistic network routing algorithm-Bubble Rap,this paper presented a low delivery cost routing algorithm which combines nodes historical meeting information and deleting messages duplicates-LCMT（ low delivery cost protocol using the meeting times with destination node）. Using meeting times with destination node changes the single evaluation criteria for message forwarding of bubble-rap and improves the adaptability to different data sets occasions. It also reduces the routing delivery cost through combining with the utility function which can control messages copy number. Compared with bubble rap,the simulation results in Infocom06 and MIT data sets show that the proposed algorithm can moderately increase the success rate of message transmission and effectively reduce the routing overhead.