Drexel University, Dept of Computer Science, Philadelphia, PA Demonstration: Disaster Evacuation Support Christopher J. Carpenter, Christopher J. Dugan,

Slides:



Advertisements
Similar presentations
Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Advertisements

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.
Philadelphia, PA | May National Homeland Security Conference Awards.
Distributed Constraint Optimization Problems M OHSEN A FSHARCHI.
Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Adopt Algorithm for Distributed Constraint Optimization
Towards a Theoretic Understanding of DCEE Scott Alfeld, Matthew E
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Public Librarians’ Response to Hurricanes: Lessons, Issues and Strategies Rebecca Hamilton State Librarian State Library of Louisiana.
Public Librarians’ Response to Hurricanes: Lessons, Issues and Strategies Rebecca Hamilton State Librarian State Library of Louisiana.
JADE: The Bully Algorithm. Problem Context of distributed computing Problem of leader election: leader election is the process of designating a single.
Information Security and Assurance Center 1 Address: 615 McCallie Avenue Phone: Chattanooga TN 37403
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
Decentralised Coordination of Mobile Sensors using the Max-Sum Algorithm Ruben Stranders, Alex Rogers, Nick Jennings School of Electronics and Computer.
1 Distributed Computing Algorithms CSCI Distributed Computing: everything not centralized many processors.
Carnet: A Scalable Ad Hoc Wireless Network System SIGOPS European Workshop, Authors: Robert Morris, etc., MIT Library of Computer Science Presenter:
Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks Maurice Chu, Horst Haussecker and Feng Zhao Xerox Palo.
Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin CHAPTER FIVE INFRASTRUCTURES: SUSTAINABLE TECHNOLOGIES CHAPTER.
Impact of Problem Centralization on Distributed Constraint Optimization Algorithms John P. Davin and Pragnesh Jay Modi Carnegie Mellon University School.
A Decentralised Coordination Algorithm for Mobile Sensors School of Electronics and Computer Science University of Southampton {rs06r2, fmdf08r, acr,
CS Dept, City Univ.1 Research Issues in Wireless Sensor Networks Prof. Xiaohua Jia Dept. of Computer Science City University of Hong Kong.
Jadavpur University Centre for Mobile Computing & Communication Implementation of Ad-Hoc Mesh Network Presentation by: Sudipto Das Rajesh Roy.
Algorithms for Self-Organization and Adaptive Service Placement in Dynamic Distributed Systems Artur Andrzejak, Sven Graupner,Vadim Kotov, Holger Trinks.
Distributed Constraint Optimization Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University A4M33MAS.
Parts of this work are ©2013 The MITRE Corporation. All rights reserved. Approved for Public Release: Distribution Unlimited. Off-Grid Communications.
SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.
PhD-TW-Colloquium, October 09, 2008Polling systems as performance models for mobile ad hoc networking Ahmad Al Hanbali, Richard Boucherie, Jan-Kees van.
GeoGrid: A scalable Location Service Network Authors: J.Zhang, G.Zhang, L.Liu Georgia Institute of Technology presented by Olga Weiss Com S 587x, Fall.
Robot Autonomous Perception Model For Internet-Based Intelligent Robotic System By Sriram Sunnam.
COLUMBIA UNIVERSITY Department of Electrical Engineering The Fu Foundation School of Engineering and Applied Science IN THE CITY OF NEW YORK Networking.
Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.
Responding effectively to an emergency and building the capacity for special emergency response and relief … OUTCOME AREA 3: Improved Access to Basic Services.
Leader Election Algorithms for Mobile Ad Hoc Networks Presented by: Joseph Gunawan.
NEARBY: HYBRID NETWORK MOBILE APPLICATION Shuai Zhang, Ziwen Zhang, Jikai Yin.
Presented by: Chaitanya K. Sambhara Paper by: Karl Mayer and Wolfgang Fritsche IABG mbH Germany - Instructor : Dr Yingshu Li.
Event-driven, Role-based Mobility in Disaster Recovery Networks The Phoenix Project Robin Kravets Department of Computer Science University of Illinois.
Distributed Computation in MANets Robot swarm developed by James Rice University.
Space-Based Network Centric Operations Research. Secure Autonomous Integrated Controller for Distributed Sensor Webs Objective Develop architectures and.
ROUTING ALGORITHMS IN AD HOC NETWORKS
A Traffic Chaos Reduction Approach for Emergency Scenarios A Traffic Chaos Reduction Approach for Emergency Scenarios Syed R. Rizvi †, Stephan Olariu †,
Patient Monitor Evaluating Disaster Response The Wiisard Project David Kirsh Dept of Cognitive Science, Cal(IT) 2 UCSD What is WIISARD? Wireless Internet.
Locating Mobile Agents in Distributed Computing Environment.
(Place) – (Date) Session 7.1: Supporting Local Capacity in Disaster Management Adapted from presentation developed by Mingalar Myanmar.
Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki MANET (Mobile Ad-hoc.
Internet Real-Time Laboratory Arezu Moghadam and Suman Srinivasan Columbia University in the city of New York 7DS System Design 7DS system is an architecture.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
Virtual Infrastructure By: Andy Chau Farzana Mohsini Anya Mojiri Virginia Nguyen Bobby Phimmasane.
Planning for Reunification. Presenter’s Name June 17, 2003 Multi-Agency Mass Care Templates  Feeding (being revised)  Sheltering/Sheltering Support.
Security in Wireless Ad Hoc Networks. 2 Outline  wireless ad hoc networks  security challenges  research directions  two selected topics – rational.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
The Problem of Location Determination and Tracking in Networked Systems Weikuan Yu, Hui Cao, and Vineet Mittal The Ohio State University.
WASP Airborne Data Processor Laboratory for Imaging Algorithms and Systems Chester F. Carlson Center for Imaging Science Rochester Institute of Technology.
Self-stabilizing energy-efficient multicast for MANETs.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Spatial Networks Introduction to Spatial Computing CSE 5ISC Some slides adapted from Shashi Shekhar, University of Minnesota.
CSE Wireless and Adhoc networks Instructor: Ayman Alharbi Computer Engineering Dept. (Head of dept. ) Why ?
Jordan Population and Housing Census 2015
Extending wireless Ad-Hoc
Supporting Mobile Collaboration with Service-Oriented Mobile Units
Networking & Communications Prof. Javad Ghaderi
Weikuan Yu, Hui Cao, and Vineet Mittal The Ohio State University
An Overview of the ITTC Networking & Distributed Systems Laboratory
Towards Next Generation Panel at SAINT 2002
Distributed Computing:
Client/Server and Peer to Peer
Leveraging AI for Disaster Preparedness and Response
PROJECT IDENTIFICATION
Presentation transcript:

Drexel University, Dept of Computer Science, Philadelphia, PA Demonstration: Disaster Evacuation Support Christopher J. Carpenter, Christopher J. Dugan, Evan A. Sultanik, Joseph B. Kopena, Robert N. Lass, Duc N. Nguyen William C. Regli, Pragnesh Jay Modi

Drexel University, Dept of Computer Science, Philadelphia, PA Disaster Response A major task in disaster relief is evacuating the emergency site FEMA photo Emergency personnel need to determine and coordinate evac routes and reception centers

Drexel University, Dept of Computer Science, Philadelphia, PA Problem Definition Goal: Support first responders and disaster relief workers in planning and managing evacuations –Aiming to be applicable at neighborhood, city, and regional levels Approach: Model the task as a distributed constraint optimization problem (DCOP) running on mobile, wireless systems –Reporting state & assigning evacuation relief centers based on available capacity

Drexel University, Dept of Computer Science, Philadelphia, PA Adopt Agent Approach Agents represent convoy or group leaders choosing evacuation destinations –For this demonstration, each agent is running on a TabletPC connected over a wireless ad-hoc network Adopt is used as the basic DCOP technique –Provides optimal, distributed constraint solving Decentralization reduces infrastructure, fragility –No servers or Internet; peers solving common problem –Potential tolerance to node failure, limited networking

Drexel University, Dept of Computer Science, Philadelphia, PA Evacuation DCOP Groups have various sizes and evacuation needs. Constraints are the capacities of the shelters and the services provided.

Drexel University, Dept of Computer Science, Philadelphia, PA Destinations Assigned Using the Adopt algorithm, each agent coordinates in a decentralized, asynchronous fashion to optimally distribute evacuees.

Drexel University, Dept of Computer Science, Philadelphia, PA AAAI 2007 Demo This work demonstrates: –The application of DCOP modeling and Adopt to emergency management –Research extending Adopt to incorporate network awareness and dynamic worlds Exhibit requirements: –Space & power for ~6 tablet/laptop computers and an external screen or projector (all of which will be brought by the demo team)