Secure Scheduling for Barrier Coverage

Slides:

Advertisements

Similar presentations

Chapter 4 Partition (3) Double Partition Ding-Zhu Du.

Advertisements

Approximations for Min Connected Sensor Cover Ding-Zhu Du University of Texas at Dallas.

Coverage Issues in WSNs

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

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

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

Influence Maximization

Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.

Connected Dominating Sets in Wireless Networks My T. Thai Dept of Comp & Info Sci & Engineering University of Florida June 20, 2006.

1 Target-Oriented Scheduling in Directional Sensor Networks Yanli Cai, Wei Lou, Minglu Li,and Xiang-Yang Li* The Hong Kong Polytechnic University, Hong.

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

MiLAN: Middleware to Support Sensor Network Applications Jonghak Kim, Da Huo, Hyungik Oh.

The Coverage Problem in Wireless Ad Hoc Sensor Networks Supervisor: Prof. Sanjay Srivastava By, Rucha Kulkarni

Sink-Connected Barrier Coverage Optimization for Wireless Sensor Networks Jehn-Ruey Jiang National Central University Jhongli City, Taiwan.

+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.

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

Prediction-based Object Tracking and Coverage in Visual Sensor Networks Tzung-Shi Chen Jiun-Jie Peng,De-Wei Lee Hua-Wen Tsai Dept. of Com. Sci. and Info.

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

Minimum Average Routing Path Clustering Problem in Multi-hop 2-D Underwater Sensor Networks Presented By Donghyun Kim Data Communication and Data Management.

Chapter 6 Relaxation (1) CDS in unit disk graph

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

A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.

Barrier Coverage With Wireless Sensors

Chinh T. Vu, Yingshu Li Computer Science Department Georgia State University IEEE percom 2009 Delaunay-triangulation based complete coverage in wireless.

Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.

Lecture 3-1 Independent Cascade Weili Wu Ding-Zhu Du University of Texas at Dallas.

*** School of Information, Renmin University of China, China

Barrier Coverage With Wireless Sensors Santosh Kumar, Ten H. Lai, Anish Arora The Ohio State University Presented at Mobicom 2005.

LOCALIZED MINIMUM - ENERGY BROADCASTING IN AD - HOC NETWORKS Paper By : Julien Cartigny, David Simplot, And Ivan Stojmenovic Instructor : Dr Yingshu Li.

Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.

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.

Coverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian 1 Farinaz Koushanfar 2 Miodrag Potkonjak 1 Mani Srivastava 2 University of California,

Saran Jenjaturong, Chalermek Intanagonwiwat Department of Computer Engineering Chulalongkorn University Bangkok, Thailand IEEE CROWNCOM 2008 acceptance.

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

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.

5.6 Prefix codes and optimal tree Definition 31: Codes with this property which the bit string for a letter never occurs as the first part of the bit string.

Coverage and Deployment 1. Coverage Problems Coverage: is a measure of the Quality of Service (QoS) of a sensor network How well can the network observe.

Prof. Yu-Chee Tseng Department of Computer Science

On the Lifetime of Wireless Sensor Networks

Hacker Detection in Wireless sensor network

Ning Li and Jennifer C. Hou University of Illinois at Urbana-Champaign

Modularity Maximization

Algorithm Design and Analysis

Dynamic Coverage In Wireless Ed-Hoc Sensor Networks

Special Graphs: Modeling and Algorithms

Topological Sort (topological order)

Power Efficient Monitoring Management In Sensor Networks

Lecture 16 Maximum Matching

Coverage and Connectivity in Sensor Networks

Introduction Wireless Ad-Hoc Network

Barrier Coverage with Optimized Quality for Wireless Sensor Networks

Connectivity and Scheduling in Wireless Sensor Networks

ADVISOR : Professor Yeong-Sung Lin STUDENT : Hung-Shi Wang

The Coverage Problem in a Wireless Sensor Network

General Threshold and Cascade Models

at University of Texas at Dallas

