电子学报 ›› 2016, Vol. 44 ›› Issue (10): 2449-2458.DOI: 10.3969/j.issn.0372-2112.2016.10.024

• 学术论文 • 上一篇    下一篇

机会网络中基于有权社团结构图的路由协议研究

马学彬, 白婧, 郑田玉   

  1. 内蒙古大学计算机学院, 内蒙古呼和浩特 010021
  • 收稿日期:2015-02-04 修回日期:2015-11-20 出版日期:2016-10-25 发布日期:2016-10-25
  • 作者简介:马学彬,男,1981年生,内蒙古大学副教授,从事计算网络技术方面的有关研究.E-mail:csmaxuebin@imu.edu.cn;白婧,女,1989年12月出生,内蒙古大学硕士研究生.研究方向为计算机网络;郑田玉,男,1993年12月出生,内蒙古大学硕士研究生.研究方向为计算机网络.
  • 基金资助:

    国家自然科学基金(No.61162006);内蒙古自然科学基金(No.2014MS0605)

A Routing Algorithm Based on Weighted Community Detection for Opportunistic Networks

MA Xue-bin, BAI Jing, ZHENG Tian-yu   

  1. School of Computer, Inner Mongolia University, Hohhot, Inner Mongolia 010021, China
  • Received:2015-02-04 Revised:2015-11-20 Online:2016-10-25 Published:2016-10-25

摘要:

基于社团检测的机会网络路由算法大多采用无权重网络拓扑划分社团,仅将节点间的关系抽象为一条简单的无权重的边,忽略了节点关系的强弱程度.本文通过引入权重策略改进了QCA社团更新算法,提出了一种基于有权社团结构的路由算法,该算法解决了社团关系定量化单一的问题,更能真实反映出社团成员之间的关系.算法中,节点间的交互信息转化为权重,根据不同的网络环境选择不同的权重转化方案——归一化权重(normalized weight)和非归一化权重(non-normalized weight).路由算法在检测到周围网络环境变化时自动切换权重计算方案以适应网络环境的变化.通过在仿真环境和真实数据集上测试和分析,该算法能够将网络中的节点划分出合理的社团结构,并在保证较高的传输成功率的情况下降低网络开销.

关键词: 机会网络, 社团划分, 路由算法, 有权拓扑

Abstract:

Most of the opportunistic networks routing algorithms based on community detection use an un-weighted network which ignores the degree of intensity of relations between nodes.This paper proposes a routing algorithm based on community detection of weighted network.We improve quick community adaptation (QCA) and make it adapt to the opportunistic networks by using weighted networks.The algorithm calculates link weights by the connection information between nodes in the network.According to the different network environments,we present two weight calculation strategies:normalized weight strategy and non-normalized weight strategy.The algorithm detects the environment around the current node,and then chooses the right strategy.To illustrate the performance of our algorithm,we test the algorithm by using a simulation environment and a real dataset.The results demonstrate that our algorithm gets a reasonable community structure and reduces the overhead ratio and keeps a higher delivery probability.

Key words: opportunistic networks, community detection, routing algorithm, weighted topology

中图分类号: