机会网络中基于社区的高效消息传输算法

High-efficient community-based message transmission scheme in opportunistic network

针对机会社会网络中现有基于社区的消息传输算法(OSNCMTS)在社区内存在节点积压消息分发任务、在社区间存在盲目选择活跃节点转发信息的问题,提出一种基于社区的高效机会网络路由算法(HECMTS)。在HECMTS算法中,首先,采用极值优先(EO)算法划分社区并将划分的社区矩阵分发给社区节点;其次,采用社区矩阵和消息到目的节点成功率相结合的方法分配社区内消息副本数;最后,利用活跃节点往返不同社区的机会收集活跃节点信息,然后查询这些活跃节点信息从中选取合适的活跃节点完成社区间消息传输。仿真结果表明,与OSNCMTS算法相比,HECMTS算法在路由开销性能和平均端到端时延性能上分别至少下降了19%和16%。

To deal with the problems that message-distributed tasks are backlogged by nodes in the inner community and active nodes are blindly selected to transmit message in the Community-based Message Transmission Scheme in Opportunistic Social Network （OSNCMTS）, a High-Efficient Community-based Message Transmission Scheme in opportunistic network （HECMTS） was proposed. In HECMTS, firstly, communities were divided by Extremal Optimization （EO） algorithm and the corresponding community matrices were distributed to nodes; secondly, the copies of message were assigned based on the community matrices and the success rate of data packets to destination nodes; finally, the active nodes＇ information was collected by the opportunities of active nodes＇ back and forth in different communities, then the suitable nodes were selected to finish message transmitting between communities by querying the active node information. The simulation results show that routing overhead in HECMTS is decreased by at least 19% and the average end-to-end delay is decreased by at least 16% compared with OSNCMTS.