Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2016, Article ID 9371563, 14 pages
Research Article

Minimizing the Average Waiting Time of Unequal-Size Data Items in a Mobile Computing Environment

Department of Computer Science and Information Management, Hungkuang University, Taichung 43302, Taiwan

Received 8 November 2015; Revised 19 February 2016; Accepted 29 February 2016

Academic Editor: Lingjie Duan

Copyright © 2016 Jen-Ya Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


In a mobile computing environment, waiting time is an important indicator of customer satisfaction. In order to achieve better customer satisfaction and shorter waiting times, we need to overcome different constraints and make the best use of limited resources. In this study, we propose a minimization problem, allocating unequal-size data items to broadcast channels with various bandwidths. The main idea is to solve the problem in the continuous space . First, we map the discrete optimization problem from to . Second, the mapped problem is solved in optimally. Finally, we map the optimal solution from back to . With the theoretical analyses, we can ensure the solution quality and execution speed. Computational experiments show that the proposed algorithm performs well. The worst mean relative error can be reduced to 0.353 for data items with a mean size of 100. Moreover, almost all the near-optimal solutions can be obtained within 1 millisecond, even for , where is the number of data items, that is, the problem size.