Low Complexity Grouping for Massive Scheduling in 4G Networks

Abstract : In this paper, we investigate user grouping for cooperative scheduling in a two-cell network. When the number of transmitters grows large, the complexity of the Hungarian algorithm optimum for user pairing becomes unaffordable in real-time systems. We consider user grouping algorithms maximizing the network sum rate in cells with a massive number of terminals and/or sensors. We provide a suboptimal user grouping algorithm which substantially reduces complexity compared to the optimum Hungarian algorithm with negligible capacity degradation. Surprisingly, the proposed algorithm outperforms the greedy algorithm with a considerable lower complexity.
Type de document :
Communication dans un congrès
WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.460-464, 2012
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00766305
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mardi 18 décembre 2012 - 10:04:36
Dernière modification le : jeudi 11 janvier 2018 - 06:19:28
Document(s) archivé(s) le : mardi 19 mars 2013 - 03:54:49

Fichier

p460-li.pdf
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : hal-00766305, version 1

Collections

Citation

Qianrui Li, Lusheng Wang, Laura Cottatellucci, Navid Nikaein. Low Complexity Grouping for Massive Scheduling in 4G Networks. WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.460-464, 2012. 〈hal-00766305〉

Partager

Métriques

Consultations de la notice

119

Téléchargements de fichiers

185