针对CDMA下行链路资源分配的优化算法

Optimal algorithm for resource allocation based on CDMA downlink

第三代移动通信系统中需要设计合理的突发数据准入控制算法,这对于有效利用宝贵的带宽资源以满足用户高速数据请求至关重要。对此该文在CDMA2000下行链路MAC层进行了探讨,提出了一种基于蚁群优化算法的方案,对突发的高速数据请求分配系统资源(即:信道)。仿真采用事件驱动并考虑了软切换,与传统的基于"先到先服务"方案进行了对比,结果表明平均吞吐率、平均时延均有改善。

A judicious burst admission control algorithm is crucial for the third generation mobile communication system to effectively harness the precious bandwidth while satisfying the high data rate （HDR） requests from users. The downlink of CDMA 2000 in the MAC layer is considered. The proposed algorithm is based on ant colony optimization （ACO） to allocate valuable resources （i.e. channels） to burst HDR requests. The performance is evaluated by event-drive simulations which takes account of soft handoff. The result shown that the performance is improved by using average throughput and average packet delay, compared to the conventional ＂First Come First Serve＂ （FCFS） principle.