Conventional scheduling algorithms assign users to orthogonal sub-channels in order to avoid collisions. However, recent physical-layer advances, such as the compute-and-forward technique, have demonstrated that it is possible to recover a linear combination of packets when a collision occurs. Recently, we proposed a collision scheduling algorithm that exploits this phenomenon to attain higher throughputs. Here, we argue that the complexity of this algorithm can be significantly reduced in the important special case where each cell only overlaps with a constant number of neighboring cells.
Collision Scheduling for Cellular Networks with Spatial Connectivity Constraints
2015-09-01
107359 byte
Conference paper
Electronic Resource
English
Negotiation between Dynamical Systems with Connectivity Constraints
British Library Conference Proceedings | 2017
|Collision Avoidance within Aerodynamic Constraints
British Library Conference Proceedings | 2004
|