This paper proposes a low computational complexity adaptive broadcasting algorithm for asymmetric wireless environments. We assume no a priori knowledge of the clients' demands as happens in real environments. The proposed system focuses on lowering the computational complexity of the server's procedure for selecting a data item to broadcast, as well as adapting to the clients' current demands. Simulation results reveal that the lowering of the computational complexity of the proposed system does not affect the performance perceived by the system clients.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Adaptive push-based data broadcasting in asymmetric wireless environments with low computational complexity


    Contributors:


    Publication date :

    2011-11-01


    Size :

    189511 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    A new algorithm for low-complexity schedule construction in wireless push systems

    Mavridopoulos, Stathis B. / Nicopolitidis, Petros / Papadimitriou, Georgios I. | IEEE | 2013



    Didactical Complexity of Computational Environments for the Learning of Mathematics

    Sutherland, R. / Balacheff, N. | British Library Online Contents | 1999


    Evaluating RaptorQ-Based Content Broadcasting Strategies in Vehicular Environments

    Ortiz, Sergio / Calafate, Carlos T. / Cano, Juan-Carlos et al. | IEEE | 2018