无线Mesh网络端到端时延保障机制研究
发布时间：2018-11-05 16:50
【摘要】：随着信息科学技术的蓬勃发展,一种新的无线网络技术 无线Mesh网络(Wireless Mesh Networks,WMNs)受到了众多用户的青睐,它拥有更高的吞吐率、更低的时延以及更好的可靠性。然而,由于无线网络带宽资源的紧缺,如何更加合理的用较少的带宽为更多的用户服务,已经成为无线领域研究的重要方向。本文对WMNs中的组播路由(Multicast Routing)和时隙分配(Time Slot Assignment)两个问题进行了深入分析研究,提出了考虑无线干扰的组播路由算法和时隙分配算法,以降低网络时延,提高系统吞吐量。本文首先研究了WMNs中的组播路由问题。随着网络规模的膨胀,网络带宽资源紧缺,需要设计性能优异的路由算法来增大吞吐量,降低时延,从而节省带宽资源。然而由于无线网络的干扰的存在,数据传输时延可能有好有坏,因此需要找出具有最小时延的路径。本文首先对计算组播树最小端到端时延的问题进行建模,将其抽象成一个整数线性规划模型;由于整数线性规划模型是NP问题,本文又提出了一种组播树时延的估算方法,以保证在多项式时间复杂度内求出组播树的时延;之后提出了一种基于最小时延的组播路由算法;最后进行了大量的仿真,将本文提出的新的路由算法和传统算法进行了对比,证明了本文介绍的算法较之传统算法更加有效。随着网络规模的不断增长,网络中分组传输所需的时隙数目急剧增加,从而导致网络时延变大,系统吞吐量降低。为了解决无线网络中时隙分配不公平而导致的数据传输效率下降问题,本文提出了一种基于置信度传输(Belief Propagation,BP)实现网络时隙分配的算法。首先建立因子图模型,再通过BP算法来计算边缘概率,之后举例对算法进行了详细说明;最后进行了仿真验证,仿真中可以看出本文提出的算法能够有效实现时隙复用,并满足公平性。本文提出的两种算法均能提升网络性能,具有实践意义。
[Abstract]:With the rapid development of information science and technology, a new wireless network technology, wireless Mesh network (Wireless Mesh Networks,WMNs) is favored by many users. It has higher throughput, lower delay and better reliability. However, due to the shortage of bandwidth resources in wireless networks, how to use less bandwidth to serve more users has become an important research direction in wireless field. In this paper, two problems of multicast routing (Multicast Routing) and slot allocation (Time Slot Assignment) in WMNs are deeply analyzed and studied. The multicast routing algorithm and slot allocation algorithm considering wireless interference are proposed to reduce the network delay. Improve system throughput. In this paper, we first study the multicast routing problem in WMNs. With the expansion of network scale and the shortage of network bandwidth resources, it is necessary to design excellent routing algorithms to increase throughput and reduce delay, thus saving bandwidth resources. However, due to the interference of wireless networks, the data transmission delay may be good or bad, so it is necessary to find out the path with the minimum delay. Firstly, the problem of computing the minimum end-to-end delay of multicast tree is modeled and abstracted into an integer linear programming model. Since the integer linear programming model is a NP problem, this paper proposes a method to estimate the delay of multicast tree in order to solve the delay of multicast tree within polynomial time complexity, and then proposes a multicast routing algorithm based on minimum delay. Finally, a large number of simulations are carried out, comparing the new routing algorithm proposed in this paper with the traditional algorithm, which proves that the algorithm presented in this paper is more effective than the traditional algorithm. With the increasing of network scale, the number of time slots needed for packet transmission in the network increases dramatically, which leads to the increase of network delay and the decrease of system throughput. In order to solve the problem of data transmission efficiency decline caused by unfair slot allocation in wireless networks, this paper proposes an algorithm based on confidence degree transmission (Belief Propagation,BP) to implement slot allocation in wireless networks. Firstly, the factor graph model is established, then the edge probability is calculated by BP algorithm, and then the algorithm is explained in detail by an example. Finally, the simulation results show that the proposed algorithm can effectively realize slot multiplexing and meet the fairness. The two algorithms proposed in this paper can improve the network performance and have practical significance.
【学位授予单位】：西安电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5
[Abstract]:With the rapid development of information science and technology, a new wireless network technology, wireless Mesh network (Wireless Mesh Networks,WMNs) is favored by many users. It has higher throughput, lower delay and better reliability. However, due to the shortage of bandwidth resources in wireless networks, how to use less bandwidth to serve more users has become an important research direction in wireless field. In this paper, two problems of multicast routing (Multicast Routing) and slot allocation (Time Slot Assignment) in WMNs are deeply analyzed and studied. The multicast routing algorithm and slot allocation algorithm considering wireless interference are proposed to reduce the network delay. Improve system throughput. In this paper, we first study the multicast routing problem in WMNs. With the expansion of network scale and the shortage of network bandwidth resources, it is necessary to design excellent routing algorithms to increase throughput and reduce delay, thus saving bandwidth resources. However, due to the interference of wireless networks, the data transmission delay may be good or bad, so it is necessary to find out the path with the minimum delay. Firstly, the problem of computing the minimum end-to-end delay of multicast tree is modeled and abstracted into an integer linear programming model. Since the integer linear programming model is a NP problem, this paper proposes a method to estimate the delay of multicast tree in order to solve the delay of multicast tree within polynomial time complexity, and then proposes a multicast routing algorithm based on minimum delay. Finally, a large number of simulations are carried out, comparing the new routing algorithm proposed in this paper with the traditional algorithm, which proves that the algorithm presented in this paper is more effective than the traditional algorithm. With the increasing of network scale, the number of time slots needed for packet transmission in the network increases dramatically, which leads to the increase of network delay and the decrease of system throughput. In order to solve the problem of data transmission efficiency decline caused by unfair slot allocation in wireless networks, this paper proposes an algorithm based on confidence degree transmission (Belief Propagation,BP) to implement slot allocation in wireless networks. Firstly, the factor graph model is established, then the edge probability is calculated by BP algorithm, and then the algorithm is explained in detail by an example. Finally, the simulation results show that the proposed algorithm can effectively realize slot multiplexing and meet the fairness. The two algorithms proposed in this paper can improve the network performance and have practical significance.
【学位授予单位】：西安电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5
【相似文献】
相关期刊论文 前10条
1 韩悦;刘增基;姚明e，
本文编号：2312692
本文链接：https://www.wllwen.com/kejilunwen/wltx/2312692.html
