Who, when, where: Timeslot assignment to mobile clients

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider variations of a problem in which data must be delivered to mobile clients en-route, as they travel towards 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, and the in-transit "illumination" of simultaneous surface-to-air missiles. 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 realworld data, including several geographical scenarios, and show that our algorithms produce schedules achieving near-optimal throughput.

Original languageEnglish (US)
Title of host publication2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09
Pages90-99
Number of pages10
DOIs
StatePublished - Dec 1 2009
Event2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09 - Macau, China
Duration: Oct 12 2009Oct 15 2009

Publication series

Name2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09

Other

Other2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09
CountryChina
CityMacau
Period10/12/0910/15/09

Fingerprint

Surface to air missiles
Base stations
Lighting
Scheduling
Throughput

All Science Journal Classification (ASJC) codes

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

Cite this

Chen, F., Johnson, M. P., Alayev, Y., Bar-Noy, A., & La Porta, T. F. (2009). Who, when, where: Timeslot assignment to mobile clients. In 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09 (pp. 90-99). [5337050] (2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09). https://doi.org/10.1109/MOBHOC.2009.5337050
Chen, Fangfei ; Johnson, Matthew P. ; Alayev, Yosef ; Bar-Noy, Amotz ; La Porta, Thomas F. / Who, when, where : Timeslot assignment to mobile clients. 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09. 2009. pp. 90-99 (2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09).
@inproceedings{4f090c4353244f268c23ddad12d9cc41,
title = "Who, when, where: Timeslot assignment to mobile clients",
abstract = "We consider variations of a problem in which data must be delivered to mobile clients en-route, as they travel towards 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, and the in-transit {"}illumination{"} of simultaneous surface-to-air missiles. 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 realworld data, including several geographical scenarios, and show that our algorithms produce schedules achieving near-optimal throughput.",
author = "Fangfei Chen and Johnson, {Matthew P.} and Yosef Alayev and Amotz Bar-Noy and {La Porta}, {Thomas F.}",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/MOBHOC.2009.5337050",
language = "English (US)",
isbn = "9781424451135",
series = "2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09",
pages = "90--99",
booktitle = "2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09",

}

Chen, F, Johnson, MP, Alayev, Y, Bar-Noy, A & La Porta, TF 2009, Who, when, where: Timeslot assignment to mobile clients. in 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09., 5337050, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09, pp. 90-99, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09, Macau, China, 10/12/09. https://doi.org/10.1109/MOBHOC.2009.5337050

Who, when, where : Timeslot assignment to mobile clients. / Chen, Fangfei; Johnson, Matthew P.; Alayev, Yosef; Bar-Noy, Amotz; La Porta, Thomas F.

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09. 2009. p. 90-99 5337050 (2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Who, when, where

T2 - Timeslot assignment to mobile clients

AU - Chen, Fangfei

AU - Johnson, Matthew P.

AU - Alayev, Yosef

AU - Bar-Noy, Amotz

AU - La Porta, Thomas F.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - We consider variations of a problem in which data must be delivered to mobile clients en-route, as they travel towards 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, and the in-transit "illumination" of simultaneous surface-to-air missiles. 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 realworld data, including several geographical scenarios, and show that our algorithms produce schedules achieving near-optimal throughput.

AB - We consider variations of a problem in which data must be delivered to mobile clients en-route, as they travel towards 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, and the in-transit "illumination" of simultaneous surface-to-air missiles. 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 realworld data, including several geographical scenarios, and show that our algorithms produce schedules achieving near-optimal throughput.

UR - http://www.scopus.com/inward/record.url?scp=74249085177&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=74249085177&partnerID=8YFLogxK

U2 - 10.1109/MOBHOC.2009.5337050

DO - 10.1109/MOBHOC.2009.5337050

M3 - Conference contribution

AN - SCOPUS:74249085177

SN - 9781424451135

T3 - 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09

SP - 90

EP - 99

BT - 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09

ER -

Chen F, Johnson MP, Alayev Y, Bar-Noy A, La Porta TF. Who, when, where: Timeslot assignment to mobile clients. In 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09. 2009. p. 90-99. 5337050. (2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09). https://doi.org/10.1109/MOBHOC.2009.5337050