基于博弈论的预测预约路由算法研究与实现

发布时间：2019-02-12 07:07

【摘要】：随着科技水平的不断发展,无线网络凭借其独立性、移动性与分布性的特点,正在逐步取代传统有线网络在人们工作生活中的地位,而无线自组织网络也渐渐成为了网络研究领域的热门。作为实现移动性与独立性的代价,无线网络尤其是无线自组织网络中的节点设备通常都会受到计算能力、存储能力、电池容量等多方面的限制,因此,相比于固定网络中的节点设备,移动节点更有动机出于自私的目的拒绝为其他节点提供网络服务。这种自私行为对网络的整体性能造成了不利的影响,往往也限制了节点自身的正常工作。为了降低无线节点的自私性所带来的影响,研究者在路由协议的研究中引入了博弈论的思想。通过设置合理的激励与限制机制,博弈路由算法往往可以有效地消除节点进行自私行为的动机,迫使节点参与正常的网络合作。本文根据博弈论中纳什解的相关概念,并吸取了Ad hoc VCG算法的部分思想,形成了一种基于博弈论的预测预约路由算法。这种算法通过降低信任度的获取难度与计算复杂度提高了路由的效率,并通过引入预测预约机制对节点的自私行为进行了限制。在仿真中,通过与VCG算法和LSTOP算法的对比,表明这种算法在提供了相较于VCG算法更高的分组投递率的同时,达到了比LSTOP算法更加优异的端到端传递性能。另一方面,由于路由算法中预测算法具有独立性,所以可以通过更换预测算法对路由性能予以调整,从而带来更为灵活的路由机能。最后,在演示系统中,对基于博弈论的预测预约路由算法进行了实现。
[Abstract]:With the development of science and technology, wireless network, with its independence, mobility and distribution, is gradually replacing the traditional wired network in the work and life of people. And wireless ad-organization network has gradually become a hot topic in the field of network research. As the price of mobility and independence, node devices in wireless networks, especially in wireless ad hoc networks, are usually limited by computing power, storage capacity, battery capacity, and so on. Compared with node devices in fixed networks, mobile nodes are more motivated to refuse to provide network services to other nodes for selfish purposes. This selfish behavior has a negative impact on the overall performance of the network, and often limits the normal operation of the nodes themselves. In order to reduce the influence of selfishness of wireless nodes, researchers have introduced the idea of game theory into the research of routing protocols. By setting up reasonable incentive and restriction mechanisms, game routing algorithm can effectively eliminate the motivation of selfish behavior of nodes and force nodes to participate in normal network cooperation. Based on the related concepts of Nash solution in game theory and some ideas of Ad hoc VCG algorithm, a predictive reservation routing algorithm based on game theory is proposed in this paper. This algorithm improves the efficiency of routing by reducing the difficulty and computational complexity of obtaining trust, and limits the selfish behavior of nodes by introducing predictive reservation mechanism. Compared with the VCG algorithm and the LSTOP algorithm, the simulation results show that the proposed algorithm not only provides higher packet delivery rate than the VCG algorithm, but also achieves better end-to-end transmission performance than the LSTOP algorithm. On the other hand, because of the independence of the prediction algorithm in the routing algorithm, the routing performance can be adjusted by replacing the prediction algorithm, thus bringing more flexible routing function. Finally, the predictive reservation routing algorithm based on game theory is implemented in the demo system.
【学位授予单位】：西安电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5;O225

【共引文献】