Barrier Coverage with Optimized Quality for Wireless Sensor Networks

Slides:



Advertisements
Similar presentations
1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
Advertisements

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
1 Maximum flow sender receiver Capacity constraint Lecture 6: Jan 25.
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
MAX FLOW APPLICATIONS CS302, Spring 2013 David Kauchak.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
Distributed Algorithms for Secure Multipath Routing
1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National.
CS Dept, City Univ.1 Low Latency Broadcast in Multi-Rate Wireless Mesh Networks LUO Hongbo.
Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.
Scheduling Algorithms for Wireless Ad-Hoc Sensor Networks Department of Electrical Engineering California Institute of Technology. [Cedric Florens, Robert.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Maximum Flows Lecture 4: Jan 19. Network transmission Given a directed graph G A source node s A sink node t Goal: To send as much information from s.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Graph-Cut Algorithm with Application to Computer Vision Presented by Yongsub Lim Applied Algorithm Laboratory.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
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.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
Sink-Connected Barrier Coverage Optimization for Wireless Sensor Networks Jehn-Ruey Jiang National Central University Jhongli City, Taiwan.
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks Department of Computer Science, Wayne State.
Wireless Sensor Networks COE 499 Energy Aware Routing
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Shambhavi Srinivasa Carey Williamson Zongpeng Li Department of Computer Science University of Calgary Barrier Counting in Mixed Wireless Sensor Networks.
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 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
Network Flow How to solve maximal flow and minimal cut problems.
On Graphs Supporting Greedy Forwarding for Directional Wireless Networks W. Si, B. Scholz, G. Mao, R. Boreli, et al. University of Western Sydney National.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
MAX FLOW APPLICATIONS CS302, Spring 2012 David Kauchak.
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.
1 - CS7701 – Fall 2004 Review of: Detecting Network Intrusions via Sampling: A Game Theoretic Approach Paper by: – Murali Kodialam (Bell Labs) – T.V. Lakshman.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
Shibo He 、 Jiming Chen 、 Xu Li 、, Xuemin (Sherman) Shen and Youxian Sun State Key Laboratory of Industrial Control Technology, Zhejiang University, China.
LOCALIZED MINIMUM - ENERGY BROADCASTING IN AD - HOC NETWORKS Paper By : Julien Cartigny, David Simplot, And Ivan Stojmenovic Instructor : Dr Yingshu Li.
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
Coverage and Scheduling in Wireless Sensor Networks Yong Hwan Kim Korea University of Technology and Education Laboratory of Intelligent.
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.
Strong Barrier Coverage of Wireless Sensor Networks Benyuan Liu, Olivier Dousse, Jie Wang and Anwar Saipulla University of Massachusetts Lowell and Deutsche.
Constructing K-Connected M-Dominating Sets in Wireless Sensor Networks Yiwei Wu, Feng Wang, My T. Thai and Yingshu Li Georgia State University Arizona.
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.
T H E O H I O S T A T E U N I V E R S I T Y Computer Science and Engineering 1 1 Sriram Chellappan, Xiaole Bai, Bin Ma ‡ and Dong Xuan Presented by Sriram.
Maximizing Sensor Lifetime in A Rechargeable Sensor Network via Partial Energy Charging on Sensors Wenzheng Xu, Weifa Liang, Xiaohua Jia, Zichuan Xu Sichuan.
Prof. Yu-Chee Tseng Department of Computer Science
A Study of Group-Tree Matching in Large Scale Group Communications
CSCI 3160 Design and Analysis of Algorithms Tutorial 8
Secure Scheduling for Barrier Coverage
Robustness of wireless ad hoc network topologies
Coverage and Connectivity in Sensor Networks
Robustness of wireless ad hoc network topologies
Algorithms for Budget-Constrained Survivable Topology Design
Flow Networks and Bipartite Matching
Automated Layout and Phase Assignment for Dark Field PSM
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
at University of Texas at Dallas
Presentation transcript:

Barrier Coverage with Optimized Quality for Wireless Sensor Networks Yung-Liang Lai*, Jehn-Ruey Jiang National Central University Taoyuan Innovation Institute of Technology* Taiwan

Wireless Sensor based Barrier Coverage USA We can deploy some wireless sensors in a protected area to detect the intruders. The wireless sensors are Wireless sensor

Barrier Coverage Optimization Problem In this paper, We model a barrier coverage optimization problem. The problem is how to construct a barrier coverage such that degree …. How to construct a barrier coverage such that : Degree of Detecting intruders is Maximized , Probability of Detecting intruders is Maximized Data transmission time is Minimized?

Barrier Coverage Optimization Problem To optimize Quality of Barrier Coverage We define three Quality metrics detection degree, detection probability, expected transmission time We model the problem as a Graph Problem Solve it by the Minimum Cost Maximum Flow Algorithm In this paper, we study the barrier coverage optimization problem, which is used to optimize quality of barrier coverage We define three quality metrics : detection degree, detection probability, expected transmission time We model the problem as a graph problem And solve it by maximum flow minimum cost planning approach

Outline Background Network Modeling Barrier Coverage Optimization Problem Optimal Barrier Coverage Algorithm Time Complexity Analysis Conclusion This is the outline

Background k-Barrier Coverage Problem Sink Connected Barrier Coverage We introduce two definitions

k-Barrier Coverage Problem Degree (k) is the number of virtual detection lines How to select nodes to maximize degree (k) Solution: k=2 Given: Degree (k) is the number of virtual detection lines As shown in right, its degree is 2, which means the number of virtual detection lines is 2. It means a intruder will be detected at least two times. The k-Barrier Coverage problem is how to select nodes to maximize degree (k) in an given nodes set.

Sink Connected Barrier Coverage Sensor node (center dot) with a sensing area for detecting and forwarding events Sensor node for only forwarding events   In our previous work, we define the sink connected barrier coverage, which is to construct a barrier coverage with connectivity to the sink nodes Detection Line Transmission Link Sink Node Boundary area Intruder

Outline Background Network Modeling Barrier Coverage Optimization Problem Optimal Barrier Coverage Algorithm Time Complexity Analysis Conclusion

Network Model Coverage Graph Gc Transmission Graph Gt To model our problem, we define two graphs : coverage graph and transmission graph

Coverage Graph (Gc) Ni and Nj have overlapped sensing coverage, then Edge (Ni, Nj) exists In a coverage graph, if two nodes have overlapped coverage, then edge exists in coverage graph

Coverage Graph (Gc) target Detection Quality Detection Probability sensor target S i S j Detection Probability depend on distance P(d)=e-d Detection Quality Worst Case of P Pw(Si, Sj)=P( Dist / 2 ) Distance (d) P(d) Dist Now, we will define Intruder Path in Middle (Worst Case)

Transmission Graph (Quality) <Ni, Nj> = node Ni can transmit data to Nj Detection Quality

Transmission Graph (Gt) Weight of edge on Gt Quality of Link: ETT Ni,Nj = 1 R Ni,Nj ∙R Nj,Ni S B Packet size Bandwidth Successful Ratio of Sending Packet Successful Ratio of ACK Packet N5 N6 N7 N9 N11 N10 N12 N13 K2 K1 N4 N1 N2 N3 N14 1 3 2 4 N8

Transmission Graph (Gt) Quality of Path Set: To measure the expected transmission time of a path set(PS) ETT(PS)= 1 |PS| h∈PS ETT h N5 N6 N7 N9 N11 N10 N12 N13 K2 K1 N4 N1 N2 N3 N14 1 3 2 4 N8

Outline Background Network Modeling Barrier Coverage Optimization Problem Optimal Barrier Coverage Algorithm Time Complexity Analysis Conclusion

Barrier Coverage Optimization Problem (k,p,t)–Barrier Coverage Optimization Problem How to select nodes from randomly deployed sensor nodes to reach three goals : Goal 1: Maximizing the degree k of barrier coverage Goal 2: Maximizing the minimum probability p of detecting intruders crossing the monitoring region Goal 3: Minimizing the expected transmission time t to send data to the sink nodes.

Outline Background Barrier Coverage Optimization Problem Optimal Barrier Coverage Algorithm Backgroud: Maximum Flow Algorithm & Maximum Flow Minimum Algorithm Time Complexity Analysis Conclusion

Background: Maximum Flow Algorithm Maximum Flow (MaxFlow) ALG Each edge is assigned capacity constraint To find some flows from s to t , such that: Number of Flow is Maximized Maximum Flow Plan = 2 Flows Now, we introduce the maximum flow algorithm. The maximum flow algorithm is to find some flows from s to t, such that number of flow is maximized under capacity constraints capacity Flow on edge

Background: Maximum Flow Algorithm Maximum Flow (MaxFlow) ALG To find MaxFlow plan from s to t , such that: Number of Flow () is Maximized In this example, the maximum number of flow is 2. 2 Flows

Background: Maximum Flow Minimum Cost Algorithm Maximum Flow Minimum Cost (MaxFlowMinCost) ALG To find flows from s to t , such that: $1 $1 $2 $3 $1 $1 $1 $2 capacity Flow value

Background: Maximum Flow Minimum Cost Algorithm Maximum Flow Minimum Cost (MaxFlowMinCost) ALG To find flows from s to t , such that: Number of Flow() is Maximized Total Cost ($) is Minimized $1 $1 $2 $3 $1 $1 $1 $2 capacity Flow value

Optimal Barrier Coverage Algorithm Basic Idea : 3 Phases Phase1)To find a set of nodes (FP) with maximized number of node-disjointed flows (k) in Coverage Graph (Gc) by MaxFlow ALG Phase2)To refine FP such that minimum detection probability (p) is maximized by MaxFlow ALG Phase3)To select some additional nodes for connecting sink nodes with minimized Expected Transmission Time (t) by MaxFlowMinCost ALG

