摘要
主要利用图论、概率统计及优化理论对Ad-Hoc网络进行了数学建模.研究了等圆(不等圆)区域覆盖、带障碍区域的覆盖、确定性点覆盖、信道分配、抗毁度、节能性和通信质量等问题.定义了覆盖效率、抗毁性概率指标、覆盖系数、期望覆盖系数、网络寿命等一系列评价系数和衡量标准,提出了基于单位距离覆盖系数和期望覆盖系数的启发式寻优算法,并编程加以实现,得到较满意的近似解.
District Partition and resource allocation of the Ad Hoc networks is modeled by using graph theory, probability statistics and optimization theory. The circle covering problem, definitive node covering proble, mallocation of the channel frequency, survivability, energy conservation and communication quality is researched in this paper. A series of evaluation coefficient and judge criterion on covering efficiency, survivability index, expectant covering coefficient and network lifespan is defined. Based on unit distance covering coefficient and expectant covering coefficient, a heuristic optimization algorithm is put forward and implemented. According to these, approximate solutions are gotten by programming.
出处
《数学的实践与认识》
CSCD
北大核心
2007年第14期35-44,共10页
Mathematics in Practice and Theory
关键词
AD
HOC网络
覆盖问题
信道分配
抗毁性
节能性
Ad Hoc networks
covering problem
allocation of channel
survivability
energy conservation
