期刊文献+

Broadcast Scheduling Strategy Based on the Priority of Real-Time Data in a Mobile Environment

Broadcast Scheduling Strategy Based on the Priority of Real-Time Data in a Mobile Environment
下载PDF
导出
摘要 Data broadcast is an important data dissemination approach in mobile environment. On broadcast channel, scalability and efficiency of data transmission are satisfied. In a mobile environment, there exists a kind of real-time database application in which both the transactions and data can have their timing constraints and priorities of different levels. In order to meet the requirement of real-time data disseminating and retrieving, a broadcast scheduling strategy HPF-ED F (Highest Priority First with Earlier Deadline and Frequency) is proposed under the BoD (Broadcast on Demand) model. Using the strategy, data items are scheduled according to their priority the transaction imposed on them or system set for them. The strategy also considers other characteristics of data items such as deadline and popularity of data. The extensive simulation experiments have been conducted to evaluate the performance of the proposed algorithm. Results show that it can achieve excellent performance compared with existing strategies. Data broadcast is an important data dissemination approach in mobile environment. On broadcast channel, scalability and efficiency of data transmission are satisfied. In a mobile environment, there exists a kind of real-time database application in which both the transactions and data can have their timing constraints and priorities of different levels. In order to meet the requirement of real-time data disseminating and retrieving, a broadcast scheduling strategy HPF-ED F (Highest Priority First with Earlier Deadline and Frequency) is proposed under the BoD (Broadcast on Demand) model. Using the strategy, data items are scheduled according to their priority the transaction imposed on them or system set for them. The strategy also considers other characteristics of data items such as deadline and popularity of data. The extensive simulation experiments have been conducted to evaluate the performance of the proposed algorithm. Results show that it can achieve excellent performance compared with existing strategies.
出处 《Wuhan University Journal of Natural Sciences》 EI CAS 2003年第02A期368-372,共5页 武汉大学学报(自然科学英文版)
基金 the National Natural Science Foundation of China(60073045)
关键词 mobile computing REAL-TIME timing constraint PRIORITY broadcast scheduling mobile computing real-time timing constraint priority broadcast scheduling
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部