计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (14): 3-6.
• 博士论坛 • 上一篇 下一篇
徐浩 慕德俊 李立欣
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
Received:
Revised:
Online:
Published:
摘要： 本文提出了一种Ad hoc网络按需式分簇路由算法ODCR（On-demand Clustering Routing Algorithm）。该算法采用首先声明的机制来选取簇首，利用有效的网关选取机制来确保两簇首之间的网关是唯一的。算法将按需式路由和分簇方法有机结合，有效地提高了网络的路由效率。分析实验结果表明，该算法具有路由收敛速度快、泛洪效率高、控制开销小、健壮性好等特点。
关键词: Ad hoc网络, 分簇, 路由算法, 负载
Abstract: In this paper, we propose a new on-demand clustering routing algorithm. On-demand clustering has two innovation mechanisms for the cluster information: First Declaration Wins rule and the Gateway Selection Heuristic to elect the minimal number of gateways. The integration of the on-demand method and clustering routing improves the routing efficiency. Analysis and simulation show that the protocol is characterized with its quick convergence and low maintenance costs of routing, robust and efficient flooding platform over dense, large mobile networks.
Key words: Ad hoc network, clustering, routing algorithm, offered load
徐浩 慕德俊 李立欣. 一种Ad hoc网络按需式分簇路由算法[J]. 计算机工程与应用, 2007, 43(14): 3-6.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I14/3