On the Graph Decomposition

Maximum Flow Neil Tang 4/8/2008

A Better Approximation for Minimum Total Routing Path Clustering Problem in 2-D Underwater Sensor Networks Wei Wang, Donghyun Kim, and Weili Wu, A Better.

Distributed Minimum-Cost Clustering for Underwater Sensor Networks

A Distributed Clustering Scheme For Underwater Sensor Networks

Connected Sensor Cover Problem

On Constructing k-Connected k-Dominating Set in Wireless Networks

Survey on Coverage Problems in Wireless Sensor Networks - 2

Strong Barrier Coverage of Wireless Sensor Networks Seung Oh Kang

Survey on Coverage Problems in Wireless Sensor Networks

Constructing a m-connected k-Dominating Set in Unit Disc Graphs

at University of Texas at Dallas

Presentation transcript:

Secure Scheduling for Barrier Coverage Ding-Zhu Du University of Texas at Dallas

Outline Background Our Research Future 1. Brief overview of social networks 2. How to build applications on top of the social network –  Think about a social network being MS Windows, We can build applications on it.

Background

Sink Internet / Satellite Sensor network Sensing Area phenomenon User1 Sink Internet / Satellite Sensor network User2

Biological Systems

intruder Area of interest

Open belt Closed belt

Barrier Cover A barrier-cover is a set of sensors covering a curve connecting two open boundaries.

Homogeneous Sensor Network All sensors have the same size of sensing disks, the same size of communication disks, and the same lifetime, say unit time lifetime.

There may exist several barrier covers.

Sleep-wakeup scheduling may increase the lifetime of barrier coverage. But, there is a security problem!

There is a breach in scheduling (B2, B1)

There is a breach in scheduling (B2, B1) intruder a B2

There is a breach in scheduling (B2, B1) intruder

There is no breach in scheduling (B1, B2)

Both (B2, B1) and (B1,B2) contain a breach. Crossing is bad!

Donghyun Kim, Hyunbum Kim, Deying Li, Sung-Sik Kwon, Alade O Donghyun Kim, Hyunbum Kim, Deying Li, Sung-Sik Kwon, Alade O. Tokuta, and Jorge A. Cobb, "Maximum Lifetime Dependable Barrier-coverage in Wireless Sensor Networks," Ad Hoc Networks (ADHOC), vol. 36, issue P1, pp. 296-307, January 2016. This paper gave 3 approaches to removing crossing by delete some barrier-covers.

Our Research

Observation Removal crossing is sufficient, but not necessary! (B3,B2,B1) is a breach-free scheduling.

Starting with following Goals Goal 1: Find necessary and sufficient condition for a sleep-wakeup scheduling to be breach-free. Goal 2: Given a set of barrier-covers, find a maximum subset with breach-free scheduling. (complexity & Algorithm)

We completely reached goals 1 Give necessary and sufficient condition for a sleep-wakeup scheduling to be breach-free. 2 Given a set of barrier-covers, find a maximum subset with breach-free scheduling. (This problem is equivalent to the longest path problem in directed graph. ) 3 Heterogeneous sensor system

Necessary and Sufficient 1

Sleep-wakeup scheduling 2 How to find? Step 1. Using the necessary and sufficient condition, construct a breach-free digraph. Step 2. Find the longest path in the beach-free digraph.

B1 B2 B3 Breach Digraph Breach-free Digraph

(B3,B2,B1) is a breach-free scheduling.

Equivalence

Fig. 6

Corollary The longest path problem

Longest Path

Heterogeneous Sensors 3

Path Decomposition

sleep-wakeup scheduling The longest path problem

Node-weight  edge weight

Recall Find max flow. Decompose flow into path-flows. Each path-flow gives a barrier-cover with lifetime (=flow value). Find a max-lifetime subset of barrier-covers with a breach-free scheduling.

Questions Is decomposition unique? If not, how to give the best decomposition? Does max flow give a solution with longest lifetime breach-free scheduling?

Thanks, End