1 Emergency Navigation by Wireless Sensor Networks in 2D and 3D Indoor Environments Yu-Chee Tseng Deptment of Computer Science National Chiao Tung University.

Slides:



Advertisements
Similar presentations
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Advertisements

Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,
1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking David B. Johnson Department of Computer Science Rice University Monarch.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.
1 Quick Convergecast in ZigBee/IEEE Tree-Based Wireless Sensor Networks Yu-Chee Tseng and Meng-Shiung Pan Department of Computer Science National.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
2006/12/05ICS iPower: An Energy Conservation System for Intelligent Buildings by Wireless Sensor Networks Yu-Chee Tseng, You-Chiun Wang, and Lun-Wu.
Personalized Emergency Navigating System 資工所碩一 謝燿宇 網工所碩一 吳秉禎 網工所碩一 周裕庭.
Distributed Algorithms for Guiding Navigation across a Sensor Network Qun Li, Michael DeRosa, and Daniela Rus Dartmouth College MOBICOM 2003.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 13th Lecture Christian Schindelhauer.
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
1 Distributed Algorithms for Guiding Navigation across a Sensor Network Qun Li, Michael De Rosa, and Daniela Rus Department of Computer Science Dartmouth.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
1 The Orphan Problem in ZigBee- based Wireless Sensor Networks IEEE Trans. on Mobile Computing (also in MSWiM 2007) Meng-Shiuan Pan and Yu-Chee Tseng Department.
Energy-Aware Synchronization in Wireless Sensor Networks Yanos Saravanos Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
The Zone Routing Protocol (ZRP)
Sensor Network Navigation without Locations Mo Li, Yunhao Liu, Jiliang Wang, and Zheng Yang Department of Computer Science and Engineering Hong Kong University.
By : Himali Saxena. Outline Introduction DE-MAC Protocol Simulation Environment & Results Conclusion.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.
Project #2 Mobile Multiplayer Game: Tic-Tac-Toe Project #3 TinyOS Sensing Application EE194WIR Matt Magpayo
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
Multimedia & Networking Lab
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Power-Balance Broadcast in Wireless Mobile Ad Hoc Networks Jang-Ping Sheu, Yu-Chia Chang, and Hsiu- Ping Tsai National Central University, Chung-Li, 32054,Taiwan.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
1 Cross-Layer, Energy-Efficient Design for Supporting Continuous Queries in Wireless Sensor Networks A Quorum-Based Approach Chia-Hung Tsai, Tsu-Wen Hsu,
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks Jian Li and Prasant Mohapatra GlobeCom’03 Speaker ︰ CHUN-WEI.
College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
College of Engineering Anchor Nodes Placement for Effective Passive Localization Karthikeyan Pasupathy Major Advisor: Dr. Robert Akl Department of Computer.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
2017/4/25 INDOOR LOCALIZATION SYSTEM USING RSSI MEASUREMENT OF WIRELESS SENSOR NETWORK BASED ON ZIGBEE STANDARD Authors:Masashi Sugano, Tomonori Kawazoe,
Computer Science 1 TinySeRSync: Secure and Resilient Time Synchronization in Wireless Sensor Networks Speaker: Sangwon Hyun Acknowledgement: Slides were.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science.
Ching-Ju Lin Institute of Networking and Multimedia NTU
Shambhu Upadhyaya 1 Sensor Networks – Hop- by-Hop Authentication Shambhu Upadhyaya Wireless Network Security CSE 566 (Lecture 22)
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Po-Yu Chen, Zan-Feng Kao, Wen-Tsuen Chen, Chi-Han Lin Department of Computer Science National Tsing Hua University IEEE ICPP 2011 A Distributed Flow-Based.
Energy-Aware Data-Centric Routing in Microsensor Networks Azzedine Boukerche SITE, University of Ottawa, Canada Xiuzhen Cheng, Joseph Linus Dept. of Computer.
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
An Enhanced Cross-Layer Protocol for Energy Efficiency in Wireless Sensor Networks Jaehyun Kim, Dept. of Electrical & Electronic Eng., Yonsei University;
1 An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data in Sensor Networks Sencun Zhu, Sanjeev Setia, Sushil Jajodia, Peng.
A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Spring Routing: Part I Section 4.2 Outline Algorithms Scalability.
Reliable Navigation of Mobile Sensors in Wireless Sensor Networks without Localization Service Qingjun Xiao, Bin Xiao, Jiaqing Luo and Guobin Liu Department.
Distributed-In/Distributed-Out: Intelligent Sensor Networks for Coordination Constantine (Dean) Christakos Viral Communications
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Grid: Scalable Ad-Hoc Wireless Networking Douglas De Couto
1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
THE NETWORK LAYER.
Chapter 5 The Network Layer.
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
ECE 544 Protocol Design Project 2016
Presentation transcript:

1 Emergency Navigation by Wireless Sensor Networks in 2D and 3D Indoor Environments Yu-Chee Tseng Deptment of Computer Science National Chiao Tung University

