A dynamic nodes partition algorithm for the Ad Hoc network is proposed. Firstly, Roam cluster method is used to cluster 926 random nodes in a square region. Subsequently, the central moving model based on the simulate...A dynamic nodes partition algorithm for the Ad Hoc network is proposed. Firstly, Roam cluster method is used to cluster 926 random nodes in a square region. Subsequently, the central moving model based on the simulated annealing algorithm and the least circle overlay model is constructed to remove the network redundancy of the circle number and circle radius respectively. Simulation results show that the algorithm can effectively maintain the stability of network structure and increase balancing capabilities of Ad Hoc network load. The future work is to study how to improve the adaptability for the application in the complicated areas.展开更多
基金supported by Hi-Tech Research and Development Program of China under Grant No.2009AA02Z408National Natural Science Foundation of China under Grant No.51075243China Postdoctoral Science Foundation Funded Project under Grant No.20110491593
文摘A dynamic nodes partition algorithm for the Ad Hoc network is proposed. Firstly, Roam cluster method is used to cluster 926 random nodes in a square region. Subsequently, the central moving model based on the simulated annealing algorithm and the least circle overlay model is constructed to remove the network redundancy of the circle number and circle radius respectively. Simulation results show that the algorithm can effectively maintain the stability of network structure and increase balancing capabilities of Ad Hoc network load. The future work is to study how to improve the adaptability for the application in the complicated areas.
