Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, December 18, 2012 - 10:04:36 AM
Last modification on : Thursday, January 11, 2018 - 6:19:28 AM
Long-term archiving on: : Tuesday, March 19, 2013 - 3:54:49 AM


Explicit agreement for this submission


  • 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⟩



Record views


Files downloads