Who, when, where: Timeslot assignment to mobile clients

Fangfei Chen, Matthew P. Johnson, Yosef Alayev, Amotz Bar-Noy, Thomas F. La Porta

Research output: Contribution to journalArticle

14 Scopus citations

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.

Original languageEnglish (US)
Article number5710944
Pages (from-to)73-85
Number of pages13
JournalIEEE Transactions on Mobile Computing
Volume11
Issue number1
DOIs
StatePublished - Jan 1 2012

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this