Low Complexity Grouping for Massive Scheduling in 4G Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Low Complexity Grouping for Massive Scheduling in 4G Networks

Lusheng Wang
  • Function : Author
  • PersonId : 879132
Laura Cottatellucci
  • Function : Author
  • PersonId : 1141113
Navid Nikaein
  • Function : Author
  • PersonId : 868226


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.
Fichier principal
Vignette du fichier
p460-li.pdf (531.06 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

hal-00766305 , version 1 (18-12-2012)


  • HAL Id : hal-00766305 , version 1


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. ⟨hal-00766305⟩
101 View
211 Download


Gmail Facebook X LinkedIn More