异构网络选择算法研究

【作者】 王丰；

【导师】 雷维礼；

【作者基本信息】 电子科技大学 ， 通信与信息系统， 2012， 硕士

【摘要】 下一代移动网络的特征之一是异构网络的融合。不同的无线接入技术为用户提供不同的接入速率，覆盖范围和服务质量，在多个无线接入网络覆盖的区域内选择一个合适的网络进行接入是用户需要解决的问题，论文中设计了两种不同的网络选择算法来解决网络接入选择的问题。论文中设计了一种基于多目标决策的网络选择算法。这种网络选择算法首先对影响用户网络选择的参数进行归一化处理，并根据用户的业务的情况，结合层次分析法对各个参数的权重进行设定，通过计算各个网络的效用函数，用户最终会选择效用最大的网络进行接入。相对于传统的基于接收信号强度的网络选择算法，这种算法具有更好的性能。论文中设计了一种基于匹配博弈的异构网络选择算法。博弈论作为一种分析参与人相互影响的数学理论已经在经济学中得到了广泛的应用，在通信网络领域应用的还很少。论文中设计的网络选择算法是一种与匹配博弈模型相结合的网络选择算法，匹配博弈的模型最早是由Gale和Shapley为了解决男女之间的婚姻匹配的问题提出的。基于博弈论的网络选择算法能够使用户和网络间达到一种均衡，从何实现网络端和用户端的双赢。论文中首先分别设定了用户端和网络端的满意度函数，通过分别计算用户端和网络端的满意度函数，得出用户端和网络端的各个参与人的优先级序列，随后通过匹配过程得出网络和用户的匹配结果。论文中还对算法的博弈模型的稳定性进行了证明，以防止参与人间的匹配会被其他更优的匹配所阻止。最后通过仿真发现，基于博弈论的网络选择算法的性能要优于传统的基于用户优先和基于网络优先的网络选择算法，随着用户数和网络数的增加，优势更加明显。更多还原

【Abstract】 One of the characteristics of the next generation of mobile network is the fusionbetween heterogeneous networks.Different wireless access technologies provide userswith different bandwidth, coverage area, rate support and service quality. To select anappropriate network in the coverage area where contains more than one wireless accessnetwork is one problem that must be solves by the user. In this thesis, we put forwardtwo kinds of network selection algorithms to solve this problem.This thesis puts forward a kind of multi-objective decision network selectionalgorithm. First of all, the parameters which affect the choice of users will benormalized in this network selection algorithm, according to the user’s business, thisthesis calculate the weight of the various parameters through the analytic hierarchyprocess (AHP), the user will select the network that has the largest utility value.Compared to the traditional network selection algorithm based on strength of receivedsignal strength (RSSI), the multi-objective decision network selection algorithm basedon the analytic hierarchy process (AHP) has better performance.This thesis puts forward a kind of network selection algorithm betweenheterogeneous networks based on game theory. Game theory, as a kind of mathematicaltheory to analysis influence between the participants has been widely used in economics,but not widely used in communication network. This kind of network selectionalgorithm is based on matching game, matching game is first presented by Gale andShapley in order to solve the marriage matching problem between men and women. Thenetwork selection algorithm based on the game theory achieves a balance between theusers and networks, then realize the win-win situation of networks and users. First of all,this thesis sets the satisfaction functions for the networks and users, then get the prioritysequence of the users and networks through calculate satisfaction functions of the usersand networks. Finally we can get the matching result through the matching process. Thestability of the game model of the algorithm is proved in this thesis in order to preventthis situation that a better matching stops the original match. Finally, through thesimulation, we can find the performance of the network selection algorithm based on game theory is superior to the network selection algorithm based on user priority andnetwork priority. As the number of users and networks increased, the network selectionalgorithm based on game theory has more obvious advantage.更多还原