A cost-efficient scheduling algorithm of on-demand broadcasts

Sun, Weiwei; Shi, Weibin; Shi, Bole and Yu, Yijun (2003). A cost-efficient scheduling algorithm of on-demand broadcasts. Wireless Networks, 9(3) pp. 239–247.

DOI: https://doi.org/10.1023/A:1022877227770

Abstract

In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications including wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the response time of the requests has been used as a performance measure. In this paper we consider the performance as the average cost of request composed of three kinds of costs - access time cost, tuning time cost, and cost of handling failure request. Our main contribution is a self-adaptive scheduling algorithm named LDFC, which computes the delay cost of data item as the priority of broadcast. It costs less compared with some previous algorithms in this context, and shows good adaptability as well even in pure push-based broadcasts.

Viewing alternatives

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions

Item Actions

Export

About

Recommendations