检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学电信学院,西安710049 [2]西安邮电大学通信与信息工程学院,西安710061
出 处:《北京邮电大学学报》2014年第3期73-77,共5页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金项目(61372092);新一代宽带无线通信网国家科技重大专项项目(2011ZX03005-004;2012ZX03001029-003;2012ZX03001008-003)
摘 要:提出了随机化竞争调度算法.该算法属于协作调度算法的范畴,适用于对相邻中继蜂窝小区边缘的用户进行联合调度.以此算法为基础,提出了基于随机化竞争的中继蜂窝小区边缘协作调度策略.该策略通过在相邻小区边缘可能产生资源冲突的区域形成协作中继簇,并在协作中继簇覆盖的区域内应用随机化竞争调度算法,能够尽量避免相邻小区之间产生同频干扰,从而提升小区边缘的传输性能.仿真结果表明,所提出的协作调度策略有效地降低了相邻小区中继站对边缘用户的干扰,提升了小区边缘的吞吐量,并在一定程度上增强了小区中心和边缘区域之间的调度公平性.Abstract : Random competition (RC) scheduling algorithm is proposed. This algorithm is applied to joint scheduling between cells edge users of different adjacent areas, which belongs to the category of collabo- rative scheduling algorithm. In addition, collaborative scheduling scheme based on random competition for the edge of relay-enhanced cell is proposed based on this algorithm. In order to avoid co-frequency in- terference and improve the transmission performance of the cell edge areas, we introduce the collaborative relay cluster in the edge of relay-enhanced cell where resource conflicts would appear and apply RC scheduling algorithm among collaborative relay cluster. Simulation results suggest that the proposed meth- od can reduce the users' interference of the adjacent cells, and improve the cell edge throughput. Moreo- ver, the scheduling fairness between cell center and edge can be enhanced.
分 类 号:TN929.53[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.116.14.133