Research of Optimal Clustering Routing Algorithm for NGB with Small-World Property

In the wired and wireless integrated network, there is deployed of a small amount of heterogeneous nodes communication directly with the Sink, forming a shortcut, and making network has the properties of small world, with better energy saving and improve network performance. However, the optimal deployment of heterogeneous nodes is a kind of NP - Hard problem. Therefore, the paper consideration of the total energy of network and energy consumption balance, transforming the optimizedd eployment of heterogeneous nodes into a mixed integer programming problem, getting the approximate optimal solution by the decomposition algorithm, And then, there will be a dynamic clustering to the ordinary node deployed in the integrated network, setting up to a clustered node routing way. It is the clustering CHNMIP heterogeneous network routing algorithm based on the mixed integer programming, namely clustering based on the mixed integer programming is heterogeneous network CHNMIP routing algorithm. The result of the simulation experimental shows that the CHNMIP routing can improve integrated network performance under different simulation NGB environment.