Scheduling cooperative emergency response (or how the Meek shall overcome the Greedy)

Carol Dottin, Bilal Khan

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

Abstract

We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Meek. schedulers: the Greedy algorithm schedules the closest available qualified emergency responder to a task, while the Meek algorithm, assigns the qualified emergency responder that minimizes the expected future cost of the Greedy algorithm. We show that to be effective emergency response scheduling must take into consideration future costs (as the Meek algorithm does), and not merely instantaneous costs (as the Greedy algorithm does).

Original languageEnglish (US)
Title of host publicationProceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
Pages598-602
Number of pages5
DOIs
StatePublished - 2009
Event2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 - Leipzig, Germany
Duration: Jun 21 2009Jun 24 2009

Publication series

NameProceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009

Other

Other2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
CountryGermany
CityLeipzig
Period6/21/096/24/09

Keywords

  • Ad hoc networks
  • Cooperative mobility

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Scheduling cooperative emergency response (or how the Meek shall overcome the Greedy)'. Together they form a unique fingerprint.

Cite this