The performance of a wireless push-based system relies heavily on the proper scheduling of the broadcast data. Two well known algorithms used to this end are Broadcast Disks and the one proposed by Vaidya and Hameed. Each one has its own advantages and drawbacks but neither of them combines good performance with a low computational complexity. This paper, proposes a new scheduling algorithm for wireless push systems, which performs near optimal and has a computational complexity of O(1). Extensive simulation results are presented that reveal its excellent performance despite its low computational demands.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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




    Publication date :

    2013-11-01


    Size :

    837678 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English