首页> 中文期刊> 《计算机科学》 >无线Ad hoc网络中基于0-1优化的两步骤资源分配算法

无线Ad hoc网络中基于0-1优化的两步骤资源分配算法

         

摘要

为了解决无线Ad hoc网络中节点性能随节点个数增加而下降的问题,利用多射频多信道技术(MR-MC)进行资源分配以及减少网络干扰量已成为优化无线网络性能的重要技术手段.在此基础上,提出了一种基于0-1规划的网络优化模型和两步骤资源分配算法TBCA&LS(Tree Based Channel Assignment&Link Scheduling).该算法利用分簇重组网络结构,通过分析相邻链路干扰关系构建0-1优化模型,并在此基础上执行将信道分配和链路调度结合的资源分配算法,减少相邻链路冲突,增加并行传输量,进而达到提升网络吞吐量、优化网络资源分配的目的.最后,在Matlab仿真软件中执行两步骤资源分配算法,实验结果表明,与对比算法CCAS和仅利用信道分配的算法相比,所提算法可以有效优化网络性能.%In order to solve the problem that the capability of wireless Ad Hoc networks will decrease with the increase of the number of nodes,the use of multi-radio multi-channel (MR-MC) to distribute resources and reduce the interference among nodes has become an important technical for the wireless network performance optimization.Therefore,we proposed a zero-one integer programming network optimization model and a tree-based channel assignment & link scheduling approach to make that the limited available channels can optimally work and ensure higher capacity increase in wireless Ad hoc networks.Then,we implemented the algorithms in Matlab7.0.The results show that our method performs much better than CCAS and the algorithm which only use channel assignment.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号