【摘要】 在分析 Ad Hoc 网的单播 QoS 路由问题的基础上,提出了一种新的 Ad Hoc 网的分布式 QoS 路由算法——EBLLD(entropy-based long-life distributed QoS routing)算法.其核心思想是提出了衡量路径稳定性的新尺度——熵,并利用熵来选择长寿的路径,减少了重建路由(或路由修复)的次数,从而在 Ad Hoc 网的网络拓扑频繁变化的环境中尽可能地提供 QoS 保证.同时该算法还利用本地组播机制和启发函数排序过滤和熵尺度排序过滤减小了其路由消息开销.仿真结果表明,EBLLD 算法能够以较小的路由消息开销获得较高的路由成功率.此外,EBLLD 算法具有可扩展性,可以应用于较大规模的 Ad Hoc 网中.更多还原

【Abstract】 On the basis of analyzing the problem of unicasting QoS routing in Ad Hoc networks, a new distributed QoS routing algorithm in the Ad Hoc network— EBLLD (entropy-based long-life distributed QoS routing) algorithm, is proposed. The key idea of EBLLD algorithm is to construct the new metric-entropy and select the long-life path with the help of entropy metric to reduce the number of route reconstruction so as to provide QoS guarantee in the Ad Hoc network whose topology changes continuously. The EBLLD algorithm uses the local multicast mechanism, orders and sorts the outgoing link with the heuristic function and entropy metric to reduce the message overhead. The simulation shows that the EBLLD algorithm can acquire a higher routing success ratio with the low message overhead. In addition, the EBLLD algorithm is scalable and applicable to large-scale Ad Hoc network.更多还原