论文部分内容阅读
在分析 Ad Hoc 网的单播 QoS 路由问题的基础上,提出了一种新的 Ad Hoc 网的分布式 QoS 路由算法——EBLLD(entropy-based long-life distributed QoS routing)算法.其核心思想是提出了衡量路径稳定性的新尺度——熵,并利用熵来选择长寿的路径,减少了重建路由(或路由修复)的次数,从而在 Ad Hoc 网的网络拓扑频繁变化的环境中尽可能地提供 QoS 保证.同时该算法还利用本地组播机制和启发函数排序过滤和熵尺度排序过滤减小了其路由消息开销.仿真结果表明,EBLLD 算法能够以较小的路由消息开销获得较高的路由成功率.此外,EBLLD 算法具有可扩展性,可以应用于较大规模的 Ad Hoc 网中.
Based on the analysis of unicast QoS routing problem in Ad Hoc network, this paper proposes a new distributed QoS routing algorithm based on Ad Hoc network, called EBLLD (entropy-based long-life distributed QoS routing) algorithm. Proposed a new measure of path stability - entropy, and use the entropy to select long-lived path, reducing the number of rerouted routes (or routing remediation), thus in the network environment of Ad Hoc network frequently changing environment as much as possible And provides QoS guarantee.At the same time, the algorithm also reduces the overhead of routing messages by using local multicast mechanism, heuristic sorting and entropy-scale sorting filtering.The simulation results show that EBLLD algorithm can obtain higher routing with smaller routing message overhead Success rate.In addition, EBLLD algorithm is scalable and can be applied to large-scale Ad Hoc networks.