2 Outline Introduction System Overview Environment setting Regular report Emergency navigation service Simulation results Demonstration Conclusion

3 Outline Introduction System Overview Environment setting Regular report Emergency navigation service Simulation results Demonstration Conclusion

4 Introduction Wireless Sensor Network Each sensor has Limited Memory 、 Limited CPU 、 Wireless Transceiver 、 Sensing Unit Each sensor can Sense environments Communicate with others Do simple computations

5 Introduction Traditional Navigation Devices Advantage Cheap Easy deployment Disadvantage Fixed direction. Can not adapt to actual emergency situations.

6 Introduction Motivation According to the statistic report of the NFA of Taiwan( 內政 部消防署), 228 people died in fire accidents in The main reason is that people can not find “right” escaping paths to exits. Our Goal to develop an emergency navigation system for indoor 2D and 3D environments

7 Outline Introduction System overview Environment setting Regular report Emergency navigation service Simulation results Demonstration Conclusion

8 System Overview Our system is composed of 3 parts Environment setting Regular reporting Emergency Navigation Two network graphs Communication graph and guidance graph Communication graph Guidance graph

9 Environment Setting Deploy sensors Construct reporting tree Setup initial navigation paths navigating reporting

10 Outline Introduction System overview Environment setting Regular report Emergency navigation service Simulation results Demonstration Conclusion

11 Deployment of Sensors Plan locations of sensors Define the roles of sensors Sink Exit sensors Normal sensors Decide navigation links navigation links (for human)

12 Construct a Reporting Tree Step 1. Discover symmetric links Each sensor periodically broadcasts HELLOs When receiving a HELLO, sensors reply ACKs After receiving an ACK, sensors record the sender ID in its link table HELLO ACK Link table

13 Construct a reporting tree (cont.) Step 2. Construct a spanning tree Sink floods a BEACON. For a sensor receives a BEACON, it checks if the sender is in its link table If yes, it sends a REG(ister) to sink and rebroadcasts BEACON. Else, drops it BEACON REG BEACON

14 communication links (for packets)

15 Outline Introduction System overview Environment setting Regular report Emergency navigation service Simulation results Demonstration Conclusion

16 Reporting Issues How often a report should be sent? Will each sensor report individually? Is there any inaccuracy? False alarm? How to save energy of sensors?

17 Outline Introduction System overview Environment setting Regular report Emergency navigation in 2D environment Simulation results Demonstration Conclusion

18 Design Principle When a sensor detects an emergency event, it forms a hazardous region The navigation algorithm will try to guide people as farther away from hazardous regions as possible

19 Problem Formulation Each sensor has an altitude. Sensors in hazardous regions will raise their altitudes. Each sensor guides people to the neighbor with the lowest altitude After forming hazardous regions, some sensors may become local minimum ones A partial link reversal operation is performed to solve this problem

20 Phases of Navigation Initialization phase Initial phase is started by Exit sensor After this phase, every sensor has a default guiding direction. Navigation phase This phase starts by the sensor which detects an emergency event.

21 Terminology D : The radius of the hazardous region A emg : A large constant which represents the maximum altitude A i : The altitude of sensor i I i : The altitude obtained in the initialization phase e j,i : The hop count from emergency sensor j to sensor i

22 Initialization phase Every exit sensor sets its altitude to 0 and broadcasts an initialization packet. When receiving an initialization packet, a sensor adds its hop count by 1. Then, it compares the hop count with its current altitude ∞∞∞ ∞∞∞ ∞∞∞ 0

23 Initialization phase (cont.) If the hop count is smaller than its altitude, it resets its altitude and setups its initial guiding direction to that sender. Then, it rebroadcasts this packet. ∞∞ ∞∞∞ ∞∞∞

24 Navigation phase When a sensor x detects an emergency, it will set its altitude to the maximum altitude A emg (let it be 200). Then it broadcasts an emergency packet EMG(seq, x, x, A emg, 0) seq : sequence number x : emergency ID w : sender ID A w : altitude of sender h : hop count to emg. location

25 Navigation phase (cont.) When a sensor node y receives a EMG packet originated from node x, it will do the following steps. Step1 : Decide that the emergency is a new one or not  If it’s a new emergency, record this event and set the hop count e x,y to h+1.  Else, compare the h and e x,y. If h is smaller than e x,y, set e x,y to h+1. Record the altitude (A w ) in the navigation link table

26 Navigation phase (cont.) Step 2: If e X,Y was changed in step1 and e X,Y ≦ D, y considers itself within hazardous region. Then it re-calculates its altitude as follows :

27 Navigation phase (cont.) Step 3 : If y has a local minimum altitude and it’s not an exit, it must adjust its altitude as follows : = altitudes of y’s neighbors STA = standard deviation  A bigger value means closer to the hazardous region. So we need to adjust the altitude faster. |N y | = number of neighbors of y.  A smaller | N y | means less escape ways. So we need to adjust the altitude faster. δis a small constant Static adjustment Our scheme Five iterations Three iterations

