摘要
建立了新的Ad Hoc无线网络的区域划分和资源分配模型,讨论了网络覆盖率和抗毁性.通过构造Voronoi图对平面单连通区域的Ad Hoc网络建立区域划分优化模型;定义了网络抗毁性的评价指标连通率,并通过构造Delaunay三角网的最小生成树和蒙特卡罗实验,取得了较好的抗毁仿真结果.最后结合K-均值分簇和罚函数法,得到了近似最优的平面复连通区域的Ad Hoc网络的区域划分和信道安排.
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 path arrangement of Ad Hoc networks in the complex to solve the district partition and signal connected domain.
出处
《数学的实践与认识》
CSCD
北大核心
2009年第8期53-60,共8页
Mathematics in Practice and Theory
基金
国家自然科学基金(70801003,70701003)
