Time series: theory and methods
Time series: theory and methods
Integer and combinatorial optimization
Integer and combinatorial optimization
Resource allocation between persistent and transient flows
IEEE/ACM Transactions on Networking (TON)
Optimal timeslot and channel allocation considering fairness for multicell CDMA/TDD systems
Computers and Operations Research
Admission control in T/CDMA systems supporting voice and data applications
IEEE Transactions on Wireless Communications
Slot-Splitting TDD-CDMA for Cellular Wireless Networks
IEEE Transactions on Wireless Communications
Recent advances on TD-SCDMA in China
IEEE Communications Magazine
A vision from the future: beyond 3G TDD
IEEE Communications Magazine
CDMA/TDD system for wireless multimedia services with traffic unbalance between uplink and downlink
IEEE Journal on Selected Areas in Communications
Comparison of time slot allocation strategies for CDMA/TDD systems
IEEE Journal on Selected Areas in Communications
Local predictive resource reservation for handoff in multimedia wireless IP networks
IEEE Journal on Selected Areas in Communications
Interference-Adaptive Fast Dynamic Channel Allocation in TD-SCDMA System
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
Slot allocation in a CDMA/TDD cellular network, which decomposes a frame into uplink and downlink slots, is a multi-dimensional optimization problem involving all the cells in the system due to interference between cells. However, the complexity of the problem makes it computationally too expensive to solve simultaneously for all the cells in a system of reasonable size. In this paper, we propose a novel predictive and distributed slot allocation scheme for transporting multimedia traffic over CDMA/TDD cellular networks with multiple cells, designed to maximize a general utility function that is (strictly) concave increasing. We formulate the utility-maximizing slot allocation problem as a nonlinear integer programming problem, and provide a solution that can be realized efficiently in a distributed manner. Also, we derive sufficient conditions for a real-number solution to be optimal and develop an efficient algorithm to find a near-optimal integer solution. The effectiveness of the integer solution is demonstrated by showing that its gap with the optimal solution is small. We show by experiments that the proposed predictive method has a sufficient accuracy when there are many active users in cells. Extensive simulation results show that the proposed distributed slot allocation method performs very well in comparison to an existing method.