计算机工程与应用2012，Vol.48Issue(7)：88-91,4.DOI:10.3778/j.issn.1002-8331.2012.07.022
一种适用于Ad hoc网络的交叠分簇路由算法
Overlapping clustering routing algorithm for Ad hoc network
王振朝 1王伊瑾 2王静1
作者信息
- 1. 河北大学电子信息工程学院,河北保定071000
- 2. 河北农业大学信息科学与技术学院,河北保定071000
- 折叠
摘要
Abstract
A dynamic routing algorithm of overlapping clustering is proposed by modifying existing clustering algorithm on two ways. The new algorithm permits a node responding all clustering commands from upper layers. As a result, the non-overlapping clustering algorithm is transformed to overlapping clustering one and the routing structure is expanded into the network topology from the tree topology. The new algorithm allows nodes in the same layer can exchange message of routing and communicate with each other. Accordingly, the number of possible routings is increased. The overlapping clustering algorithm has the advantages of less overhead of routing searching, and can get multiple routings rather than only one shortest routing in non-overlapping clustering algorithm.关键词
Ad hoc网络/路由算法/交叠分簇Key words
Ad hoc network/routing algorithm/overlapping clustering分类
信息技术与安全科学引用本文复制引用
王振朝,王伊瑾,王静..一种适用于Ad hoc网络的交叠分簇路由算法[J].计算机工程与应用,2012,48(7):88-91,4.
