A cost-efficient scheduling algorithm of on-demand broadcasts 2001 4 citations ? 0 self


     Related Videos

     Related Groups

  •  Doc. Url:    Embed Code: 

  • citeseer  status
    (0) (0 Votes)
    Views: (1033)  
    Date:
    (08-04-09)  
    Pages:
    ()
  • Author:  by Weiwei Sun, Weibin Shi, Bole Shi, Wenyun Ji, Yijun Yu

  • Abstract:  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.

Write a Comment
     Related Documents
What
  • What

  • spin-orbit coupling for magnetic prop erties




























 

Powered free by PHPmotion