Efficient Scheduling for Delay Constrained Multi-Rate CDMA Systems

Abstract

Abstract-We consider efficient scheduling for a delay constrained multi-rate CDMA system. We first find the optimum schedule for CDMA systems without transmit diversity (TD), that minimizes the average transmission energy per bit while maintaining the short term average throughput for each user in the system. We observe that the specifics of the scheduling problem enables it polynomially solvable. Next, we consider the case when mobile devices are capable of employing two antennas and use Alamouti scheme to achieve TD. We observe that our proposed scheduling protocol can be extended to the system with TD with a modest sacrifice in performance and significant saving in computational complexity, as compared to the optimum scheduler. Simulation results are presented to demonstrate the performance of the proposed scheduling protocols, and the considerable energy savings they provide with respect to the TDMA-type scheduling.

Review of Optimization Problems in Wireless Sensor Networks

“…Their distributed solution is a heuristic which tries to solve first the problem of channel allocation and subsequently the code allocation one. When CDMA is combined with scheduling, Chen et al (2006) looks for a feasible schedule for all the nodes in the network, together with their respective PN codes such that there is no interference (or the interference falls below a given threshold) in any time slot and the total energy consumption is minimized.…”