Phase1 To find a set of nodes (FP) with maximized number of node-disjointed flows (k) in Coverage Graph (Gc) by MaxFlow ALG K=2

Minimum detection probability =0.4 Minimum detection probability =0.5 Phase 2 (Repeatedly remove edges such that minimum detection probability (p) is Maximized without loss number of flows in Phase 1 Quality of Barrier Coverage = 0.4 Quality of Barrier Coverage = 0.5 N5 N6 N7 N3 N4 N2 N1   N9 N8 0.6 0.4 0.5 0.7 Minimum detection probability =0.4 N5 N6 N7 N3 N4 N2 N1   N9 N8 0.6 0.5 0.7 Minimum detection probability =0.5 X

Phase 3 To select some additional nodes for connecting sink nodes with minimized Expected Transmission Time (t) by MaxFlowMinCost ALG N5 N6 N7 N9 N11 N10 N12 N13 K2 K1 N4 N1 N2 N3 1 3 2 4 N8 (5) (4) (2) (3) N5 N6 N7 N9 N11 N10 N12 N13 K2 K1 N4 N1 N2 N3 N14 1 3 2 4 N8 Expected Transmission Time = (5+4+4+2 + 2+5+5+3)/8 , which is Optimized

Optimal Barrier Coverage Algorithm Step 1: Construct a coverage graph Gc Each edge is associated with a weight (detection probability) N5 N6 N7 N3 N4 N2 N1   N9 N8 0.6 0.5 0.4 0.7

Optimal Barrier Coverage Algorithm Step 2: Execute to Node-Disjoint Transformation transfer Gc into the new graph Gc* For Multiple-in & Multiple-Out Node-Disjoint Transformation

Optimal Barrier Coverage Algorithm Step 3:(To Find Maximum barrier coverage) Execute the maximum flow algorithm on Gc* to decide the maximum flow plan FP S T N5 N6 N7 N3 N4 N2 N1   N9 N8 0.6 0.5 0.4 0.7

Optimal Barrier Coverage Algorithm Step 4: Remove all edges with the minimal probability without loss of Degree(k) Can we remove the MIN edge without loss number of flows? Yes, remove it and continue to test No, quality is maximized S T 0.6 0.5 0.6   0.6 0.4

Optimal Barrier Coverage Algorithm Step 4: Remove all edges with the minimal probability without loss of Degree(k) Can we remove the MIN edge without loss number of flows? Yes, remove it and continue to test No, quality is maximized S T 0.6 0.5 0.6   0.6 0.4

Optimal Barrier Coverage Algorithm Step 4: Remove all edges with the minimal probability without loss of Degree(k) Can we remove the MIN edge without loss number of flows? Yes, remove it and continue to test No, quality is maximized S T 0.6 0.5 0.6   0.6 A Barrier is constructed with MIN_Quality=0.5

Optimal Barrier Coverage Algorithm Step 5: Construct a transmission graph Add a virtual source node S and a virtual target node T T S

Optimal Barrier Coverage Algorithm Step 6: For each node selected in Step. 4, add an edge from S, For each sink node, add edge to T The ETT (Expected Transmission Time) is assigned on each edge T S

Optimal Barrier Coverage Algorithm Step 7: Execute Maximum Flow Minimum Cost Algorithm Maximum Flow with Minimized Cost T S Thus, a node set with maximized degree (k), maximized minimum_detection_probability (p), and minimized average transmission time (t) is determined

Time Complexity Analysis Time complexity of Optimal Barrier Coverage Algorithm is dominated by step 4 Try to remove minimum weight edge on coverage graph and to execute maximum flow algorithm, repeatedly (in step 4) Time complexity in step 4: O(E VE2)= O(VE3) E is the number of edges, Maximum flow algorithm needs O(VE2) Time complexity of Optimal Barrier Coverage Algorithm is dominated by step 4 In step 4, we try to remove … E times V times E squae

Conclusions Barrier Coverage with Optimized Quality Problem is molded and solved in this paper Aiming at this problem, we proposed a Optimal Barrier Coverage Algorithm (OBCA) The OBCA is time-efficient (polynomial time complexity) ▆