Research on District Partition and Resource Allocation of the Ad Hoc Networks
He Wei · Shuxue de shijian yu renshi · 2009
The paper discusses district partition and resource allocation of the Ad Hoc wireless networks,focusing on network coverage and capability of destruction resistance.A new optimal model is developed to divide the Ad Hoc networks by constructing the Voronoi diagrams in the simply connected domain.Based on the evaluation coefficient of capability of destruction resistance we defined,satisfying stimulating results are obtained by constructing minimum spanning tree of Delaunay triangulation and Monte Carto experiment.Finally,K-means clustering algorithm and penalty function are applied to solve the district partition and signal path arrangement of Ad Hoc networks in the complex connected domain.