Wireless network and mobile computing
In mobile wireless systems data on air can be accessed by a large number of
mobile users. Many of these applications such as 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 for broadcast. It performs
well compared with some previous algorithms in this context.
The work has been published in the ACM Journal of Wireless
Network. An earlier short paper was presented to the MSWiM
workshop in conjunct with the MobiCom 2001 conference, Rome.