节点文献

Ad Hoc网络区域划分和资源分配问题研究

Research on District Partition and Resource Allocation of the Ad Hoc Networks

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 刘炜李良威周福林王璐薛长虹

【Author】 LIU Wei, LI Liang-wei, ZHOU Fu-lin Advisor: WANG Lu, XUE Chang-hong(School of Electric Engineering,Southwest Jiaotong University,Chengdu 610031,China)

【机构】 西南交通大学电气工程学院西南交通大学电气工程学院 四川成都610031四川成都610031指导老师

【摘要】 主要利用图论、概率统计及优化理论对Ad-Hoc网络进行了数学建模.研究了等圆(不等圆)区域覆盖、带障碍区域的覆盖、确定性点覆盖、信道分配、抗毁度、节能性和通信质量等问题.定义了覆盖效率、抗毁性概率指标、覆盖系数、期望覆盖系数、网络寿命等一系列评价系数和衡量标准,提出了基于单位距离覆盖系数和期望覆盖系数的启发式寻优算法,并编程加以实现,得到较满意的近似解.

【Abstract】 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.

  • 【文献出处】 数学的实践与认识 ,Mathematics in Practice and Theory , 编辑部邮箱 ,2007年14期
  • 【分类号】O242.1
  • 【被引频次】1
  • 【下载频次】310
节点文献中: 

本文链接的文献网络图示:

本文的引文网络