首页 | 本学科首页   官方微博 | 高级检索  
   检索      

一种基于最小生成树的无线多跳网络信道分配算法
引用本文:邹涛.一种基于最小生成树的无线多跳网络信道分配算法[J].武警工程学院学报,2014(6):11-14.
作者姓名:邹涛
作者单位:武警工程大学信息工程系,陕西西安710086
基金项目:基金项目:陕西省自然科学基金资助项目(2012JQ8026)
摘    要:为提高无线多跳网络的吞吐量和传输可靠性,提出一种信道分配算法。该算法优先考虑最小生成树上的可用信道,为每个节点分配信道资源;然后考虑利用生成树外其他可用链路,为节点提供信道资源,以提高吞吐量。算法通过考虑每个用户的通信需求,可以充分利用空闲信道资源。仿真结果显示,相比于不考虑最小生成树外链路时,有效地提高了网络整体吞吐量。

关 键 词:信道分配  无线多跳网络  最小生成树

A Channal Allocation Algorithm in the Environment of Wireless Multi-Hop Network Based on Minimum Spnning Tree
ZOU Tao.A Channal Allocation Algorithm in the Environment of Wireless Multi-Hop Network Based on Minimum Spnning Tree[J].Journal of Engineering College of Armed Police Force,2014(6):11-14.
Authors:ZOU Tao
Institution:ZOU Tao (Department of Information Engineering, Engineering University of CAPF, Xi'an 710086,China)
Abstract:For improve the throughtout and transport security of multi-hop network, proposes a channel allocation algorithm. This algorithm giving priority to the available channels on the minimum spanning tree(MST),distributing channel resources for each node, then consider using other available links outside the spaning tree to provide channel resources so as to improve throughput. Simulation results show that, this algorithm can effectively improve the overall network throughput compared with the case without considering links outside the spinning tree.
Keywords:channel allocation  wireless multi-hop network  minimum spanning tree
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号