Algebraic algorithm for scheduling data retrieval in multi-channel wireless data broadcast environments

  • Authors:
  • Xiaofeng Gao;Zaixin Lu;Weili Wu;Bin Fu

  • Affiliations:
  • Department of Computer Science and Engineering, Shanghai JiaoTong University, Shanghai, P.R. China;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;University of Texas-Pan American, Edinburg, TX

  • Venue:
  • COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Due to more and more customers keen on mobile services, we may face the mobile network congestion problem. Therefore, it is necessary to develop new data retrieval method to provide users with reliable and timely access to the data scourers. In this paper, we study the scheduling problem for retrieving data from multi-channel data broadcast environments. In general conditions, the most important two issues for queries in mobile computing systems are the energy cost and the query response time. In order to improve the query efficiency, we develop a randomized algebraic algorithm that takes both energy cost and access time into consideration to schedule the data retrieval process in multi-channel environments. It can be used in almost any broadcast environment, in which the data access frequencies, data sizes, and channel bandwidths can all be non-uniform.