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

Slides:

Advertisements

Similar presentations

An Energy-Efﬁcient Communication Scheme in Wireless Cable Sensor Networks Xiao Chen Neil C. Rowe epartment of Computer Science Department of Computer Science.

Advertisements

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.

Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.

Coverage Algorithms Mani Srivastava & Miodrag Potkonjak, UCLA [Project: Sensorware (RSC)] & Mark Jones, Virginia Tech [Project: Dynamic Sensor Nets (ISI-East)]

Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du 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,

Distributed Scheduling of a Network of Adjustable Range Sensors for Coverage Problems Akshaye Dhawan, Ursinus College Aung Aung and Sushil K. Prasad Georgia.

Differentiated Surveillance for Sensor Networks Ting Yan, Tian He, John A. Stankovic CS294-1 Jonathan Hui November 20, 2003.

Data Fusion Improves the Coverage of Wireless Sensor Networks Guoliang Xing 1, Rui Tan 2, Benyuan Liu 3, Jianping Wang 2, Xiaohua Jia 2,Chih-wei Yi 4 1.

Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.

Deployment Strategies for Differentiated Detection in Wireless Sensor Network Jingbin Zhang, Ting Yan, and Sang H. Son University of Virginia From SECON.

Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.

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

Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver

1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.

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

Online Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees Hazem Elmeleegy Purdue University Ahmed Elmagarmid (Purdue) Emmanuel.

Exposure In Wireless Ad-Hoc Sensor Networks S. Megerian, F. Koushanfar, G. Qu, G. Veltri, M. Potkonjak ACM SIG MOBILE 2001 (Mobicom) Journal version: S.

Decentralised Coordination through Local Message Passing Alex Rogers School of Electronics and Computer Science University of Southampton

Package Transportation Scheduling Albert Lee Robert Z. Lee.

Sensys 2009 Speaker:Lawrence.  Introduction  Overview & Challenges  Algorithm  Travel Time Estimation  Evaluation  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.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

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

Target Tracking with Binary Proximity Sensors: Fundamental Limits, Minimal Descriptions, and Algorithms N. Shrivastava, R. Mudumbai, U. Madhow, and S.

A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,

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.

Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.

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.

Collaborative Communications in Wireless Networks Without Perfect Synchronization Xiaohua(Edward) Li Assistant Professor Department of Electrical and Computer.

Energy-Efficient Signal Processing and Communication Algorithms for Scalable Distributed Fusion.

Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.

Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.

Trade-offs Between Mobility and Density for Coverage in Wireless Sensor Networks Wei Wang, Vikram Srinivasan and Kee-Chaing Chua National University of.

1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.

Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Efficient k-Coverage Algorithms for Wireless Sensor Networks Mohamed Hefeeda.

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

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

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.

Decentralized Energy- Conserving and Coverage- Preserving Protocols for Wireless Sensor Networks

SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,

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

Computer Network Lab. Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks SenSys ’ 03 Xiaorui Wang, Guoliang Xing, Yuanfang.

Maximizing Lifetime per Unit Cost in Wireless Sensor Networks

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

1 Energy-Efficient Mobile Robot Exploration Yongguo Mei, Yung-Hsiang Lu Purdue University ICRA06.

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

Energy-Efficient Signal Processing and Communication Algorithms for Scalable Distributed Fusion.

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 Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.

1 Dynamic Speed and Sensor Rate Adjustment for Mobile Robotic Systems Ala’ Qadi, Steve Goddard University of Nebraska-Lincoln Computer Science and Engineering.

Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.

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.

Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang.

Prof. Yu-Chee Tseng Department of Computer Science

Abstract In this paper, the k-coverage problem is formulated as a decision problem, whose goal is to determine whether every point in the service area.

Dynamic Coverage In Wireless Ed-Hoc Sensor Networks

Mining Spatio-Temporal Reachable Regions over Massive Trajectory Data

Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.

Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006

The Coverage Problem in a Wireless Sensor Network

Speaker : Lee Heon-Jong

Energy-Efficient Target Coverage in Wireless Sensor Networks

Survey on Coverage Problems in Wireless Sensor Networks - 2

at University of Texas at Dallas

Presentation transcript:

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

2DIWANS'06 Contents 1.Introduction 2.Related Work 3.Problem Formulation 4.Energy-Aware Sensor Scheduling 5.Optimality of Sensor Scheduling 6.QoSv-Guaranteed Sensor Scheduling 7.Sensor Scheduling for Complex Roads 8.Performance Evaluation 9.Conclusion

