传感技术学报2016，Vol.29Issue(3)：429-433,5.DOI:10.3969/j.issn.1004-1699.2016.03.021
基于任务调度的无线网贪婪信道分配算法
Greedy Channel Assignment Algorithm for Wireless Networks Based on Task Scheduling
摘要
Abstract
Aiming at the problem of link interference in wireless networks,this paper proposes a greedy channel al⁃location algorithm based on multi processor task scheduling algorithm,which is the minimum channel for the access link selection. At the same time,the approximate ratio of the proposed algorithm is 2-1/k,and the k is the available orthogonal channel number,and the complexity of the algorithm is O(|E|2).In order to verify the feasibility and effec⁃tiveness of the proposed algorithm,the proposed algorithm is compared with the random channel assignment algo⁃rithm and the random channel assignment algorithm. The simulation results show that the overall performance of the proposed algorithm is better than the other two algorithms,and the maximum interference and average interference normalized values obtained by the greedy algorithm are more stable than the other two algorithms.So the algorithm can effectively reduce the link interference,and can improve the network throughput in a certain degree.关键词
无线网络链路/信道分配/贪婪算法/链路干扰/NP-hard/任务调度算法Key words
wireless network link/channel allocation/greedy algorithm/NP-hard/task scheduling分类
信息技术与安全科学引用本文复制引用
刘玉宾..基于任务调度的无线网贪婪信道分配算法[J].传感技术学报,2016,29(3):429-433,5.基金项目
河北省高等学校科学研究计划项目（Z2015075）；唐山市科学研究计划项目（15130203a）；唐山师范学院团队建设项目 （）
