Dynamic subchannel and slot allocation for OFDMA networks supporting mixed traffic: upper bound and a heuristic algorithm
IEEE Communications Letters（2009）
摘要
Optimizing resource allocation over only the frequency dimension in a single-cell OFDMA network is strictly suboptimal when heterogeneous non-real-time data users coexist. In this work we examine how to jointly exploit multi-user diversity on frequency and time domains towards maximizing cell throughput performance and satisfying individual rate and fairness QoS constraints. We develop a performance upper bound as well as an efficient heuristic algorithm for subcarrier and slot allocation which outperforms existing algorithms under polynomial complexity.
更多查看译文
关键词
polynomial complexity,ofdma network,efficient heuristic algorithm,optimizing resource allocation,mixed traffic,dynamic subchannel,multi-user diversity,fairness qos constraint,heterogeneous non-real-time data user,frequency dimension,slot allocation,individual rate,cell throughput performance,time domain,upper bound,resource management,radio resource management,throughput,polynomials,ofdm,frequency diversity,satisfiability,ofdm modulation,qos,quality of service,time frequency analysis,heuristic algorithm
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要