3DIWANS'06 Introduction 1.Motivation We investigate the properties of the Linear Sensor Network (e.g., Road Network in transportation system). These properties can be used for a variety of applications: Localization, Vehicle Detection, and Vehicle Tracking. 2.Applications of Our Sensing Scheduling Algorithm  Surveillance for Security around City’s Border  Crossroad Signal Control in Transportation System 3.Objectives  Maximization of Lifetime of Wireless Sensor Network  Control of Detection Quality  Quality of Surveillance Guarantee (QoSv) 4.Contributions  Energy-aware Sensor Scheduling feasible for Mobile Target Detection and Tracking  QoSv-Guaranteed Sensor Scheduling for Complex Roads

4DIWANS'06 Surveillance of City Border Roads (1/2)

5DIWANS'06 Surveillance of City Border Roads (2/2)

6DIWANS'06 Vehicle Detection for Road Traffic Measurement

7DIWANS'06 Related Work 1.Temporally and Spatially Partial Coverage  The region under surveillance is covered partially in terms of time and space.  Our scheduling algorithm utilizes this partial coverage to save sensing energy. 2.Quality of Surveillance (QoSv)  Our QoSv is defined as the reciprocal of the average detection time.  Other QoSv was originally defined as the reciprocal value of the expected travel distance until the first detection.

8DIWANS'06 Problem Formulation 1.Assumptions  The sensors knows their location and are time-synchronized.  The sensing range is uniform-disk.  The cost of turn-off operation is ignorable.  The vehicle’s maximum speed is bounded. 2.Objective To maximize the sensor network lifetime to satisfy the following conditions Provide the reliable detection of every vehicle, Guarantee the desired average detection time, and Facilitate the mobile target tracking after the target detection.

9DIWANS'06 Sensor Network Model for Road Segment

10DIWANS'06 Key Idea to Our Scheduling How to have some sleeping time to save energy? We observe that the vehicle needs time l/v to pass the road segment. Time l/v is the sleeping time for all the sensors on the road segment.

11DIWANS'06 Energy-Aware Sensor Scheduling 1.Our sensor scheduling consists of two phases:  Initialization Phase  Surveillance Phase  Working Period + Sleeping Period

12DIWANS'06 Sensing Sequence for Vehicle Detection

13DIWANS'06 Optimality of Sensor Scheduling 1.Sensor Network Lifetime The following energy can be saved through sleeping: Number of Surveillance Periods Working Period Sleeping Period

14DIWANS'06 Considerations on Turn-On and Warming- UP Overheads 1.Each Sensor’s Lifetime without Sleeping 2.Sensor Network Lifetime through Sleeping Case 1: Turn-On Overhead is greater than Sleeping benefit Case 2: Turn-On Overhead is less than Sleeping benefit

15DIWANS'06 QoSv-Guaranteed Sensor Scheduling 1.Average Detection Time for Constant Vehicle Speed Approximate Average Detection Time (ADT) 2.Average Detection Time for Bounded Vehicle Speed

16DIWANS'06 Determination of Scheduling Parameters 1.Scheduling Parameters are  The sensor network length (l)  The working time (w)  The sleeping time (s) 2.Sensor Network Length (l) 3.Working Time (w) 4.Sleeping Time (s) where

17DIWANS'06 Sensor Scheduling for Complex Roads (1/4) Road Network between the Inner and Outer Boundaries

18DIWANS'06 Sensor Scheduling for Complex Roads (2/4) A Connected Graph for an Exemplary Road Network The Road Network is represented as a Connected Graph between the Inner and Outer Boundaries.

19DIWANS'06 Sensor Scheduling for Complex Roads (3/4) Construction of Scheduling Plan in Road Network Determine the starting points Si to satisfy the required QoSv through Search Algorithm.

20DIWANS'06 Sensor Scheduling for Complex Roads (4/4) Scanning in Road Network One scanning can be split into multiple scanning. Multiple scanning can be merged into one scanning for sensing energy.

21DIWANS'06 Performance Evaluation 1.Metrics  Sensor Network Lifetime according to Working Time and Turn-on Energy  Average Detection Time according to Working Time and Road Segment Length (i.e., Sensor Network Length)  Required Average Scanning Number for Sensing Error Probability 2.Validation of Numerical Analysis  We validated our numerical analysis of our scheduling algorithm through simulation.

22DIWANS'06 Sensor Network Lifetime according to Working Time and Turn-on Energy

23DIWANS'06 Average Detection Time according to Working Time and Road Segment Length

24DIWANS'06 Required Average Scanning Number for Sensing Error Probability

25DIWANS'06 Conclusion 1.We proposed an Energy-Aware Scheduling Algorithm to satisfy the required QoSv in Linear Sensor Network. QoSv is defined as the reciprocal value of Average Detection Time (ADT). 2.Our Algorithm can be used for  Surveillance for City’s Border Roads, and  Traffic Signal Control in Crossroads. 3.Future Work We develop the specific algorithm for traffic signal control in the transportation system.

26DIWANS'06 Q & A