一种控制消息广播与合并策略的低开销路由算法  

A Low Overhead Routing Algorithm for Controlling Message Broadcasting and Merging Strategy

作　　者：任冬 陈民华 刘顺辉 REN Dong;CHEN Minhua;LIU Shunhui(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China;Chongqing Key Laboratory of Mobile Communications Technology,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065 [2]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《电讯技术》2021年第8期1005-1012,共8页Telecommunication Engineering

基　　金：国家自然科学基金资助项目(61379159)。

摘　　要：针对现有基于社区的机会社会网络多副本消息传输机制中网络控制开销较大和网络资源浪费的问题,提出了一种基于广播策略的机会社会网络低开销路由算法。该算法采用了“ACK消息快速产生机制”和“控制消息合并机制”两种新机制,能够有效减少网络中数据消息副本不必要的转发次数和降低网络控制开销。理论分析和仿真验证表明,相较于现有的基于社区的消息机会传输路由算法和基于重叠社区的消息机会转发路由算法,所提算法能有效减少网络控制开销和节省网络资源。For the problems of large network control overhead and waste of network resources in the existing community-based opportunistic social network multi-copy message transmission mechanism,a low overhead routing algorithm for opportunistic social networks based on broadcast strategy is proposed.The algorithm adopts ACK message rapid generation mechanism and control message merging mechanism to effectively reduce unnecessary forwarding times of data message copies in the network and reduce network control overhead.Theoretical analysis and simulation verification show that compared with the existing community based message opportunity transmission(CMOT)routing algorithm and message opportunistic forwarding based on overlapping communities(MOFOC)routing algorithm,the proposed algorithm can effectively reduce network control overhead and save network resources.

关 键 词：机会社会网络 控制开销 广播策略 低开销路由算法 

分 类 号：TN915[电子电信—通信与信息系统]