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: http://dx.doi.org/10.1023/A:1022877227770
Google Scholar: Look up in Google Scholar

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.

Item Type: Journal Article
Copyright Holders: 2003 Kluwer Academic Publishers
ISSN: 1572-8196
Keywords: scheduling algorithm; cost modeling; data broadcast; wireless network; mobile computing
Academic Unit/Department: Mathematics, Computing and Technology > Computing & Communications
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 6941
Depositing User: Yijun Yu
Date Deposited: 20 Feb 2007
Last Modified: 17 Jul 2014 14:49
URI: http://oro.open.ac.uk/id/eprint/6941
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk