Program > By speacker > Adasme Pablo

Scheduling in wireless OFDMA-TDMA networks using variable neighborhood search metaheuristic
Pablo Adasme  1@  , Abdel Lisser  2@  , Chen Wang  2@  , Ismael Soto  1@  
1 : Departamento de Ingenier´ıa El´ectrica
2 : Laboratoire de Recherche en Informatique
Université de Paris-Sud Orsay

In this talk, we present a hybrid resource allocation model for OFDMATDMA wireless networks and an algorithmic framework using a Variable Neighborhood Search metaheuristic approach for solving the problem. The model is aimed at maximizing the total bandwidth channel capacity of an uplink OFDMA-TDMA network subject to user power and subcarrier assignment constraints while simultaneously scheduling users in time. As such, the model is best suited for non-real time applications where subchannel multiuser diversity can be further exploited simultaneously in frequency and in time domains. The VNS approach is constructed upon a key aspect of the proposed model, namely its decomposition structure. Our numerical results show tight bounds for the proposed algorithm, e.g. less than 2% in most of the instances. Finally, the bounds are obtained at a very low computational cost.

Online user: 1