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

Carol Dottin; Bilal Khan

doi:10.1145/1582379.1582509

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

Carol Dottin, Bilal Khan

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
Pages	598-602
Number of pages	5
DOIs	https://doi.org/10.1145/1582379.1582509
State	Published - 2009
Externally published	Yes
Event	2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 - Leipzig, Germany Duration: Jun 21 2009 → Jun 24 2009

Publication series

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

Other

Other	2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
Country/Territory	Germany
City	Leipzig
Period	6/21/09 → 6/24/09

Keywords

Ad hoc networks
Cooperative mobility

ASJC Scopus subject areas

Computer Networks and Communications
Computer Science Applications
Software

Access to Document

10.1145/1582379.1582509

Cite this

Dottin, C., & Khan, B. (2009). Scheduling cooperative emergency response (or how the Meek shall overcome the Greedy). In Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 (pp. 598-602). (Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009). https://doi.org/10.1145/1582379.1582509

Scheduling cooperative emergency response (or how the Meek shall overcome the Greedy). / Dottin, Carol; Khan, Bilal.
Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. 2009. p. 598-602 (Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Dottin, C & Khan, B 2009, Scheduling cooperative emergency response (or how the Meek shall overcome the Greedy). in Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009, pp. 598-602, 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009, Leipzig, Germany, 6/21/09. https://doi.org/10.1145/1582379.1582509

Dottin C, Khan B. Scheduling cooperative emergency response (or how the Meek shall overcome the Greedy). In Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. 2009. p. 598-602. (Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009). doi: 10.1145/1582379.1582509

@inproceedings{dc92da606f684d40a8aa6911977b3ae3,

title = "Scheduling cooperative emergency response (or how the Meek shall overcome the Greedy)",

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).",

keywords = "Ad hoc networks, Cooperative mobility",

author = "Carol Dottin and Bilal Khan",

year = "2009",

doi = "10.1145/1582379.1582509",

language = "English (US)",

isbn = "9781605585697",

series = "Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009",

pages = "598--602",

booktitle = "Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009",

note = "2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 ; Conference date: 21-06-2009 Through 24-06-2009",

}

TY - GEN

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

AU - Dottin, Carol

AU - Khan, Bilal

PY - 2009

Y1 - 2009

N2 - 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).

AB - 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).

KW - Ad hoc networks

KW - Cooperative mobility

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

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

U2 - 10.1145/1582379.1582509

DO - 10.1145/1582379.1582509

M3 - Conference contribution

AN - SCOPUS:70450240882

SN - 9781605585697

T3 - Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009

SP - 598

EP - 602

BT - Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009

T2 - 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009

Y2 - 21 June 2009 through 24 June 2009

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this