Issue No. 01 - January (2012 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.26
Fangfei Chen , Pennsylvania State University, State College
Matthew P. Johnson , City University of New York, New York
Yosef Alayev , City University of New York, New York
Amotz Bar-Noy , City University of New York, New York
Thomas F. La Porta , Pennsylvania State University, University Park
We consider variations of a problem in which data must be delivered to mobile clients en route, as they travel toward their destinations. The data can only be delivered to the mobile clients as they pass within range of wireless base stations. Example scenarios include the delivery of building maps to firefighters responding to multiple alarms. We cast this scenario as a parallel-machine scheduling problem with the little-studied property that jobs may have different release times and deadlines when assigned to different machines. We present new algorithms and also adapt existing algorithms, for both online and offline settings. We evaluate these algorithms on a variety of problem instance types, using both synthetic and real-world data, including several geographical scenarios, and show that our algorithms produce schedules achieving near-optimal throughput.
Scheduling, mobility, wireless, network, optimization.
T. F. Porta, M. P. Johnson, Y. Alayev, F. Chen and A. Bar-Noy, "Who, When, Where: Timeslot Assignment to Mobile Clients," in IEEE Transactions on Mobile Computing, vol. 11, no. , pp. 73-85, 2011.