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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Collision Scheduling for Cellular Networks with Spatial Connectivity Constraints


    Contributors:
    He, Wenbo (author) / Feng, Chen (author) / Nazer, Bobak (author)


    Publication date :

    2015-09-01


    Size :

    107359 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Scheduling in D2D Underlaid Cellular Networks with Deadline Constraints

    Li, Yi / Gursoy, M. Cenk / Velipasalar, Senem | IEEE | 2016


    Trajectory Optimization for Cellular-Enabled UAV with Connectivity and Battery Constraints

    Im, Hyeon-Seong / Kim, Kyu-Yeong / Lee, Si-Hyeon | IEEE | 2023


    Deep Learning-based Multi-Connectivity Optimization in Cellular Networks

    Hernandez-Carlon, J. J. / Perez-Romero, J. / Sallent, O. et al. | IEEE | 2022


    Negotiation between Dynamical Systems with Connectivity Constraints

    shoushan, Yaniv Ben / Zelazo, Daniel | British Library Conference Proceedings | 2017


    Collision Avoidance within Aerodynamic Constraints

    Penney, R. W. / University of Bristol / Cranfield Institute of Technology et al. | British Library Conference Proceedings | 2004