28 Navigation phase (cont.) Step 4: y has to broadcast an EMG(seq, x, y, A y, e x,y ) packet if any of the following conditions matches.  It’s a new emergency  y has changes its altitude or e x,y in the previous steps. Step 5: If y is in hazardous regions and it sees an exit sensor which is in N y and which is also in hazardous regions, then y chooses this exit sensor In all other cases, y directs users to a safer sensor first, and then gradually to a safe exit.

29 Example— Altitude after initial phase Exit 10x10 Grid Network

30 One emergency event – after step 1, 2 & 4 Local minimum

31 One emergency event– final result

32 Two emergency events– after step 1, 2 & 4 Local minimum

33 Two emergency events– final result

34 Outline Introduction System overview Environment setting Regular report Emergency navigation service Simulation results Demonstration Conclusion

35 Simulation results We compare our navigation algorithm with “ Distributed algorithm for guiding navigation across a sensor network” (MobiCom 03) This algorithm guides people to the nearest exits However, nearest exits may not be good choices

36 Simulation results Case1. Our algorithm will choose to pass hazardous region areas as farther away from emergency locations as possible. Case2. Our algorithm will not guide people passing through the hazardous region. Case3. Only the sensors near the exit in the hazardous region will guide people to that exit.

37 Outline Introduction System overview Environment setting Regular report Emergency navigation service Simulation results Demonstration Conclusion

38 Demonstration System Components MICAz sensors Environment monitoring Navigation Sink MIB510 serial Gateway Gateway between wireless sensor network and PC PC Control Host

39 Demonstration exit (normal time) first event (emergency time) second event (emergency time)

40 A Short Summary (2D) Novel indoor monitoring and navigation services based on wireless sensor network technolgoies emergency will raise sensors’ altitudes navigation similar to TORA protocol, but different in that emergencies will disturb altitudes altitude adjustment is designed for quicker convergence navigation in emergency applications requires safer paths, but not necessarily longer paths

41 Emergency Navigation in Indoor 3D Environments by Wireless Sensor Networks Yu-Chee Tseng Department of Computer Science National Chiao Tung University

42 Introduction Why 2D guiding algorithms can’t directly apply to 3D environments room 2F room 3F room 1F room 2F Rooftop room

43 System Architecture

44 Guidance initialization (0, 0) (0, 1) (0, 2)(0, 1) (0, 2) (1, 0) (0, 3) (1, 1) 1F 2F a b c d e f

45 Guidance initialization 3F room 2F 1F 4F (0,0)(0,1) (1,0) (0,0) (0,2)(0,0)(0,1) (0,1)(0,1) (0,2)(0,3)(0,2)(0,1) (0,2)(0,1)(0,2) (1,1) (1,0) (1,2)(1,2)(1,3) (1,1)(1,1) (1,2)(1,3)(1,2)(1,1) (1,2)(1,3)(1,2) (2,1) (2,0) (2,2)(2,2)(2,1) (2,1)(2,1) (2,2)(2,3)(2,2)(2,1) (2,2)(2,3)(2,2) (2,0) (3,1) (3,0) (3,2)(3,1)(3,2) (3,1)(3,1) (3,2)(3,2)(3,1)(3,1) (3,1)(3,0)(3,1) (3,0)

46 Principles of 3D guidance A sensor is located in a hazardous region if it is D hop away from the emergency point or it’s a stair sensor and its downstair sensor is in a hazardous region When guiding Avoid to guide people through hazardous regions Try to guide people to the exits on the ground floor Guide people to rooftop if there is no proper ways to downstairs

47 Simulation results

48 Prototyping We have implemented our system using MICAz motes and MTS310 sensors on TinyOS. Protocol stack

49 JAVA GUI

50 Guidance UI

51 Demonstration Environment A virtual 2-store building

52 Demonstration Vedio

53 More Results

54 Conclusions Extending 2D navigation to 3D navigation on each floor, the navigation is similar to 2D stair and gateway sensors are paid of special attention roof is also paid of special attention

55 References Q. Li, and et. al, “Distributed algorithm for guiding navigation across a sensor network”, MobiCom 03. Y.-C. Tseng, M.-S. Pan, and Y.-Y. Tsai, “A Distributed Emergency Navigation Algorithm for Wireless Sensor Networks”, IEEE Computers, Vol. 39, No. 7, July 2006, pp A Distributed Emergency Navigation Algorithm for Wireless Sensor Networks M.-S. Pan, C.-H. Tsai, and Y.-C. Tseng, “Emergency Guiding and Monitoring Applications in Indoor 3D Environments by Wireless Sensor Networks”, Int’l Journal of Sensor Networks, Vol. 1, Nos. 1/2, pp. 2-10, 2006.Emergency Guiding and Monitoring Applications in Indoor 3D Environments by Wireless Sensor Networks