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

发布时间：2018-05-29 19:10

本文选题：机会网络 + 社团划分　；参考：《内蒙古大学》2014年硕士论文

【摘要】：机会网络不同于传统无线网络,它是通过节点移动带来的相遇机会实现网络通信的自组织网络,消息的源节点和目的地节点之间不需要存在一条完整的通讯链路。网络中的节点随着移动和交互表现出一定的群体性,据此有学者提出基于社团划分的机会网络路由算法。目前,这类算法大多采用无权重网络拓扑划分社团,仅将节点间的关系抽象为一条简单的无权重的边,忽略了很多在节点接触时产生的很有价值的交互信息。本文通过引入权重策略改进了QCA社团更新算法,提出了一种基于有权社团结构的路由算法。算法中,节点间的交互信息转化为权重,根据不同的网络环境选择权重转化方案：归一化权重(normalized weight)和非归一化权重(non-normalized weight).路由算法在检测到周围网络环境变化时自主切换权重计算方案,适应网络环境的变化。通过在仿真环境和真实数据集上测试和分析,该算法能够将网络中的节点划分出合理的社团结构,并在保证较高的传输成功率的情况下降低网络开销。通过与其他算法的比较可以看出本文提出的路由算法性能稳定,能够更快的适应网络环境的变化。
[Abstract]:The opportunistic network is different from the traditional wireless network. It is an ad hoc network which realizes the network communication through the encounter opportunity brought by the node movement. There is no need for a complete communication link between the source node and the destination node of the message. The nodes in the network show a certain group with movement and interaction, so some scholars have proposed an opportunistic network routing algorithm based on community division. At present, most of these algorithms use unweighted network topology to divide the community, only abstracting the relationship between nodes into a simple unweighted edge, ignoring a lot of valuable interactive information generated when the nodes are in contact with each other. In this paper, the weight strategy is introduced to improve the QCA community update algorithm, and a routing algorithm based on the weighted community structure is proposed. In the algorithm, the interactive information between nodes is transformed into weights, and according to the different network environment, the normalized weight and non-normalized weight are selected according to the different network environment. In order to adapt to the change of the network environment, the routing algorithm can calculate the weight of the network independently when it detects the change of the surrounding network environment. By testing and analyzing the simulation environment and the real data set, the algorithm can divide the nodes in the network into reasonable community structure, and reduce the network overhead under the condition of high transmission success rate. By comparing with other algorithms, we can see that the proposed routing algorithm is stable and can adapt to the change of network environment more quickly.
【学位授予单位】：内蒙古大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP393.04

【参考文献】