- 4
- 0
- 约1.51万字
- 约 22页
- 2016-03-13 发布于湖北
- 举报
毕业设计[论文]
题目:受限连通无线移动通信网的最大网络流快速跟踪模型
学 生 姓 名: 学号:
学 部 (系):
专 业 年 级:
指 导 教 师: 职称或学位:
2015年5月20日
受限连通无线移动通信网的最大网络流快速跟踪模型
摘 要
网络最大流问题在和工程等领域应用广泛,线性规划的实际问题都转化为网络最大流的模型来,,开辟了图论应用的新。交通、电力、物流等大规模发展计算机技术的广泛应用,对最大流问题的研究越来越深入,,。固定移动网络进行融合是网络发展的必然趋势网络整体概率连通性是研究通信络抗毁性及可靠性的一个重要测度大部分网络抗毁性和可靠性的研究工作都需要计算该测度。有算网络概率连通性一直是通信网抗毁研究中的一个重问题。概率连通性指构成网络的部件在以一定概率失效的情况下整个网络保持连通的概率。它的计算通常要归结为推导网络的每个可能的状态这一问惩已被证明是一个NP困难问题,现有的算法如factoring算法Buzaco算法算量都很大,只能分析中小规模网络。文献[2]提出的多边形化简方法把罔络化简成一个包含较少节点和链路的等效网络,然而这种化简的目的是减小等效网络的状态空间,最终仍然需要计算等效网络的连通概率。
关键词:泊松点分布;随机几何图理论;连通性;网络最大流理论;信道跟踪
A fast tracking model for the maximum network flow in constrained connected mobile communication networks
Abstract
Maximum flow problem of networks is widely used in the fields of science and engineering, many linear programming problems can transformed to the solution of a model for the maximum flow of network, close the graph theory and linear programming problem, opened up a new way for application of graph theory.?With the large-scale development of the transportation, electric power, logistics as well as the computer technology is widely used, people study of the maximum flow problem is more and more in-depth, and gradually establish a more perfect theory, this paper puts forward a series of algorithms.?Fixed mobile network convergence is the inevitable trend of the development of the necessary, this paper based on the theory of geometric random graphs, of maintaining mobile convergence network connectivity optimization method, based on the maximum flow of network theory, the fast tracking channel and network changes.
The probability of the whole network connectivity is the study of communication network survivability and reliability of an important measure most network survivability and reliability of the research work are required to compute the measure. How to calculate probability of network connectivity has been a major problem o
原创力文档

文档评论(0)