Förderverein Technische Fakultät, profile picture
Uploaded byFörderverein Technische Fakultät
1,322 views

Mobile Networking Solutions for First Responders

This document describes research on using mobile relays to improve connectivity for first responders. It discusses: 1) The need for reliable communication networks for first responders during incidents, as their radio systems often lose connectivity. 2) Using droppable wireless relays to extend the range of communication networks and improve connectivity between first responders and base stations. 3) Methods for optimally placing relays, including constrained placement using integer programming to minimize the number of relays needed, and unconstrained placement using a stitch-and-prune algorithm.

Embed presentation

Downloaded 27 times
MOBILE NETWORKING SOLUTIONS FOR FIRST RESPONDERS Klara Nahrstedt (klara@illinois.edu) Department of Computer Science University of Illinois at Urbana- Champaign 1 Joint work with Dr. Ying Huang, Dr. Wenbo He, Dr. Yan Gao, Dr. Whay Lee
FIRST RESPONDER MOBILE SYSTEMS (FRS) EMS Sep. 11’01 Firefighter Katrina’05 First Responder Police 2 East Amarillo Complex’06
FIRST RESPONDER SYSTEM – NETWORK MODEL  Extended Area Network  Jurisdiction Area DB Network 911 Dispatch Center JAN Police  Incident Area Network  Wireless communication system (MANET) IAN IC  Mobile devices, droppable EAN devices, vehicles PAN  Incident command system  Command center (CC) at a vehicle JANEMS  Personal Area Network  Sensors, RFID, cameras, microphone, mobile devices  Health/equipment monitoring and environmental surveillance 3
OUTLINE  RelayPlacement In Unpredictable Environments  Problem Description  Polymorphic Networks  Optimal Relay Placement  Solutions  Constrained Relay Placement  Unconstrained Relay Placement  Evaluation  Brief Overview of other MONET group projects 4
PROBLEM: CRITICALITY OF BASE STATION CONNECTIVITY IN FR ENVIRONMENTS  Goal: Interconnecting Base stations (BS) with Command Center (CC) to improve command coverage  Reliable control channel  Satellite, cellular, mesh, Internet portal  Real-time data flow DTN  Monitor/Report from FRs  Location tracking / health / voice MANET / surveillance  Control/Info from CC  Resource data, coordination, command control channel  We need persistent Base Station (BS) connectivity. 5
DISMAYED TRUTH  D.C. emergency response officers quote:  Their radio systems would not operate in the underground tunnels of the Metro system.  Radio communication often falls out of range  Mine, tunnel, caves  High-rise buildings  Cargo ships (metal)  Signal Degradation  Multipath fading  Interference  Obstacles 6
DISCONNECTED WIRELESS NETWORK NUMERICAL RESULTS FROM SIMULATION  Large incident area  Small # of FRs  Large-scale fading  Being mission-oriented, FRs are  Separately from others  Disconnected from BSes  BS connectivity metric at a sampled time t is the percentage of FRs, who have c BS connectivity F(c) = Fraction of sampled BS Connectivity  time instances, when BS For 80% time, less than 22% connectivity metric is lower FRs have connectivity to BSes. than c 7
DROPPABLE RELAYS TO IMPROVE CONNECTIVITY  Affordable wireless relays  Communication devices, bread crumbs whose exclusive function is to forward packets for terminals, base stations and other relays, whenever needed.  Static relays  No need to maintain BS connectivity for isolated relays. 8
OPTIMAL RELAY PLACEMENT SCHEME  Relay placement scheme  Dropped locations for relays  # of relays  Optimal relay placement scheme  Minimum number of relays  Relays are resources. We need to concern about  Number: A finite # in total  Weight: A FR can only carry a small # of relays  Optimal placement scheme is case by case  BS connectivity for all snapshots of network topologies – polymorphic networks 9
OPTIMAL RELAY PLACEMENT SCHEME  Relay placement scheme  Dropped locations for relays  # of relays  Optimal relay placement scheme  Minimum number of relays  Relays are resources. We need to concern about  Number: A finite # in total  Weight: A FR can only carry a small # of relays  Optimal placement scheme is case by case  BS connectivity for all snapshots of network topologies – polymorphic networks 10
USAGE OF TOPOLOGY-AWARE RELAY PLACEMENT  Offline - Analysis  Input: Discrete-ized mobility traces  Output: Performance reference for online algorithms  Online - Incident preparation and planning phase  Input: Critical topology snapshots to maintain connectivity  Major events and dispatch commands  FRs’ behavior coded by training  Output: Relay placement scheme (+ movement)  Predictability 8:3 0 8:0 0  Assumption: no hostile environment 8:0 0 11
CONSTRAINED RELAY PLACEMENT (CRP)  Relays are placed at a subset of candidate locations  Safe distance between adjacent relays  Region-correlated crash/failure (fire, flood)  Forbidden areas  Impenetrable areas, obstacles  A deployment scheme: the set of candidate relay places RP 12 Grid Hexagon
GRAPH REPRESENTATION FOR CRP  A graph per topology  Vertex set  Edge set  For a terminal,  finding a multi-hop path towards at least one BS Equivalent  finding a multi-hop path towards M. 13
1-BS-CONNECTIVITY  Node-weighted Steiner tree  Unit weight for relays; 0 weight for other nodes  Commodity flow from MC to terminals  1 unit towards each terminal  Place relays at places  commodities can flow via relays 14 Minimum node-weighted Steiner tree (8)
OPTIMIZATION FORMULATION (1)  Single topology Flow conservation constraint Switch constraint Place relay or not at location p Flow amount on edge ij 15
OPTIMIZATION FORMULATION (2)  Multiple topologies min ∑y p∈ RP p | T t |, i=M  s.t. ∑t xij − ∑ x tji =1, t  − i ∈T t j:ij∈E j: ji∈E t  0, otherwise  ∑ xtpj ≤ | T t | y p , ∀p ∈ RP j: pj∈E t y p ∈ {0,1} xij ∈ [0, | T t |] t 16
UNEVEN LOAD ON BASE STATIONS  Cause congestion around heavily loaded BSes  Waste connectivity around lightly loaded BSes Topology 1 Topology 2 17
OPTIMIZATION FORMULATION (3) min ∑y p∈ RP p | T t |, i=M  s.t. ∑t xij − ∑ x ji =1, t t  − i ∈T t j:ij∈E j: ji∈E t  0, otherwise  ∑ xtpj ≤ | T t | y p , ∀p ∈ RP j: pj∈E t ∑ xij ≤ li | T t |, t ∀i ∈ {T t , B, RP} Load balance constraint j:ij∈E t y p ∈ {0,1} xij ∈ [0, | T t |] t 18
BALANCED LOAD  li=0.5 Topology 1 Topology 2 19
SOLVING MIP (MIXED INTEGER PROGRAMMING) EFFICIENTLY  NP-hard  Integer Programming Algorithm (IPA)  Linear relaxation with sequential rounding  Prune process  Advantage of IPA  Holistic view across topologies  Load balance  Environmental factors  Obstacles, irregular transmission range, 2D to 3D  Flexible cost defined for a candidate relay place  Installation cost, reliability 20
UNCONSTRAINED RELAY PLACEMENT  Relays are placed anywhere in network  Steinerization approach  1) Minimum spanning tree among terminals and BSes  2) Steinerization  Break edges into pieces with length of at most transmission range 21
STITCH-AND-PRUNE ALGORITHM  Steinerize each topology separately T1 T2  Combine relays for all topologies  Prune redundant ones 22
PERFORMANCE EVALUATION (1)  Square network area  2 BSes  TxRange = 100m (default)  Constrained relay placement with regular grid (100m)  Average over 20 randomly generated scenarios for each configuration IPA Integer programming algorithm w.o. load balance IPALB Integer programming algorithm w.t. load balance 23 SPA Stitch-and-prune algorithm
PERFORMANCE EVALUATION (2)  Number of relays Same density () = 100 () = 200 24
PERFORMANCE EVALUATION (3)  Gain of global optimization over multiple topologies 25
CONCLUSION  Relay placement for reliable base station communication  Constrained relay placement Integer programming formulation based on network flow 26   Unconstrained relay placement  Stitch-and-prune algorithm Constrained Model capability Optimization overhead (IPA) Unconstrained Simple Cannot handle obstacles, load balance, (SPA) algorithm; etc. Preli m Run fast Local optimization; prune by redundancy Exa m, Nov 16th
REFERENCES  W. He, Y. Huang, K. Nahrstedt, W. C. Lee, “Mobi-Herald: Alert Propagation in Mobile Ad Hoc Networks”, ACM Mobicom 2007 (Poster Session), Montreal, Canada, Sept. , 2007  Y. Huang, W. He, K. Nahrstedt, W. C. Lee, “Requirements and System Architecture Design Consideration for First Responder Systems”, IEEE Conference on Technologies for Homeland Security Conference, Waltham, MA, May 2007  Y. Huang, W. He, K. Nahrstedt, W. Lee, “Incident Scene Mobility Analysis”, 2008 IEEE Int’l Conf. on Technologies for Homeland Security, Boston, MA, May 2008.  Y. Huang, W. He, K. Nahrstedt, W. Lee, “CORPS: Event-Driven Mobility Model for First Responders in Incident Scene”, IEEE MILCOM 2008, San Diego, CA, November 2008  Y. Huang, Y. Gao, K. Nahrstedt, “Relay Placement for Reliable Base Station Connectivity in Polymorphous Networks, IEEE SECON 2010  T. Pongthawornkamol, S. Ahmed, A. Uchiyama, K. Nahrstedt, “Zero- knowledge Real-time Indoor Tracking via Outdoor Wireless Directional 27 Antennas”, IEEE Percom’10 , Germany. March 2010  (all papers are at http://cairo.cs.uiuc.edu/publications )
OUTLINE  RelayPlacement In Unpredictable Environments  Brief Overview of other MONET group projects 28
MONET GROUP OVERVIEW  Department of Computer Science, University of Illinois at Urbana-Champaign  http://cs.illinois.edu  MONET Group Website  http://cairo.cs.uiuc.edu  8 PhDs in Fall 2011  3 Master Students in Fall 2011  Active Research Areas  Mobile Systems  Mobile learning communities  First responders system  Mobility patterns and data dissemination in P2P mobile systems  3D Tele-immersive Systems  View-casting  Monitoring and diagnosis in 3DTI  Multi-sender/multi-receiver synchronization  H-media – holistic multi-stream resource management for distributed immersive applications  Trustworthy Critical Infrastructures  QoS systems and protocols in SCADA systems  Jamming and security in SCADA systems
MOBILE SYSTEMS - JYOTISH Characterizing and Leveraging Movement of People
PERVASIVE MOBILE ENVIRONMENTS AND COMMUNITIES
HOW DO WE MEASURE, CHARACTERIZE AND LEVERAGE PEOPLE MOVEMENT 1. Decide on Tracking Methodology 2. Determine Tracking Parameters 3. Collect Tracking Measurements (Mobility Traces) 4. Characterize Mobility Patterns 5. Leverage Mobility for 1. Mobility Prediction 2. Content Distribution
1. DECIDE ON TRACKING METHODOLOGIES  Surveys/Questionnaires  Surveillance via Video Cameras  New Tracking Methods via mobile devices such as  Cellular Device Monitoring  WiFi Device Monitoring  Bluetooth Device Monitoring  Sound Monitoring  Combination of Tracking methods
2. DETERMINE TRACKING PARAMETERS  Contact Parameters  Probability of contact (encounter)  Duration of contact  Frequency of contact  Environment Parameters  Tracking number of days  Period of scanning (accuracy of tracked data)  Homogeneity of mobility patterns  Mobile Device Parameters  Speed of person carrying mobile device  Density of mobile devices
3. COLLECT TRACE EXAMPLE: TRACKING VIA UIM University Campus UIM – University of Illinois Movement  Collects MAC addresses of Wifi APs and Bluetooth- enabled devices  Wifi AP MACs are used to infer location information  Bluetooth MACs are used to infer social contact  Deployed on Android phones carried by professors, staff, and students from March to August 2010  UIM trace available online!!!! http://dprg.cs.uiuc.edu/downloads
4. CHARACTERIZING PEOPLE MOVEMENT FOUND IN UIM TRACE (1)  Location is regular if person visits location at the same time slot for at least half number of days  People visit regular locations (plot is from 50 participants)
5. LEVERAGE (1): UIM-BASED CONSTRUCTION METHOD OF PREDICTIVE MODEL (JYOTISH)
PERFORMANCE OF TOP-K CONTACT PREDICTOR  If at least one contact is predicted correctly, top-k contact predictor is correct  With k=5, 60% of participants have more than 75% of correct contact predictions L. Vu, Q. Do, K. Nahrstedt, “Jyotish: A Novel Framework for Constructing Predictive Model of People Movement from Joint Wifi/Bluetooth Trace”, IEEE Percom 2011 (Mark Weiser Best Paper)
5. LEVERAGE (2): COMMUNITY-BASED DATA ROUTING/FORWARDING PROTOCOL (COMFA)  Observation from UIM traces  People make regular social contacts in their daily activities and form social communities and share interests such as music or sports  Approach PROPHET 3R 0.3 0.1 0.1 0.9 0.5 0.7 0.5 0.15 0.4 0.2 0.8 0.1 0.2 0.2 0.2 0.3 time slot1 slot2 slot3 time
3R RESULTS: DELIVERY RATIO • Settings • 100 senders/receivers via 9 phones carried by MONET research group members from March 01 to March 20, 2010 • Message delay deadline 12 hours • Each node has 20 days of trace 3R PROPHET EPIDEMIC  Epidemic performs best due to its flooding nature  Epidemic outperforms 3R by 10%  3R outperforms Prophet by 9%
TEEVE – -ENVIRONMENTS FOR EVERYBODY 3D Tele-immersion
HIGH-LEVEL VISION – MAKING DISTANCE IRRELEVANT AND TELE-IMMERSION FOR EVERYBODY (TEEVE) 4 Photo courtesy of Prof. Ruzena Bajcsy. 2
Static Immersive Spaces for Physiotherapy 43
MULTI-PARTY TELE-IMMERSIVE D ACTIVITY SYSTEMS D C C C C SG SG session Internet controller SG D D SG SG C D C D D C C C 4 4 SG service gateway D 3D display C 3D camera
VIEW-AWARE STREAM DIFFERENTIATION 3D capturing 3D rendering 3D camera 8 8 less important streams 6 2 transmission 6 2 4 4 streams contributing more to user view user view
VIEW-CASTING V2 U2 session controller V1 V3 U3 U4.w U3.w U2.w V4 U4 user view
TRUST IN SCADA SYSTEMS Trustworthy Cyber Infrastructure for Power Grid (TCIPG) Research at University of Illinois, Urbana-Champaign
TCIPG SUMMARY  TCIPG – premier center in USA in the area of trust- worthy cyber-infrastructure for power-grid infrastructures  Trustworthy cyber-infrastructure research for power- grid is now going on  Previous 5 years (NSF) – wealth of knowledge, experiences, scientific results  New 5 years (DOE)  World-leading experts in power engineering are part of TCIPG (Prof. Sauer, Overbye, Gross, Thomas)  World-leading experts in reliability, security and real- time are part of TCIPG (Prof. Sanders, Gunter, Nicol, Nahrstedt, Campbell, Smith, Hauser, Bakken, Khurana, and other experts) 48
THE CHALLENGE: PROVIDING TRUSTWORTHY SMART GRID OPERATION IN POSSIBLY HOSTILE ENVIRONMENTS  Trustworthy  A system which does what is supposed to do, and nothing else  Availability, Security, Safety, …  Hostile Environment  Accidental Failures  Design Flaws  Malicious Attacks  Cyber Physical  Must make the whole system trustworthy, including both physical & cyber components, and their interaction. 49
SMART POWER GRID OF TOMORROW: TRANSMISSION GRID WITH SYNCHROPHASOR SENSORS • NASPI Initiative, funded by DOE and industry, to investigate putting Phasor Measurement Units (PMUs) throughout physical power infrastructure • Need significant changes in power cyber infrastructure to support PMUs • “Class A” service requires low latency, data integrity & availability (“no gaps”) 50
SMART POWER GRID OF TOMORROW: CONTROL OF ELECTRICAL EQUIPMENT AND AN OPEN GRID Consumer Portal: • Security issues are huge – Privacy, billing integrity, Mischief, vandalism, intrusion, Consumer manipulation of system Demand Response: • Extends the Control Loop – Links distribution and transmission – Increases real time requirements – Provides bigger surface for Who is responsible for security? security violations • Consumer? Utility? 51
(MONET RESEARCH) NEED FOR SECURE WIRELESS NETWORKS  No wireless network deployed broadly today in Power Grid (some early adapters – nuclear industry)  EPRI recommendations for usage of wireless technology in substation network architecture (Report, Jan. 2009)  ISA100 standard efforts leveraging other standards, as appropriate, to produce a relevant result in as short a time frame as possible  ISA99 – Security  IEEE 1451 – Smart sensor  FIPS 140-2 – Security  ISO/OSI 7-layer model for network connectivity 52
ALIBI: CONTAINMENT OF JAMMING ATTACKS  Goal • Attack Model  Containment of • Taking into account one jammer jamming attacks with “inside” knowledge Knows shared hopping pattern Requirements 1.  2. Knows any systems’ protocol  Detecting & 3. Uses listen-n-jam strategy Identifying one jammer in the single-hop wireless 5 network with time- 1 slotted communication BS 2 4 3 53
CONCLUSIONS  FRs move in very challenging unstructured environments  FRs with mobile devices represent a challenging mobile ad hoc network that needs to communicate with commanders connected via wireless infrastructure network brought by FRs  Challenges: Deployment of ad hoc and BS communication infrastructure on the incident scene  Placement algorithms needed (offline and online)  Exciting Projects in MONET group exploring  QoS-issues and security issues in critical infrastructures, mobile infrastructures, and 3D multimedia infrastructures 54
ACKNOWLEDGMENTS  The work on first responders is funded by Vodafone fellowship, and Motorola Center and Illinois-Boeing Center funding grants.  The work on Characterizing and Leveraging People Movement is funded by the Illinois-Boeing Center funding grant.  The work on Tele-immersive Systems is funded by the National Science Foundation (NSF).  The work on Trustworthy Communication in 55 SCADA networks is funded by the NSF and Department of Energy (DOE).
Missing part Problem: Efficient in mobile ad hoc networks Alert Service Detection Alert Propagation Reaction  Efficient Alert Message Distribution Watch Dog Pathrater Relatively small FR Environment:  communication overhead   Capable to handle  Mobile Ad-hoc temporary network Networks partition  Problem:  In spite of mobility,  How to trigger the majority of the network can defense against be aware of the alert. malicious attacks in the  Against Collusive whole network after Slander Attacks malicious behavior is detected locally?   Slanderers can issue a DoS Alert Propagation attack easily by defaming other nodes.  Solution: Mobility Assisted 56  Alert Propagation
MOBI-HERALD ARCHITECTURE Confirm alert Threshold-based message m Alert Propagation Verification Management Report received Control alert alert messages propagation Mobility-assisted Epidemic Routing Receive alert Periodically propagate messages alert message m 57
MOBILITY ASSISTED EPIDEMIC ROUTING: ADVANTAGES  Mobility-assisted epidemic routing is able to deliver a message to almost all the nodes even under intermittent network partitions. Flooding protocol cannot deliver message to the whole network if a mobile network is partitioned.  In mobility-assisted epidemic routing, transmissions can be more efficient. Mobility assisted epidemic routing A A B B Flooding 58
EXAMPLE (2) t=t0+T (1) t=t0 (3) t=t0+2T (4) t=t0+3T 59
MOBI-HERALD EPIDEMIC ROUTING: PROTOCOL  A mobile node retransmits a message periodically  A node suppresses transmission if it hears the transmission in the same period (within ∆ time slot). Retransmissions of a message time T T T 60
QUORUM-BASED VERIFICATION  Assuming k is the number of collusive slanders, a node does not actively forward the received alert Unaware message before it received Listening to alert Q (Q>k) copies of the alert ag py De havi messages ess t co em tec or be message. rt m firs ted dir ale he ma ectl an d t lic y of eive iou c s AlertedRe Confirmed Received Q alert messages m Listening to Periodically (assuming Quorum size is Q) more copies of propagate the the m alert message m Received less than Q copies of m 61
ALERT PROPAGATION MANAGER  Balance reliability and efficiency A parameter “Times-to-send (TTS)” is attached in the message header, which indicates how many times an alert should be retransmitted by a mobile herald. Large TTS  large message overhead Small TTS  Small coverage of message delivery  Balance end-to-end delay of alert propagation and efficiency Period of alert propagation “T” Large T  large end-to-end delay Small T  less efficiency of retransmissions 62
SELECTION OF T r Moving direction Location of Location of previous current transmission transmission T 2r Preferably T= vavg 63
SIMULATION RESULTS  Wesimulate Mobi-herald alert propagation protocol under Random Waypoint mobility pattern.  Evaluation Metrics  End-to-end alert message delivery delay  Coverage of an alert message 64
END-TO-END ALERT MESSAGE DELIVERY DELAY (REAL-TIME ALERT) Threshold Q=1 Threshold Q=3 10 35 Delay of alert propagation (minute) Delay of alert propagation (minute) average degree = 2 average degree = 2 9 average degree = 4 average degree = 4 30 average degree = 9 average degree = 9 8 average degree =14 average degree = 14 7 25 6 20 5 15 4 3 10 2 5 1 0 0 20 30 40 20 30 40 Transmission range (meter) Transmission rage (meter) 65
COVERAGE OF MESSAGE DELIVERY Flooding Mobi-Herald N=264 N=442 N=884 N=1326 N=264 N=442 N=884 N=1326 Coverage of message delivery Coverage of message delivery (d=2) (d=4) (d=9) (d=14) (d=2) (d=4) (d=9) (d=14) 1 1 0.8 0.8 0.6 0.6 0.4 0.4 0.2 0.2 0 0 1 2 3 1 2 3 Confirmation threshold Q Confirmation threshold Q 66

More Related Content

PPT
Syncob
byTill Riedel
 
PDF
241 250
byEditor IJARCET
 
PDF
Gq2411921196
byIJERA Editor
 
PPT
Ofdm
byanupmath
 
PDF
Bl32401409
byIJERA Editor
 
PPTX
Ofdm communication system
byASHOK KUMAR/ PAVAN KUMAR
 
PDF
B.Tech Final Project
bysonix022
 
PDF
Ofdm for wireless
bysunil raj kumar
 
Syncob
byTill Riedel
 
241 250
byEditor IJARCET
 
Gq2411921196
byIJERA Editor
 
Ofdm
byanupmath
 
Bl32401409
byIJERA Editor
 
Ofdm communication system
byASHOK KUMAR/ PAVAN KUMAR
 
B.Tech Final Project
bysonix022
 
Ofdm for wireless
bysunil raj kumar
 

What's hot

PDF
Thesis L Leyssenne - November 27th 2009 - Part2
byLaurent Leyssenne
 
PDF
Dq31784792
byIJERA Editor
 
PDF
ASIS CCCT Workshop: Wireless Security & Surveillance
byFiretide
 
PDF
Performance analysis of Multiband - OFDM systems using LDPC coder in pulsed -...
byIDES Editor
 
PPTX
OFDM Basics
byAlwin Poulose
 
PDF
Military Communications Systems
bySpontane_IT
 
PPTX
OFDM (Orthogonal Frequency Division Multiplexing)
byAmeya Vijay Gokhale
 
PPTX
Ad hoc routing
byits
 
PDF
HFC Architecture In The Making
byXiaolin Lu
 
PDF
Cable Infrastructure Evolution
byXiaolin Lu
 
PDF
call for papers, research paper publishing, where to publish research paper, ...
byInternational Journal of Engineering Inventions www.ijeijournal.com
 
PPTX
Ofdm(tutorial)
byGopal Rakecha
 
PDF
115 118
byEditor IJARCET
 
PDF
37 44
byEditor IJARCET
 
PPTX
Concept of Flip OFDM and its applications
byDarshan Bhatt
 
PDF
OFDM for LTE
byMadhumita Tamhane
 
PDF
Ipmc003 2
bySasanka1991
 
PDF
Dw24779784
byIJERA Editor
 
PDF
Omd dibg 2
byHossein Mirzaie
 
Thesis L Leyssenne - November 27th 2009 - Part2
byLaurent Leyssenne
 
Dq31784792
byIJERA Editor
 
ASIS CCCT Workshop: Wireless Security & Surveillance
byFiretide
 
Performance analysis of Multiband - OFDM systems using LDPC coder in pulsed -...
byIDES Editor
 
OFDM Basics
byAlwin Poulose
 
Military Communications Systems
bySpontane_IT
 
OFDM (Orthogonal Frequency Division Multiplexing)
byAmeya Vijay Gokhale
 
Ad hoc routing
byits
 
HFC Architecture In The Making
byXiaolin Lu
 
Cable Infrastructure Evolution
byXiaolin Lu
 
call for papers, research paper publishing, where to publish research paper, ...
byInternational Journal of Engineering Inventions www.ijeijournal.com
 
Ofdm(tutorial)
byGopal Rakecha
 
115 118
byEditor IJARCET
 
37 44
byEditor IJARCET
 
Concept of Flip OFDM and its applications
byDarshan Bhatt
 
OFDM for LTE
byMadhumita Tamhane
 
Ipmc003 2
bySasanka1991
 
Dw24779784
byIJERA Editor
 
Omd dibg 2
byHossein Mirzaie
 

Viewers also liked

PPT
Mobile Networking
byparmsidhu
 
PDF
Manual quali poc test description rf-scanning v10 6
byVictor Alfonso Salas Salazar
 
PPTX
Mobile telecommunication industry
byjanuar siregar
 
PPTX
Mobile Network Testing
byJuris Grantins
 
PPT
Mobile Networking
byparmsidhu
 
PPTX
Evolution of the generations of mobile Communication system.
byMusfiqur Rahman
 
PPTX
5G
byGaurav Kant Yadav
 
PPTX
Evolution of wireless technology 1 g 5g1 (2)
byAdarsh Kumarmn
 
PPTX
5 g technology
byPallapolu Sreenu
 
Mobile Networking
byparmsidhu
 
Manual quali poc test description rf-scanning v10 6
byVictor Alfonso Salas Salazar
 
Mobile telecommunication industry
byjanuar siregar
 
Mobile Network Testing
byJuris Grantins
 
Mobile Networking
byparmsidhu
 
Evolution of the generations of mobile Communication system.
byMusfiqur Rahman
 
5G
byGaurav Kant Yadav
 
Evolution of wireless technology 1 g 5g1 (2)
byAdarsh Kumarmn
 
5 g technology
byPallapolu Sreenu
 

Similar to Mobile Networking Solutions for First Responders

PPTX
Fault tolerant energy aware data dissemination protocol in WSN
byPrajwal Panchmahalkar
 
PDF
.Net project titles 2011, Real time projects in .net, Java Final year project...
bySuresh Radhakrishnan
 
PDF
IEEE final year projects in chennai,MATLAB projects in chennai,Engineering P...
bySuresh Radhakrishnan
 
PDF
Mobile computing projects in chennai,Ns2 projects in chennai,.Net projects in...
bySuresh Radhakrishnan
 
PDF
Java J2EE project titles, .NET project titles with abstract,Java J2EE projec...
bySuresh Radhakrishnan
 
PDF
IEEE Network security projects in chennai,IEEE 2011 titles abstract,NS2 proje...
bySuresh Radhakrishnan
 
PDF
Secure computing projects,Mobile computing projects in chennai,IEEE Network s...
bySuresh Radhakrishnan
 
PDF
.Net project titles 2011, Real time projects in .net, Java Final year project...
bySuresh Radhakrishnan
 
PDF
Project titles abstract
bySuresh Radhakrishnan
 
PDF
Mobile computing projects,Mobile comp/uting projects in java, Mobile computin...
bySuresh Radhakrishnan
 
PDF
Java J2ee project IEEE titles
bySuresh Radhakrishnan
 
PDF
Final year projects in chennai,IEEE 2011 projects titles,TTA
bySuresh Radhakrishnan
 
PDF
Final year projects in chennai,Final year projects at tamilnadu, Final year p...
bySuresh Radhakrishnan
 
PDF
Ns2 projects in chennai,.Net projects in chennai,IEEE 2011 titles,IEEE 2012 t...
bySuresh Radhakrishnan
 
PDF
Project titles abstract
bySuresh Radhakrishnan
 
PPTX
evaluation2.pptx
byadnanmunirkhokhar
 
PPTX
Energy Aware Fault Tolerant SPMS Protocol in Wireless Sensor Networks
byPrajwal Panchmahalkar
 
PDF
Wireless Control Systems - from theory to a tool chain, Mikael Björkbom, Aalt...
byThe Research Council of Norway, IKTPLUSS
 
PPT
November 9, Planning and Control of Unmanned Aircraft Systems in Realistic C...
byUniversity of Colorado at Boulder
 
PDF
Use of NS-2 to Simulate MANET Routing Algorithms
byGiancarlo Romeo
 
Fault tolerant energy aware data dissemination protocol in WSN
byPrajwal Panchmahalkar
 
.Net project titles 2011, Real time projects in .net, Java Final year project...
bySuresh Radhakrishnan
 
IEEE final year projects in chennai,MATLAB projects in chennai,Engineering P...
bySuresh Radhakrishnan
 
Mobile computing projects in chennai,Ns2 projects in chennai,.Net projects in...
bySuresh Radhakrishnan
 
Java J2EE project titles, .NET project titles with abstract,Java J2EE projec...
bySuresh Radhakrishnan
 
IEEE Network security projects in chennai,IEEE 2011 titles abstract,NS2 proje...
bySuresh Radhakrishnan
 
Secure computing projects,Mobile computing projects in chennai,IEEE Network s...
bySuresh Radhakrishnan
 
.Net project titles 2011, Real time projects in .net, Java Final year project...
bySuresh Radhakrishnan
 
Project titles abstract
bySuresh Radhakrishnan
 
Mobile computing projects,Mobile comp/uting projects in java, Mobile computin...
bySuresh Radhakrishnan
 
Java J2ee project IEEE titles
bySuresh Radhakrishnan
 
Final year projects in chennai,IEEE 2011 projects titles,TTA
bySuresh Radhakrishnan
 
Final year projects in chennai,Final year projects at tamilnadu, Final year p...
bySuresh Radhakrishnan
 
Ns2 projects in chennai,.Net projects in chennai,IEEE 2011 titles,IEEE 2012 t...
bySuresh Radhakrishnan
 
Project titles abstract
bySuresh Radhakrishnan
 
evaluation2.pptx
byadnanmunirkhokhar
 
Energy Aware Fault Tolerant SPMS Protocol in Wireless Sensor Networks
byPrajwal Panchmahalkar
 
Wireless Control Systems - from theory to a tool chain, Mikael Björkbom, Aalt...
byThe Research Council of Norway, IKTPLUSS
 
November 9, Planning and Control of Unmanned Aircraft Systems in Realistic C...
byUniversity of Colorado at Boulder
 
Use of NS-2 to Simulate MANET Routing Algorithms
byGiancarlo Romeo
 

More from Förderverein Technische Fakultät

PDF
„Die Klimakrise ist da! Wo führt sie hin?“
byFörderverein Technische Fakultät
 
PDF
Constrained text generation to measure reading performance: A new approach ba...
byFörderverein Technische Fakultät
 
PPTX
Greening local government units: Current status and required competences
byFörderverein Technische Fakultät
 
PDF
Supervisory control of business processes
byFörderverein Technische Fakultät
 
PPTX
The Digital Transformation of Education: A Hyper-Disruptive Era through Block...
byFörderverein Technische Fakultät
 
PDF
A Game of Chess is Like a Swordfight.pdf
byFörderverein Technische Fakultät
 
PDF
From Mind to Meta.pdf
byFörderverein Technische Fakultät
 
PDF
Miniatures Design for Tabletop Games.pdf
byFörderverein Technische Fakultät
 
PPTX
Distributed Systems in the Post-Moore Era.pptx
byFörderverein Technische Fakultät
 
PPTX
Don't Treat the Symptom, Find the Cause!.pptx
byFörderverein Technische Fakultät
 
PDF
Engineering Serverless Workflow Applications in Federated FaaS.pdf
byFörderverein Technische Fakultät
 
PDF
The Role of Machine Learning in Fluid Network Control and Data Planes.pdf
byFörderverein Technische Fakultät
 
PDF
Nonequilibrium Network Dynamics_Inference, Fluctuation-Respones & Tipping Poi...
byFörderverein Technische Fakultät
 
PDF
Towards a data driven identification of teaching patterns.pdf
byFörderverein Technische Fakultät
 
PPTX
Förderverein Technische Fakultät.pptx
byFörderverein Technische Fakultät
 
PDF
The Computing Continuum.pdf
byFörderverein Technische Fakultät
 
PPTX
East-west oriented photovoltaic power systems: model, benefits and technical ...
byFörderverein Technische Fakultät
 
PDF
Machine Learning in Finance via Randomization
byFörderverein Technische Fakultät
 
PDF
IT does not stop
byFörderverein Technische Fakultät
 
PPTX
Advances in Visual Quality Restoration with Generative Adversarial Networks
byFörderverein Technische Fakultät
 
„Die Klimakrise ist da! Wo führt sie hin?“
byFörderverein Technische Fakultät
 
Constrained text generation to measure reading performance: A new approach ba...
byFörderverein Technische Fakultät
 
Greening local government units: Current status and required competences
byFörderverein Technische Fakultät
 
Supervisory control of business processes
byFörderverein Technische Fakultät
 
The Digital Transformation of Education: A Hyper-Disruptive Era through Block...
byFörderverein Technische Fakultät
 
A Game of Chess is Like a Swordfight.pdf
byFörderverein Technische Fakultät
 
From Mind to Meta.pdf
byFörderverein Technische Fakultät
 
Miniatures Design for Tabletop Games.pdf
byFörderverein Technische Fakultät
 
Distributed Systems in the Post-Moore Era.pptx
byFörderverein Technische Fakultät
 
Don't Treat the Symptom, Find the Cause!.pptx
byFörderverein Technische Fakultät
 
Engineering Serverless Workflow Applications in Federated FaaS.pdf
byFörderverein Technische Fakultät
 
The Role of Machine Learning in Fluid Network Control and Data Planes.pdf
byFörderverein Technische Fakultät
 
Nonequilibrium Network Dynamics_Inference, Fluctuation-Respones & Tipping Poi...
byFörderverein Technische Fakultät
 
Towards a data driven identification of teaching patterns.pdf
byFörderverein Technische Fakultät
 
Förderverein Technische Fakultät.pptx
byFörderverein Technische Fakultät
 
The Computing Continuum.pdf
byFörderverein Technische Fakultät
 
East-west oriented photovoltaic power systems: model, benefits and technical ...
byFörderverein Technische Fakultät
 
Machine Learning in Finance via Randomization
byFörderverein Technische Fakultät
 
IT does not stop
byFörderverein Technische Fakultät
 
Advances in Visual Quality Restoration with Generative Adversarial Networks
byFörderverein Technische Fakultät
 

Recently uploaded

DOCX
Best Platforms for Acquiring Aged LinkedIn Accounts Effectively.docx
byBusiness
 
DOCX
7 Sites to Buy Verified Binance Account Overview.docx
byTopsellerit
 
PDF
sse-engineer-questions-answers-only1.pdf
bydeajhds
 
PPTX
Production and Operations Unit 5 Unit V - Maintenance and Waste Management.pptx
byDavies Chacko
 
PDF
Derek Maxfield - A Founding Board Member Of Saprea
byDerek Maxfield
 
PDF
ISACA CISM and CISA - Case Study for BCP
byJS
 
PDF
Daily-Ads Review: Top Affiliates Are SCARED to Tell You This.pdf
bysimplefreedomwarrior
 
PDF
Reliable Coolrooms for Commercial Kitchens
byCool Fast Refrigeration
 
PDF
Decoded: The Mystery of Life and the Begining of Time
byanyebepeter
 
PDF
A good time to buy a diamond company? By James Allan
byJames AH Campbell
 
PPTX
Production and Operations Unit 4 Unit - IV - Production Planning and Quality ...
byDavies Chacko
 
PPTX
Enterprise-Grade Remote Desktops Why Businesses Choose BuyRDPAdmin.pptx
bybuyrdpseo1
 
PDF
How to Buy Verified Cash App Accounts A Step-by-Step Guide.pdf
byUsaservicepoint
 
PDF
Books on display in our Library January-February 2026
byNZSG
 
PDF
RI&E Checklist MKB (2026) – Voorbereiding, Toetsing & Plan van Aanpak PDF
byRIEklaar.nl
 
DOCX
Best 4 Websites to Buy Verified Stripe Accounts in USA.docx
bypvatopone43
 
PDF
15 Smart Hacks for Repurposing Forgotten Buy Gmail Profiles This Year.pdf
byBuy Old Gmail Accounts
 
PDF
Top 7 Tips for Buying TikTok Accounts.pdf
byc23tykuq37te8lzue2ds
 
PDF
A Brief Introduction About Zaid Alsikafi
byZaid Alsikafi
 
PPTX
Production and operations Unit 2 Unit II Plant Location and Layout.pptx
byDavies Chacko
 
Best Platforms for Acquiring Aged LinkedIn Accounts Effectively.docx
byBusiness
 
7 Sites to Buy Verified Binance Account Overview.docx
byTopsellerit
 
sse-engineer-questions-answers-only1.pdf
bydeajhds
 
Production and Operations Unit 5 Unit V - Maintenance and Waste Management.pptx
byDavies Chacko
 
Derek Maxfield - A Founding Board Member Of Saprea
byDerek Maxfield
 
ISACA CISM and CISA - Case Study for BCP
byJS
 
Daily-Ads Review: Top Affiliates Are SCARED to Tell You This.pdf
bysimplefreedomwarrior
 
Reliable Coolrooms for Commercial Kitchens
byCool Fast Refrigeration
 
Decoded: The Mystery of Life and the Begining of Time
byanyebepeter
 
A good time to buy a diamond company? By James Allan
byJames AH Campbell
 
Production and Operations Unit 4 Unit - IV - Production Planning and Quality ...
byDavies Chacko
 
Enterprise-Grade Remote Desktops Why Businesses Choose BuyRDPAdmin.pptx
bybuyrdpseo1
 
How to Buy Verified Cash App Accounts A Step-by-Step Guide.pdf
byUsaservicepoint
 
Books on display in our Library January-February 2026
byNZSG
 
RI&E Checklist MKB (2026) – Voorbereiding, Toetsing & Plan van Aanpak PDF
byRIEklaar.nl
 
Best 4 Websites to Buy Verified Stripe Accounts in USA.docx
bypvatopone43
 
15 Smart Hacks for Repurposing Forgotten Buy Gmail Profiles This Year.pdf
byBuy Old Gmail Accounts
 
Top 7 Tips for Buying TikTok Accounts.pdf
byc23tykuq37te8lzue2ds
 
A Brief Introduction About Zaid Alsikafi
byZaid Alsikafi
 
Production and operations Unit 2 Unit II Plant Location and Layout.pptx
byDavies Chacko
 

Mobile Networking Solutions for First Responders

  • 1.
    MOBILE NETWORKING SOLUTIONS FORFIRST RESPONDERS Klara Nahrstedt (klara@illinois.edu) Department of Computer Science University of Illinois at Urbana- Champaign 1 Joint work with Dr. Ying Huang, Dr. Wenbo He, Dr. Yan Gao, Dr. Whay Lee
  • 2.
    FIRST RESPONDER MOBILE SYSTEMS(FRS) EMS Sep. 11’01 Firefighter Katrina’05 First Responder Police 2 East Amarillo Complex’06
  • 3.
    FIRST RESPONDER SYSTEM– NETWORK MODEL  Extended Area Network  Jurisdiction Area DB Network 911 Dispatch Center JAN Police  Incident Area Network  Wireless communication system (MANET) IAN IC  Mobile devices, droppable EAN devices, vehicles PAN  Incident command system  Command center (CC) at a vehicle JANEMS  Personal Area Network  Sensors, RFID, cameras, microphone, mobile devices  Health/equipment monitoring and environmental surveillance 3
  • 4.
    OUTLINE  RelayPlacement InUnpredictable Environments  Problem Description  Polymorphic Networks  Optimal Relay Placement  Solutions  Constrained Relay Placement  Unconstrained Relay Placement  Evaluation  Brief Overview of other MONET group projects 4
  • 5.
    PROBLEM: CRITICALITY OFBASE STATION CONNECTIVITY IN FR ENVIRONMENTS  Goal: Interconnecting Base stations (BS) with Command Center (CC) to improve command coverage  Reliable control channel  Satellite, cellular, mesh, Internet portal  Real-time data flow DTN  Monitor/Report from FRs  Location tracking / health / voice MANET / surveillance  Control/Info from CC  Resource data, coordination, command control channel  We need persistent Base Station (BS) connectivity. 5
  • 6.
    DISMAYED TRUTH  D.C. emergency response officers quote:  Their radio systems would not operate in the underground tunnels of the Metro system.  Radio communication often falls out of range  Mine, tunnel, caves  High-rise buildings  Cargo ships (metal)  Signal Degradation  Multipath fading  Interference  Obstacles 6
  • 7.
    DISCONNECTED WIRELESS NETWORK NUMERICALRESULTS FROM SIMULATION  Large incident area  Small # of FRs  Large-scale fading  Being mission-oriented, FRs are  Separately from others  Disconnected from BSes  BS connectivity metric at a sampled time t is the percentage of FRs, who have c BS connectivity F(c) = Fraction of sampled BS Connectivity  time instances, when BS For 80% time, less than 22% connectivity metric is lower FRs have connectivity to BSes. than c 7
  • 8.
    DROPPABLE RELAYS TOIMPROVE CONNECTIVITY  Affordable wireless relays  Communication devices, bread crumbs whose exclusive function is to forward packets for terminals, base stations and other relays, whenever needed.  Static relays  No need to maintain BS connectivity for isolated relays. 8
  • 9.
    OPTIMAL RELAY PLACEMENTSCHEME  Relay placement scheme  Dropped locations for relays  # of relays  Optimal relay placement scheme  Minimum number of relays  Relays are resources. We need to concern about  Number: A finite # in total  Weight: A FR can only carry a small # of relays  Optimal placement scheme is case by case  BS connectivity for all snapshots of network topologies – polymorphic networks 9
  • 10.
    OPTIMAL RELAY PLACEMENTSCHEME  Relay placement scheme  Dropped locations for relays  # of relays  Optimal relay placement scheme  Minimum number of relays  Relays are resources. We need to concern about  Number: A finite # in total  Weight: A FR can only carry a small # of relays  Optimal placement scheme is case by case  BS connectivity for all snapshots of network topologies – polymorphic networks 10
  • 11.
    USAGE OF TOPOLOGY-AWARERELAY PLACEMENT  Offline - Analysis  Input: Discrete-ized mobility traces  Output: Performance reference for online algorithms  Online - Incident preparation and planning phase  Input: Critical topology snapshots to maintain connectivity  Major events and dispatch commands  FRs’ behavior coded by training  Output: Relay placement scheme (+ movement)  Predictability 8:3 0 8:0 0  Assumption: no hostile environment 8:0 0 11
  • 12.
    CONSTRAINED RELAY PLACEMENT(CRP)  Relays are placed at a subset of candidate locations  Safe distance between adjacent relays  Region-correlated crash/failure (fire, flood)  Forbidden areas  Impenetrable areas, obstacles  A deployment scheme: the set of candidate relay places RP 12 Grid Hexagon
  • 13.
    GRAPH REPRESENTATION FORCRP  A graph per topology  Vertex set  Edge set  For a terminal,  finding a multi-hop path towards at least one BS Equivalent  finding a multi-hop path towards M. 13
  • 14.
    1-BS-CONNECTIVITY  Node-weighted Steiner tree  Unit weight for relays; 0 weight for other nodes  Commodity flow from MC to terminals  1 unit towards each terminal  Place relays at places  commodities can flow via relays 14 Minimum node-weighted Steiner tree (8)
  • 15.
    OPTIMIZATION FORMULATION (1)  Single topology Flow conservation constraint Switch constraint Place relay or not at location p Flow amount on edge ij 15
  • 16.
    OPTIMIZATION FORMULATION (2)  Multiple topologies min ∑y p∈ RP p | T t |, i=M  s.t. ∑t xij − ∑ x tji =1, t  − i ∈T t j:ij∈E j: ji∈E t  0, otherwise  ∑ xtpj ≤ | T t | y p , ∀p ∈ RP j: pj∈E t y p ∈ {0,1} xij ∈ [0, | T t |] t 16
  • 17.
    UNEVEN LOAD ONBASE STATIONS  Cause congestion around heavily loaded BSes  Waste connectivity around lightly loaded BSes Topology 1 Topology 2 17
  • 18.
    OPTIMIZATION FORMULATION (3) min ∑y p∈ RP p | T t |, i=M  s.t. ∑t xij − ∑ x ji =1, t t  − i ∈T t j:ij∈E j: ji∈E t  0, otherwise  ∑ xtpj ≤ | T t | y p , ∀p ∈ RP j: pj∈E t ∑ xij ≤ li | T t |, t ∀i ∈ {T t , B, RP} Load balance constraint j:ij∈E t y p ∈ {0,1} xij ∈ [0, | T t |] t 18
  • 19.
    BALANCED LOAD  li=0.5 Topology 1 Topology 2 19
  • 20.
    SOLVING MIP (MIXEDINTEGER PROGRAMMING) EFFICIENTLY  NP-hard  Integer Programming Algorithm (IPA)  Linear relaxation with sequential rounding  Prune process  Advantage of IPA  Holistic view across topologies  Load balance  Environmental factors  Obstacles, irregular transmission range, 2D to 3D  Flexible cost defined for a candidate relay place  Installation cost, reliability 20
  • 21.
    UNCONSTRAINED RELAY PLACEMENT  Relays are placed anywhere in network  Steinerization approach  1) Minimum spanning tree among terminals and BSes  2) Steinerization  Break edges into pieces with length of at most transmission range 21
  • 22.
    STITCH-AND-PRUNE ALGORITHM  Steinerize each topology separately T1 T2  Combine relays for all topologies  Prune redundant ones 22
  • 23.
    PERFORMANCE EVALUATION (1)  Square network area  2 BSes  TxRange = 100m (default)  Constrained relay placement with regular grid (100m)  Average over 20 randomly generated scenarios for each configuration IPA Integer programming algorithm w.o. load balance IPALB Integer programming algorithm w.t. load balance 23 SPA Stitch-and-prune algorithm
  • 24.
    PERFORMANCE EVALUATION (2)  Number of relays Same density () = 100 () = 200 24
  • 25.
    PERFORMANCE EVALUATION (3)  Gain of global optimization over multiple topologies 25
  • 26.
    CONCLUSION  Relay placement for reliable base station communication  Constrained relay placement Integer programming formulation based on network flow 26   Unconstrained relay placement  Stitch-and-prune algorithm Constrained Model capability Optimization overhead (IPA) Unconstrained Simple Cannot handle obstacles, load balance, (SPA) algorithm; etc. Preli m Run fast Local optimization; prune by redundancy Exa m, Nov 16th
  • 27.
    REFERENCES  W. He, Y. Huang, K. Nahrstedt, W. C. Lee, “Mobi-Herald: Alert Propagation in Mobile Ad Hoc Networks”, ACM Mobicom 2007 (Poster Session), Montreal, Canada, Sept. , 2007  Y. Huang, W. He, K. Nahrstedt, W. C. Lee, “Requirements and System Architecture Design Consideration for First Responder Systems”, IEEE Conference on Technologies for Homeland Security Conference, Waltham, MA, May 2007  Y. Huang, W. He, K. Nahrstedt, W. Lee, “Incident Scene Mobility Analysis”, 2008 IEEE Int’l Conf. on Technologies for Homeland Security, Boston, MA, May 2008.  Y. Huang, W. He, K. Nahrstedt, W. Lee, “CORPS: Event-Driven Mobility Model for First Responders in Incident Scene”, IEEE MILCOM 2008, San Diego, CA, November 2008  Y. Huang, Y. Gao, K. Nahrstedt, “Relay Placement for Reliable Base Station Connectivity in Polymorphous Networks, IEEE SECON 2010  T. Pongthawornkamol, S. Ahmed, A. Uchiyama, K. Nahrstedt, “Zero- knowledge Real-time Indoor Tracking via Outdoor Wireless Directional 27 Antennas”, IEEE Percom’10 , Germany. March 2010  (all papers are at http://cairo.cs.uiuc.edu/publications )
  • 28.
    OUTLINE  RelayPlacement InUnpredictable Environments  Brief Overview of other MONET group projects 28
  • 29.
    MONET GROUP OVERVIEW  Department of Computer Science, University of Illinois at Urbana-Champaign  http://cs.illinois.edu  MONET Group Website  http://cairo.cs.uiuc.edu  8 PhDs in Fall 2011  3 Master Students in Fall 2011  Active Research Areas  Mobile Systems  Mobile learning communities  First responders system  Mobility patterns and data dissemination in P2P mobile systems  3D Tele-immersive Systems  View-casting  Monitoring and diagnosis in 3DTI  Multi-sender/multi-receiver synchronization  H-media – holistic multi-stream resource management for distributed immersive applications  Trustworthy Critical Infrastructures  QoS systems and protocols in SCADA systems  Jamming and security in SCADA systems
  • 30.
    MOBILE SYSTEMS -JYOTISH Characterizing and Leveraging Movement of People
  • 31.
  • 32.
    HOW DO WEMEASURE, CHARACTERIZE AND LEVERAGE PEOPLE MOVEMENT 1. Decide on Tracking Methodology 2. Determine Tracking Parameters 3. Collect Tracking Measurements (Mobility Traces) 4. Characterize Mobility Patterns 5. Leverage Mobility for 1. Mobility Prediction 2. Content Distribution
  • 33.
    1. DECIDE ONTRACKING METHODOLOGIES  Surveys/Questionnaires  Surveillance via Video Cameras  New Tracking Methods via mobile devices such as  Cellular Device Monitoring  WiFi Device Monitoring  Bluetooth Device Monitoring  Sound Monitoring  Combination of Tracking methods
  • 34.
    2. DETERMINE TRACKINGPARAMETERS  Contact Parameters  Probability of contact (encounter)  Duration of contact  Frequency of contact  Environment Parameters  Tracking number of days  Period of scanning (accuracy of tracked data)  Homogeneity of mobility patterns  Mobile Device Parameters  Speed of person carrying mobile device  Density of mobile devices
  • 35.
    3. COLLECT TRACE EXAMPLE:TRACKING VIA UIM University Campus UIM – University of Illinois Movement  Collects MAC addresses of Wifi APs and Bluetooth- enabled devices  Wifi AP MACs are used to infer location information  Bluetooth MACs are used to infer social contact  Deployed on Android phones carried by professors, staff, and students from March to August 2010  UIM trace available online!!!! http://dprg.cs.uiuc.edu/downloads
  • 36.
    4. CHARACTERIZING PEOPLEMOVEMENT FOUND IN UIM TRACE (1)  Location is regular if person visits location at the same time slot for at least half number of days  People visit regular locations (plot is from 50 participants)
  • 37.
    5. LEVERAGE (1):UIM-BASED CONSTRUCTION METHOD OF PREDICTIVE MODEL (JYOTISH)
  • 38.
    PERFORMANCE OF TOP-KCONTACT PREDICTOR  If at least one contact is predicted correctly, top-k contact predictor is correct  With k=5, 60% of participants have more than 75% of correct contact predictions L. Vu, Q. Do, K. Nahrstedt, “Jyotish: A Novel Framework for Constructing Predictive Model of People Movement from Joint Wifi/Bluetooth Trace”, IEEE Percom 2011 (Mark Weiser Best Paper)
  • 39.
    5. LEVERAGE (2):COMMUNITY-BASED DATA ROUTING/FORWARDING PROTOCOL (COMFA)  Observation from UIM traces  People make regular social contacts in their daily activities and form social communities and share interests such as music or sports  Approach PROPHET 3R 0.3 0.1 0.1 0.9 0.5 0.7 0.5 0.15 0.4 0.2 0.8 0.1 0.2 0.2 0.2 0.3 time slot1 slot2 slot3 time
  • 40.
    3R RESULTS: DELIVERYRATIO • Settings • 100 senders/receivers via 9 phones carried by MONET research group members from March 01 to March 20, 2010 • Message delay deadline 12 hours • Each node has 20 days of trace 3R PROPHET EPIDEMIC  Epidemic performs best due to its flooding nature  Epidemic outperforms 3R by 10%  3R outperforms Prophet by 9%
  • 41.
    TEEVE – -ENVIRONMENTSFOR EVERYBODY 3D Tele-immersion
  • 42.
    HIGH-LEVEL VISION –MAKING DISTANCE IRRELEVANT AND TELE-IMMERSION FOR EVERYBODY (TEEVE) 4 Photo courtesy of Prof. Ruzena Bajcsy. 2
  • 43.
    Static Immersive Spacesfor Physiotherapy 43
  • 44.
    MULTI-PARTY TELE-IMMERSIVE D ACTIVITY SYSTEMS D C C C C SG SG session Internet controller SG D D SG SG C D C D D C C C 4 4 SG service gateway D 3D display C 3D camera
  • 45.
    VIEW-AWARE STREAM DIFFERENTIATION 3D capturing 3D rendering 3D camera 8 8 less important streams 6 2 transmission 6 2 4 4 streams contributing more to user view user view
  • 46.
    VIEW-CASTING V2 U2 session controller V1 V3 U3 U4.w U3.w U2.w V4 U4 user view
  • 47.
    TRUST IN SCADASYSTEMS Trustworthy Cyber Infrastructure for Power Grid (TCIPG) Research at University of Illinois, Urbana-Champaign
  • 48.
    TCIPG SUMMARY  TCIPG – premier center in USA in the area of trust- worthy cyber-infrastructure for power-grid infrastructures  Trustworthy cyber-infrastructure research for power- grid is now going on  Previous 5 years (NSF) – wealth of knowledge, experiences, scientific results  New 5 years (DOE)  World-leading experts in power engineering are part of TCIPG (Prof. Sauer, Overbye, Gross, Thomas)  World-leading experts in reliability, security and real- time are part of TCIPG (Prof. Sanders, Gunter, Nicol, Nahrstedt, Campbell, Smith, Hauser, Bakken, Khurana, and other experts) 48
  • 49.
    THE CHALLENGE: PROVIDINGTRUSTWORTHY SMART GRID OPERATION IN POSSIBLY HOSTILE ENVIRONMENTS  Trustworthy  A system which does what is supposed to do, and nothing else  Availability, Security, Safety, …  Hostile Environment  Accidental Failures  Design Flaws  Malicious Attacks  Cyber Physical  Must make the whole system trustworthy, including both physical & cyber components, and their interaction. 49
  • 50.
    SMART POWER GRIDOF TOMORROW: TRANSMISSION GRID WITH SYNCHROPHASOR SENSORS • NASPI Initiative, funded by DOE and industry, to investigate putting Phasor Measurement Units (PMUs) throughout physical power infrastructure • Need significant changes in power cyber infrastructure to support PMUs • “Class A” service requires low latency, data integrity & availability (“no gaps”) 50
  • 51.
    SMART POWER GRIDOF TOMORROW: CONTROL OF ELECTRICAL EQUIPMENT AND AN OPEN GRID Consumer Portal: • Security issues are huge – Privacy, billing integrity, Mischief, vandalism, intrusion, Consumer manipulation of system Demand Response: • Extends the Control Loop – Links distribution and transmission – Increases real time requirements – Provides bigger surface for Who is responsible for security? security violations • Consumer? Utility? 51
  • 52.
    (MONET RESEARCH) NEEDFOR SECURE WIRELESS NETWORKS  No wireless network deployed broadly today in Power Grid (some early adapters – nuclear industry)  EPRI recommendations for usage of wireless technology in substation network architecture (Report, Jan. 2009)  ISA100 standard efforts leveraging other standards, as appropriate, to produce a relevant result in as short a time frame as possible  ISA99 – Security  IEEE 1451 – Smart sensor  FIPS 140-2 – Security  ISO/OSI 7-layer model for network connectivity 52
  • 53.
    ALIBI: CONTAINMENT OFJAMMING ATTACKS  Goal • Attack Model  Containment of • Taking into account one jammer jamming attacks with “inside” knowledge Knows shared hopping pattern Requirements 1.  2. Knows any systems’ protocol  Detecting & 3. Uses listen-n-jam strategy Identifying one jammer in the single-hop wireless 5 network with time- 1 slotted communication BS 2 4 3 53
  • 54.
    CONCLUSIONS  FRs move in very challenging unstructured environments  FRs with mobile devices represent a challenging mobile ad hoc network that needs to communicate with commanders connected via wireless infrastructure network brought by FRs  Challenges: Deployment of ad hoc and BS communication infrastructure on the incident scene  Placement algorithms needed (offline and online)  Exciting Projects in MONET group exploring  QoS-issues and security issues in critical infrastructures, mobile infrastructures, and 3D multimedia infrastructures 54
  • 55.
    ACKNOWLEDGMENTS  The work on first responders is funded by Vodafone fellowship, and Motorola Center and Illinois-Boeing Center funding grants.  The work on Characterizing and Leveraging People Movement is funded by the Illinois-Boeing Center funding grant.  The work on Tele-immersive Systems is funded by the National Science Foundation (NSF).  The work on Trustworthy Communication in 55 SCADA networks is funded by the NSF and Department of Energy (DOE).
  • 56.
    Missing part Problem: Efficient in mobile ad hoc networks Alert Service Detection Alert Propagation Reaction  Efficient Alert Message Distribution Watch Dog Pathrater Relatively small FR Environment:  communication overhead   Capable to handle  Mobile Ad-hoc temporary network Networks partition  Problem:  In spite of mobility,  How to trigger the majority of the network can defense against be aware of the alert. malicious attacks in the  Against Collusive whole network after Slander Attacks malicious behavior is detected locally?   Slanderers can issue a DoS Alert Propagation attack easily by defaming other nodes.  Solution: Mobility Assisted 56  Alert Propagation
  • 57.
    MOBI-HERALD ARCHITECTURE Confirm alert Threshold-based message m Alert Propagation Verification Management Report received Control alert alert messages propagation Mobility-assisted Epidemic Routing Receive alert Periodically propagate messages alert message m 57
  • 58.
    MOBILITY ASSISTED EPIDEMICROUTING: ADVANTAGES  Mobility-assisted epidemic routing is able to deliver a message to almost all the nodes even under intermittent network partitions. Flooding protocol cannot deliver message to the whole network if a mobile network is partitioned.  In mobility-assisted epidemic routing, transmissions can be more efficient. Mobility assisted epidemic routing A A B B Flooding 58
  • 59.
    EXAMPLE (2) t=t0+T (1) t=t0 (3) t=t0+2T (4) t=t0+3T 59
  • 60.
    MOBI-HERALD EPIDEMIC ROUTING: PROTOCOL  A mobile node retransmits a message periodically  A node suppresses transmission if it hears the transmission in the same period (within ∆ time slot). Retransmissions of a message time T T T 60
  • 61.
    QUORUM-BASED VERIFICATION  Assuming k is the number of collusive slanders, a node does not actively forward the received alert Unaware message before it received Listening to alert Q (Q>k) copies of the alert ag py De havi messages ess t co em tec or be message. rt m firs ted dir ale he ma ectl an d t lic y of eive iou c s AlertedRe Confirmed Received Q alert messages m Listening to Periodically (assuming Quorum size is Q) more copies of propagate the the m alert message m Received less than Q copies of m 61
  • 62.
    ALERT PROPAGATION MANAGER Balance reliability and efficiency A parameter “Times-to-send (TTS)” is attached in the message header, which indicates how many times an alert should be retransmitted by a mobile herald. Large TTS  large message overhead Small TTS  Small coverage of message delivery  Balance end-to-end delay of alert propagation and efficiency Period of alert propagation “T” Large T  large end-to-end delay Small T  less efficiency of retransmissions 62
  • 63.
    SELECTION OF T r Moving direction Location of Location of previous current transmission transmission T 2r Preferably T= vavg 63
  • 64.
    SIMULATION RESULTS  WesimulateMobi-herald alert propagation protocol under Random Waypoint mobility pattern.  Evaluation Metrics  End-to-end alert message delivery delay  Coverage of an alert message 64
  • 65.
    END-TO-END ALERT MESSAGEDELIVERY DELAY (REAL-TIME ALERT) Threshold Q=1 Threshold Q=3 10 35 Delay of alert propagation (minute) Delay of alert propagation (minute) average degree = 2 average degree = 2 9 average degree = 4 average degree = 4 30 average degree = 9 average degree = 9 8 average degree =14 average degree = 14 7 25 6 20 5 15 4 3 10 2 5 1 0 0 20 30 40 20 30 40 Transmission range (meter) Transmission rage (meter) 65
  • 66.
    COVERAGE OF MESSAGEDELIVERY Flooding Mobi-Herald N=264 N=442 N=884 N=1326 N=264 N=442 N=884 N=1326 Coverage of message delivery Coverage of message delivery (d=2) (d=4) (d=9) (d=14) (d=2) (d=4) (d=9) (d=14) 1 1 0.8 0.8 0.6 0.6 0.4 0.4 0.2 0.2 0 0 1 2 3 1 2 3 Confirmation threshold Q Confirmation threshold Q 66