A NEW ALGORITHM OF NODES PARTITION USING FOR AD HOC NETWORK MODEL
This paper proposes a novel algorithm of nodes partition for the Ad Hoc network mode. Firstly, we adopt Man Road sub-cluster algorithm to discuss the clustering for a square region with 926 random nodes. Secondly, we establish the central moving model based on the simulated annealing algorithm and the least circle overlay model, which are used to remove the redundancy of the circle number and the circle radius. Then a better Ad Hoc Network model based on nodes partition can be obtained. Simulation results show that the algorithm can effectively maintain the stability of the sub-cluster structure and increase balancing capabilities of network load. At the same time, it can overcome the defect of the information packet loss in communications.
Ad Hoc network nodes partition subcluster algorithm central moving model least
Chengyu Liu Lina Zhao
School of Control Science and Engineering, Shandong University, Jinan 250061, China Shandong Heng-Xin Inspection Technique Exploiture Center, Jinan 250061, China
国际会议
深圳
英文
122-125
2011-10-28（万方平台首次上网日期，不代表论文的发表时间）