Profit-based on-demand broadcast scheduling of real-time multi-item requests

On-demand broadcast is a widely accepted approach for dynamic and scalable wireless information dissemination systems. With the proliferation of real-time applications, minimizing the deadline miss ratio in scheduling multi-item requests becomes an emergent task in the current architecture. In this paper, we propose a profit-based scheduling algorithm, called PVC, which utilizes two new concepts "profit" of a data item and "opportunity cost" of a request. Note that, to the best of our knowledge, it is also the first time to introduce opportunity cost, which is derived from economics, into on-demand scheduling. Finally, the simulation results show the great improvement in comparison with traditional algorithms. On average, PVC has more than 5% advantage in terms of deadline miss ratio than the best of others.