Abstract

We consider wireless interactive data broadcasting environments consisting of the broadcast channel for data dissemination and the communication channels for client requests. Modeling client impatience as the soft deadline of client requests, we propose a broadcast scheduling based on a combination of periodic scheduling and priority-based scheduling. The server partitions data items into hot and cold-item sets according to the optimized cut-off point. We apply periodic and priority-based scheduling to hot and cold item sets, respectively, in order to maximize the average utility of the items. We investigate the optimized cut-off point by analyzing the average utility of items as a function of the cut-off point. Simulation results show that our proposed algorithm outperforms existing methods in various circumstances in terms of average utility as well as average response time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call