机会网络路由关键技术研究

发布时间：2018-04-03 01:09

本文选题：机会网络　切入点：路由算法　出处：《河南大学》2014年硕士论文

【摘要】：随着移动互联网的快速发展，机会网络的应用也越来越多。机会网络是一种不需要在源节点和目标节点之间存在完整链路，通过节点的移动产生相遇机会传输信息，从而实现通信的自组织网络。机会网络的拓扑结构快速变化，链路常常中断，网络经常处于无法连通的状态，所以节点采用“存储-携带-转发”的模式传输信息。机会网络的这些特点使得传统的路由协议和拥塞控制策略均无法适应于机会网络环境，这就给机会网络的路由设计和拥塞策略设计带来了极大的挑战。因此，解决路由和拥塞问题是机会网络研究中的关键技术点。论文在分析现有方法的基础上，针对机会网络中的数据投递和拥塞问题开展研究，分别提出了基于分簇转发策略的机会路由算法和基于拥塞控制策略的机会路由算法。论文主要取得了以下研究成果： (1)为提高机会路由中的数据投递成功率，根据节点自身和节点间关系的特性，提出一种基于分簇转发策略的路由算法。该算法利用节点间成功传输信息的次数为分簇指标，对节点进行分簇，，同时根据中继节点和目标簇的关系转发消息，从而高效地将消息投递到目的节点，提高了节点间传输信息的成功率。仿真结果验证了该算法能够提高消息投递成功率和降低信息传输时延。 (2)为解决现有机会路由转发中节点优先级设置而导致的拥塞问题，提出了一种基于拥塞控制的机会路由算法。该算法在网络发生拥塞的时候，依据信息的转发价值，把拥塞节点上面的信息转移到和目的节点相遇概率大的邻居节点中，从而缓解拥塞情况。仿真结果验证了该策略能够在提高消息投递成功率的基础上，有效解决拥塞问题。本文针对机会网络中的数据投递和拥塞问题开展研究，提出了对应的解决办法，为机会网络数据投递和拥塞控制技术的发展提供有价值的参考。
[Abstract]:With the rapid development of mobile Internet, the application of opportunistic network is more and more.Opportunity network is an ad hoc network which does not need to have a complete link between the source node and the target node.The topology of the opportunistic network changes rapidly, the link is often interrupted, and the network is often disconnected, so the node transmits information in the mode of "store-carry-forward".These characteristics of opportunistic networks make the traditional routing protocols and congestion control strategies unsuitable for the opportunistic network environment, which brings great challenges to the routing design and congestion policy design of opportunistic networks.Therefore, solving the problem of routing and congestion is the key point in the research of opportunistic networks.Based on the analysis of existing methods, this paper studies data delivery and congestion in opportunistic networks, and proposes an opportunity routing algorithm based on clustering and forwarding strategy and an opportunistic routing algorithm based on congestion control strategy, respectively.The main achievements of this thesis are as follows:In order to improve the success rate of data delivery in opportunistic routing a new routing algorithm based on clustering forwarding strategy is proposed according to the relationship between nodes and nodes.The algorithm uses the number of times of successful transmission of information between nodes as a clustering index to cluster the nodes, and forwards messages according to the relationship between the relay node and the target cluster, so that the messages are delivered to the destination node efficiently.The success rate of information transmission between nodes is improved.Simulation results show that the algorithm can improve the success rate of message delivery and reduce the delay of information transmission.In order to solve the congestion problem caused by node priority setting in existing opportunistic routing, an opportunistic routing algorithm based on congestion control is proposed.When the network congestion occurs, according to the value of forwarding information, the information above the congestion node is transferred to the neighbor node with a high probability of meeting the destination node, so as to alleviate the congestion situation.The simulation results show that the proposed strategy can effectively solve the congestion problem on the basis of improving the success rate of message delivery.In this paper, the problem of data delivery and congestion in opportunistic networks is studied, and corresponding solutions are proposed to provide valuable reference for the development of data delivery and congestion control technology in opportunistic networks.
【学位授予单位】：河南大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5;TP393.01

【参考文献】