The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2012 vol.11)
pp: 73-85
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
ABSTRACT
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.
INDEX TERMS
Scheduling, mobility, wireless, network, optimization.
CITATION
Fangfei Chen, Matthew P. Johnson, Yosef Alayev, Amotz Bar-Noy, Thomas F. La Porta, "Who, When, Where: Timeslot Assignment to Mobile Clients", IEEE Transactions on Mobile Computing, vol.11, no. 1, pp. 73-85, January 2012, doi:10.1109/TMC.2011.26
REFERENCES
[1] J. Jing, A.S. Helal, and A. Elmagarmid, “Client-Server Computing in Mobile Environments,” ACM Computing Surveys, vol. 31, no. 2, pp. 117-157, 1999.
[2] J. Ott and D. Kutscher, “Drive-Thru Internet: IEEE 802.11 b for ‘Automobile’ Users,” Proc. IEEE INFOCOM, vol. 1, 2004.
[3] V. Bychkovsky, B. Hull, A. Miu, H. Balakrishnan, and S. Madden, “A Measurement Study of Vehicular Internet Access Using in Situ Wi-Fi Networks,” Proc. ACM MobiCom, p. 61, 2006.
[4] Y. Zhang, J. Zhao, and G. Cao, “Service Scheduling of Vehicle-Roadside Data Access,” Mobile Networks and Applications, vol. 15, no. 1, pp. 83-96, 2010.
[5] P. Brucker, Scheduling Algorithms. Springer, 2004.
[6] J. Burgess, B.N. Levine, R. Mahajan, J. Zahorjan, A. Balasubramanian, A. Venkataramani, Y. Zhou, B. Croft, N. Banerjee, M. Corner, and D. Towsley, “CRAWDAD Data Set Umass/Diesel (v. 2008-09-14),” http://crawdad.cs.dartmouth.edu/umassdiesel , Sept. 2008.
[7] U. lee, E. Magistretti, M. Gerla, P. Bellavista, and A. Corradi, “Dissemination and Harvesting of Urban Data Using Vehicular Sensing Platforms,” IEEE Trans. Vehicular Technology, vol. 58, no. 2, pp. 882-901, Feb. 2009.
[8] A. Balasubramanian, B. Levine, and A. Venkataramani, “Enhancing Interactive Web Applications in Hybrid Networks,” Proc. ACM MobiCom, pp. 70-80, 2008.
[9] S. Jiang and N. Vaidya, “Scheduling Data Broadcast to ‘Impatient’ Users,” Proc. ACM First Int'l Workshop Data Eng. for Wireless and Mobile Access (MobiDe '99), p. 59, 1999.
[10] J. Xu, X. Tang, and W. Lee, “Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 1, pp. 3-14, Jan. 2006.
[11] B. Krishnamurthy, C. Wills, and Y. Zhang, “On the Use and Performance of Content Distribution Networks,” Proc. First ACM SIGCOMM Workshop Internet Measurement, pp. 169-182, 2001.
[12] Y. Lee and H. Sherali, “Unrelated Machine Scheduling with Time-Window and Machine Downtime Constraints: An Application to a Naval Battle-Group Problem,” Annals of Operations Research, vol. 50, pp. 339-365, 1994.
[13] B. Simons and M. Warmuth, “A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs,” SIAM J. Computing, vol. 18, no. 4, pp. 690-710, Aug. 1989.
[14] R. He, “Parallel Machine Scheduling Problem with Time Windows: A Constraint Programming and Tabu Search Hybrid Approach,” Proc. Fourth Int'l Conf. Machine Learning and Cybernetics, 2005.
[15] A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, “Approximating the Throughput of Multiple Machines in Real-Time Scheduling,” SIAM J. Computing, vol. 31, no. 2, pp. 331-352, 2001.
[16] P. Berman and B. DasGupta, “Multi-Phase Algorithms for Throughput Maximization for Real-Time Scheduling,” J. Combinatorial Optimization, vol. 4, no. 3, pp. 307-323, 2000.
[17] N.G. Hall and M.J. Magazine, “Maximizing the Value of a Space Mission,” European J. Operational Research, vol. 78, no. 2, pp. 224-241, 1994.
[18] M.E. Dyer and L.A. Wolsey, “Formulating the Single Machine Sequencing Problem with Release Dates as a Mixed Integer Program,” Discrete Applied Math., vol. 26, nos. 2/3, pp. 255-270, 1990.
[19] J.M. van den Akker, C.A.J. Hurkens, and M.W.P. Savelsbergh, “Time-Indexed Formulations for Machine Scheduling Problems: Column Generation,” INFORMS J. Computing, vol. 12, no. 2, pp. 111-124, 2000.
[20] P. Brucker and S.A. Kravchenko, “Preemption Can Make Parallel Machine Scheduling Problems Hard,” Osnabrucker Schriften zur Mathematik, Reihe P, 1999.
[21] M.H. Rothkopf, “Scheduling Independent Tasks on Parallel Processors,” Management Science, vol. 12, no. 5, pp. 437-447, 1966.
[22] E.L. Lawler and J.M. Moore, “A Functional Equation and its Application to Resource Allocation and Sequencing Problems,” Management Science, vol. 16, no. 1, pp. 77-84, 1969.
[23] J. Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MobiCom, pp. 85-97, 1998.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool