1 VISA: Virtual Scanning Algorithm for Dynamic Protection of Road Networks IEEE Infocom’09, Rio de Janeiro, Brazil Jaehoon Jeong (Paul), Yu Gu, Tian He.

Slides:

Advertisements

Similar presentations

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.

Advertisements

An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network

Yu Stephanie Sun 1, Lei Xie 1, Qi Alfred Chen 2, Sanglu Lu 1, Daoxu Chen 1 1 State Key Laboratory for Novel Software Technology, Nanjing University, China.

Good afternoon everyone.

KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.

Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.

Maximal Lifetime Scheduling in Sensor Surveillance Networks Hai Liu 1, Pengjun Wan 2, Chih-Wei Yi 2, Siaohua Jia 1, Sam Makki 3 and Niki Pissionou 4 Dept.

Delay-Minimized Route Design for Wireless Sensor-Actuator Networks Edith C.-H. Ngai 1, Jiangchuan Liu 2, and Michael R. Lyu 1 1 Department of Computer.

TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,

1 Maximizing Lifetime of Sensor Surveillance Systems IEEE/ACM TRANSACTIONS ON NETWORKING Authors: Hai Liu, Xiaohua Jia, Peng-Jun Wan, Chih- Wei Yi, S.

1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.

1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.

SMART: A Scan-based Movement- Assisted Sensor Deployment Method in Wireless Sensor Networks Jie Wu and Shuhui Yang Department of Computer Science and Engineering.

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 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.

USense: A Unified Asymmetric Sensing Architecture for Wireless Sensor Networks Yu Gu, Joengmin Hwang, Tian He and David Du Minnesota Embedded Sensor System.

Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.

Delay-aware Routing in Low Duty-Cycle Wireless Sensor Networks Guodong Sun and Bin Xu Computer Science and Technology Department Tsinghua University, Beijing,

Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.

Achieving Long-Term Surveillance in VigilNet Pascal A. Vicaire Department of Computer Science University of Virginia Charlottesville, USA.

Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.

SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.

Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.

Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.

TRUST, Spring Conference, April 2-3, 2008 Taking Advantage of Data Correlation to Control the Topology of Wireless Sensor Networks Sergio Bermudez and.

SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.

Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.

Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.

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,

Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.

On Energy-Efficient Trap Coverage in Wireless Sensor Networks Junkun Li, Jiming Chen, Shibo He, Tian He, Yu Gu, Youxian Sun Zhejiang University, China.

Maximum Lifetime Routing in Wireless Sensor Networks by Collins Adetu Nicole Powell Course: EEL 5784 Instructor: Dr. Ming Yu.

APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He.

ELECTIONEL ECTI ON ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks Shamim Begum, Shao-Cheng Wang, Bhaskar.

1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.

Achieving Long-Term Surveillance in VigilNet Tian He, Pascal Vicaire, Ting Yan, Qing Cao, Gang Zhou, Lin Gu, Liqian Luo, Radu Stoleru, John A. Stankovic,

1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,

1 G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks Bin Wang and Sandeep K. S. Gupta Computer Science and.

S& EDG: Scalable and Efficient Data Gathering Routing Protocol for Underwater Wireless Sensor Networks 1 Prepared by: Naveed Ilyas MS(EE), CIIT, Islamabad,

Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.

Maximizing Lifetime per Unit Cost in Wireless Sensor Networks

 Tree in Sensor Network Patrick Y.H. Cheung, and Nicholas F. Maxemchuk, Fellow, IEEE 3 rd New York Metro Area Networking Workshop (NYMAN 2003)

A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.

Yu Gu and Tian He Minnesota Embedded Sensor System (MESS) Department of Computer Science & Engineering This work is supported by.

1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks Tijs van Dam, Koen Langendoen In ACM SenSys /1/2005 Hong-Shi Wang.

Shibo He 、 Jiming Chen 、 Xu Li 、, Xuemin (Sherman) Shen and Youxian Sun State Key Laboratory of Industrial Control Technology, Zhejiang University, China.

KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.

Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.

Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled WSNs under real-time constraints Fei Yang, Isabelle Augé-Blum National Institute of.

Distributed Data Gathering Scheduling in Multi-hop Wireless Sensor Networks for Improved Lifetime Subhasis Bhattacharjee and Nabanita Das International.

Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.

Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,

U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.

Coverage and Scheduling in Wireless Sensor Networks Yong Hwan Kim Korea University of Technology and Education Laboratory of Intelligent.

SenSys 2003 Differentiated Surveillance for Sensor Networks Ting Yan Tian He John A. Stankovic Department of Computer Science, University of Virginia November.

