<p>On-demand data broadcast is a kind of practical and efficient broadcast approach, that supports data sharing. In on-demand broadcast environments, broadcasting base stations schedule and broadcast data according to the queries they receive. In some special applications, mobile devices continuously monitor multiple time-varying objects for timely decision-making. Therefore, queries are released continuously and periodically. Unlike traditional approaches limited to single-channel models, we address the unique challenges posed by multi-channel environments, including client-side reception constraints and cross-channel coordination. Our objective is to maximize the query service ratio while minimizing bandwidth utilization. In this paper, we propose the first data broadcast scheduling method for supporting continuous periodic queries in multi-channel on-demand broadcast environments. The new method adopts a global scheduling scheme. Theoretical analysis proves that under the new method, all queries that get services can get all the data they need in time. A set of experiments is conducted to evaluate the performance of proposed approaches in terms of service ratio and bandwidth utilization.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Scheduling periodic queries in multi-channel on-demand broadcasting environments

  • Congying Wu,
  • Xiaofan Song,
  • Zan Li,
  • Xiaoxu Wang,
  • Chen Chen,
  • Jihua Huang

摘要

On-demand data broadcast is a kind of practical and efficient broadcast approach, that supports data sharing. In on-demand broadcast environments, broadcasting base stations schedule and broadcast data according to the queries they receive. In some special applications, mobile devices continuously monitor multiple time-varying objects for timely decision-making. Therefore, queries are released continuously and periodically. Unlike traditional approaches limited to single-channel models, we address the unique challenges posed by multi-channel environments, including client-side reception constraints and cross-channel coordination. Our objective is to maximize the query service ratio while minimizing bandwidth utilization. In this paper, we propose the first data broadcast scheduling method for supporting continuous periodic queries in multi-channel on-demand broadcast environments. The new method adopts a global scheduling scheme. Theoretical analysis proves that under the new method, all queries that get services can get all the data they need in time. A set of experiments is conducted to evaluate the performance of proposed approaches in terms of service ratio and bandwidth utilization.