An Affinity Path Based Wireless Broadcast Scheduling Approach for Multi-item Queries

  • Authors:
  • Wei Li;Zhuoyao Zhang;Weiwei Sun;Dingding Mao;Jingjing Wu

  • Affiliations:
  • School of Computer Science, Fudan University, Shanghai, China;School of Computer Science, Fudan University, Shanghai, China;School of Computer Science, Fudan University, Shanghai, China;School of Computer Science, Fudan University, Shanghai, China;School of Computer Science, Fudan University, Shanghai, China

  • Venue:
  • APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data broadcasting is accepted as an effective solution to disseminate information to a large number of clients in wireless environments. Data broadcast scheduling attracts extensive attention, especially for multi-item queries. However, most previous works focusing on this issue do not take data replication in broadcast schedule into consideration, which leads to poor performance when the access probability of data items is skewed. In this paper, we proposed an efficient schedule algorithm called the affinity path approach. It firstly creates paths based on affinity of different data items, and then broadcast the paths based on the square root rule with data replication. Experiments prove that our approach reduces the average access time significantly.