A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, Nicolas D. Georganas First ACM international workshop on Wireless.

Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.

Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.

Reliability of Wireless sensors with code attestation for intrusion detection Ing-Ray Chen, Yating Wang, Ding-Chau Wang Information Processing Letters.

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)

Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.

Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.

Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science.

KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.

Towards Optimal Sleep Scheduling in Sensor Networks for Rare-Event Detection Qing Cao, Tarek Abdelzaher, Tian He, John Stankovic Department of Computer.

Prof. Yu-Chee Tseng Department of Computer Science

Survey on Coverage Problems in Wireless Sensor Networks - 2

Survey on Coverage Problems in Wireless Sensor Networks

at University of Texas at Dallas

Presentation transcript:

1 VISA: Virtual Scanning Algorithm for Dynamic Protection of Road Networks IEEE Infocom’09, Rio de Janeiro, Brazil Jaehoon Jeong (Paul), Yu Gu, Tian He and David Du Computer Science and Engineering University of Minnesota April 23rd, 2009

Problem Definition 2 Entrance pointProtection point Detect Take action Wireless Sensor Deployment

Virtual Scan vs. Legacy Schemes Detect! 2130 (a) Always-Awake (b) Duty Cycling (c) Virtual Scan Sensor network sleeps during the silent time (i.e., sleeping time). Each sensor sleeps during the scan time and the silent time. Sensor network is always awake. l Entrance PointProtection Point Sleeping Time

VISA Scheduling Procedure 4 Road Network Graph Sensor Deployment Working Schedule Sleeping Schedule Wireless Sensor Network

Road Network Graph 5 The vertices in G are intersections, protection points, and entrance points.

Working Schedule Establishment 6  Working Schedule during the Scan Period  When each sensor wakes up and how long it works for sensing. Working Schedule = (work start time, work end time)  Working Schedule Setup  Each sensor’s work start time is set to the scan arrival time.

Sleeping Schedule Establishment 7  Sleeping Schedule  How long all the sensors can sleep with detection guarantee.  One global sleeping time is computed using the Shortest Path. Maximize the sum of scan time and silent time. Entrance Points Protection Points How often to generate the Virtual Scan on Road Network? 2130 Sleeping Time Objective

Sleeping Schedule Establishment 8 Maximum sum of scan time and silent time for detection guarantee. This formulation guarantees the target detection. the shortest path When the scan arrives at e1, the path of (e1,p2) is vulnerable to the intrusion.

Handling Sensing Holes 9  Two Cases for Sensing Holes  Deployment Time  Sensor Energy Depletion  Our Approach Labeling into E or P Linear Network

Hole Labeling in Linear Network 10 How to label two sensing holes? Case 1:Case 2: Case 3:Case 4: The Shortest Path for Sleeping Time The Maximum Shortest Path (i.e., Maximum Sleeping Time) The Sleeping Time is the same as with Case 1 The Sleeping Time longer than Case 1 and Case 2

Minimum Spanning Tree (MST) based Clustering for Hole Labeling 11 The idea is to maximize the inter-distance between Entrance Cluster (E) and Protection Cluster (P). Maximum Inter-distance This maximum inter-distance determines the sleeping time.

Performance Evaluation 12  Performance Metrics  Network Lifetime  Average Detection Time  System Behavior  Sleeping Time over System Lifetime  Investigated Parameters  Working Time  Sensor Density  Silent Time Road Network for Simulation

Comparison of Sleeping Time of Three Approaches over System Lifetime 13 System Lifetime Comparison Virtual Scan: 28.2 hours Duty Cycling: 1.4 hours Always-Awake: 5.4 minutes

Impact of Working Time 14 (a) Network Lifetime for Working Time (b) Average Detection Time for Working Time 1. Network Lifetime Comparison for 1-second Working Time  Virtual Scan’s lifetime is18 times longer than Duty Cycling’s. 2. Average Detection Time Comparison for 1-second Working Time  Virtual Scan’s ADT is 2 times longer than Duty Cycling’s.

Conclusion 15  In the surveillance for road networks, the scan-based sensing algorithm (VISA) opens a promising direction.  VISA takes advantages of road network’s characteristics for a maximum sleeping time. Vehicles move along the roadways whose maps are available.  Contributions  Energy-efficient Sensing Schedule for Road Networks VISA uses the optimal sleeping time for an arbitrary road network.  Sensing Hole Handling VISA guarantees target detection while sensor network deteriorates.  Basis for Quality of Surveillance VISA can control the trade-off between the network lifetime and average detection time.