Scheduling cooperative emergency response: or how the meek shall overcome the greedy

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). Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and Design–wireless communication General Terms Algorithms, Performance Keywords Ad hoc networks, cooperative mobility

• Type: Conference
• Year: 2009
• Where: IWCMC
• Authors: Carol Dottin, Bilal Khan
• Keywords: Emergency Responder, Greedy Algorithm, IWCMC 2009, Qualified Emergency Responder