一种适用于Ad hoc网络的交叠分簇路由算法  

Overlapping clustering routing algorithm for Ad hoc network

作　　者：王振朝[1] 王伊瑾[2] 王静[1] 

机构地区：[1]河北大学电子信息工程学院,河北保定071000 [2]河北农业大学信息科学与技术学院,河北保定071000

出　　处：《计算机工程与应用》2012年第7期88-91,共4页Computer Engineering and Applications

摘　　要：提出一种交叠分簇动态路由算法。新算法对现有分簇算法进行了两点改进。首先允许节点可以对多个分簇广播进行应答,从而将非交叠分簇改变为交叠分簇,网络拓扑也由树状结构变为纵向网状结构。其次允许同层的节点之间交换路由信息并建立路由,从而进一步增加了可选路径的条数。新算法克服了非交叠分簇算法只能得到一条最短路径的局限性,可同时得到多条可用路径。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网络 路由算法 交叠分簇 

分 类 号：TN91[电子电信—通信与信息系统]