Overlapping clustering routing algorithm for Ad hoc network
Zhenchao Wang, Yijin Wang, Wang Jing · Computer Engineering and Applications Journal · 2012
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.