A distributed entropy-based long-life QoS routing algorithm in ad hoc network
A distributed entropy-based long-life QoS routing algorithm in ad hoc network
复制标题
自组织网络中基于分布式熵的长寿命QoS路由算法
DOI：
10.1109/ccece.2003.1226197
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Huazhi Gong
中科院分区：
文献类型：
--
作者：
Hui Shen;Bingxin Shi;Ling Zou;Huazhi Gong
提出了一种新的adhoc网络分布式QoS路由算法--EBLLD（entropy-based long-life distributed QoS routing）算法。构造了一个新的度量--熵，它表征了路径的生命（即路径的稳定性）. EBLLD算法的核心思想是在Ad Hoc网络中利用熵度量来选择长寿命路径，以提供QoS保证。大量的仿真实验表明，EBLLD算法能够以较低的消息开销获得较高的路由成功率，并选择较长的路径生命周期。
In this paper, a new distributed QoS routing algorithm in ad hoc net--EBLLD (entropy-based long-life distributed QoS routing) algorithm, has been proposed. A new metrics--entropy, which represents the life of path (stability of path), has been constructed. The key idea of EBLLD algorithm is to select the long-life path with the help of proposed entropy metrics to provide QoS guarantee in ad hoc network. The extensive simulation shows that the EBLLD algorithm can acquire the higher routing success ratio with the low message overhead and select the long-life path.