移动Ad Hoc网络中基于动态规划法的QoS路由研究

An efficient QoS routing algorithm based on dynamic programming in Mobile Ad Hoc Networks

在移动Ad Hoc网络中,为不同的多媒体应用需求提供QoS保证已经成为一个热点问题。目前,大多数的研究者都将研究点关注于QoS路由的度量选择上,而忽视了移动Ad Hoc网络自身的能量局限性的问题,而能量又是影响Ad Hoc网络一个极其关键的因素。因此,在本文中我们使用一种动态规划算法来解决Ad Hoc网络的电池约束。首先,我们构建了一个基于动态规划法的QoS路由模型,然后分析了该算法的时间复杂度,最后通过仿真验证了本文提出的改进算法的优越性。

In Mobile Ad Hoc Networks （MANETs）, the need to provide QoS guarantee for diverse multimedia applications is becoming an essential problem. Most researches focus on the QoS metrics and neglect the energy constraints of MANET itself which is a fairly important problem. So in this paper we aim to find a way to solve the battery limitation in MANETs using dynamic programming method .We first construct a QoS routing model based on dynamic programming and then analyze the complexity of the algorithm. Simulations are conducted to evaluate the performance of the proposed algorithm.