Issue No.04 - April (2014 vol.13)
Bin Fu , Dept. of Comput. Sci., Univ. of Texas-Pan American, Edinburg, TX, USA
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2013.32
Wireless data broadcast is a popular data dissemination method in mobile computing environments because of its capability of concurrently disseminating data to multiple users. In this paper, we study the data retrieval scheduling problem for multi-item requests in multi-channel broadcast environments. To maximize the number of downloads given a deadline, we define a problem called largest number data retrieval (LNDR). We prove the decision problem of LNDR is NP-hard, and we investigate approximation algorithm for it. We also define another problem called minimum cost data retrieval (MCDR), which aims at downloading a set of requested data items with the least response time and energy consumption. We prove MCDR is NP-hard to approximate to within any non-trivial factor. Therefore, we investigate heuristic algorithm for it. Finally we provide simulation results to demonstrate the practical efficiency of the proposed algorithms.
Schedules, Time factors, Switches, Energy consumption, Scheduling, Indexes, Servers,approximability, Multi-channel, wireless data broadcast, multi-item request, data retrieval scheduling, NP-hard
Bin Fu, "Data Retrieval Scheduling for Multi-Item Requests in Multi-Channel Wireless Broadcast Environments", IEEE Transactions on Mobile Computing, vol.13, no. 4, pp. 752-765, April 2014, doi:10.1109/TMC.2013.32