In this work, we address the problem of CDMA downlink packet scheduling. Our goal is to maximize data throughput and fairness among mobile users. Wc formulate packet scheduling as a constrained integer optimization problem, modelling the constraints arising from data rate requirements, power budgets and interference limitations. Given the objective of maximizing the overall carried traffic in a given sector of a cell and power limitations in the neighboring sectors, joint optimization of resource utilization to control packet flow among the interdependent neighboring sectors is considered, and shown to provide higher performance compared to separate optimization in which each sector attempts to maximize the utilization of the available resources under in-cell and out-of-cell power limitations, without taking into account the traffic load among the adjacent sectors. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Makaya, C., & Aïssa, S. (2003). Base station joint scheduling for downlink throughput maximization in CDMA packet data networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2720, 304–315. https://doi.org/10.1007/978-3-540-45076-4_31
Mendeley helps you to discover research relevant for your work.