The Open UniversitySkip to content

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 (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


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.

Item Type: Journal Item
Copyright Holders: 2003 Kluwer Academic Publishers
ISSN: 1572-8196
Project Funding Details:
Funded Project NameProject IDFunding Body
Not SetGrant No. 69933010National Natural Science Foundation of China
Keywords: scheduling algorithm; cost modeling; data broadcast; wireless network; mobile computing
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Research Group: Centre for Research in Computing (CRC)
Item ID: 6941
Depositing User: Yijun Yu
Date Deposited: 20 Feb 2007
Last Modified: 07 Dec 2018 09:01
Share this page:


Altmetrics from Altmetric

Citations from Dimensions

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU