Energy-Efficient Target Coverage in Wireless Sensor Networks

Slides:

Advertisements

Similar presentations

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Advertisements

Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.

Coverage by Directional Sensors Jing Ai and Alhussein A. Abouzeid Dept. of Electrical, Computer and Systems Engineering Rensselaer Polytechnic Institute.

Seminar In Game Theory Algorithms, TAU, Agenda  Introduction  Computational Complexity  Incentive Compatible Mechanism  LP Relaxation & Walrasian.

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.

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

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

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

1 Delay-efficient Data Gathering in Sensor Networks Bin Tang, Xianjin Zhu and Deng Pan.

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

Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.

1 Quick Convergecast in ZigBee/IEEE Tree-Based Wireless Sensor Networks Yu-Chee Tseng and Meng-Shiung Pan Department of Computer Science National.

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

Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.

1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.

Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks Maggie X. Cheng, Lu Ruan and Weili Wu Dept. of Comput. Sci, Missouri.

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

Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing Y.Thomas Hou, Yi Shi, Jianping Pan, Scott F.Midkiff Mobile.

Mobile Filtering for Error-Bounded Data Collection in Sensor Networks Dan Wang Hong Kong Polytechnic Univ. Jianliang Xu ∗ Hong Kong Baptist Univ. Jiangchuan.

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

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.

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

WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.

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

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

Balanced k-Coverage in Visual Sensor Networks Md. Muntakim Sadik, Sakib Md. Bin Malek { mms, Department.

Example Question on Linear Program, Dual and NP-Complete Proof COT5405 Spring 11.

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.

Energy-Efficient Sensor Network Design Subject to Complete Coverage and Discrimination Constraints Frank Y. S. Lin, P. L. Chiu IM, NTU SECON 2005 Presenter:

Scheduling Optimization in Wireless MESH Networks with Power Control and Rate Adaptation SECON 2006 Antonio Capone and Giuliana Carello Keon Jang 2007.

Residual Energy Aware Channel Assignment in Cognitive Radio Sensor Networks Wireless Communications and Networking Conference (WCNC), 2011 IEEE Xiaoyuan.

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

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

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

ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.

Math Programming Concept of Optimization (L.O. a ) Linear Programming Managerial Value of Information (L.O. d) Theory (L.O. b) Example Applications (L.O.

Lecture.6. Table of Contents Lp –rounding Dual Fitting LP-Duality.

Damien B. Jourdan, Olivier L. de Weck Dept

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.

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

1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),

LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks Arijit Ghosh and Tony Givargis Center for Embedded.

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.

Optimization Models for Fixed Channel Assignment in Wireless Mesh Networks with Multiple Radios Arindam K. Das, Sumit Roy, SECON Kim Young.

Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.

1 Power Efficient Monitoring Management in Sensor Networks A.Zelikovsky Georgia State joint work with P. BermanPennstate G. Calinescu Illinois IT C. Shah.

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.

Chapter 7 Linear Programming

Xiaobing Wu, Guihai Chen and Sajal K. Das

Providing Application QoS through Intelligent Sensor Management

Presented by: Rohit Rangera

Power Efficient Monitoring Management In Sensor Networks

Outline Introduction Network Model and Problem Formulation

Presented By: Muhammad Mostafa Monowar Networking Lab

Barrier Coverage with Optimized Quality for Wireless Sensor Networks

On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,

Algorithms for Budget-Constrained Survivable Topology Design

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

Maximum Lifetime of Sensor Networks with Adjustable Sensing Range

The Coverage Problem in a Wireless Sensor Network

A Near-Optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks Authors : Frank Y. S. Lin and P. L. Chiu, Student.

Survey on Coverage Problems in Wireless Sensor Networks - 2

Survey on Coverage Problems in Wireless Sensor Networks

Hongchao Zhou, Fei Liu, Xiaohong Guan

at University of Texas at Dallas

Presentation transcript:

Energy-Efficient Target Coverage in Wireless Sensor Networks PLLAB 김성민

Outline Introduction Proposal Conclusion Maximum Set Covers(MSC) Problem MSC Problem is NP-Complete MSC heuristic Conclusion

Critical Issue: Power Scarcity!!! Introduction Characteristics of WSN Dense Limited resourse … Critical Issue: Power Scarcity!!!

Target Coverage Problem Given m targets n sensors randomly deployed Assume same remaining energy same range How to optimize the sensor energy utilization?

Proposal C = {s1, s2, s3, s4} R = {r1, r2, r3} Disjoint sets: Lifetime G = 2 Our Approach: S1 = {s1, s2} with t1 = .5; S2 = {s2, s3} with t2 = .5 S3 = {s1, s3} with t3 = .5; S4 = {s4} with t4 = 1 Lifetime G = 2.5

Proposal

Maximum Set Covers (MSC) Given C : set of sensors R : set of targets Goal Determine a number of set covers S1, …, Sp and t1,…,tp Where: Si completely covers R Maximize t1 + … + tp

Maximum Set Covers (MSC) Theorem: MSC is NP-Complete MSC problem belongs to the class NP and is NP-hard, so MSC is NP-Complete Proof ???? So, this paper presents Two heuristics.

MSC Heuristic We first model the MSC problem as an Integer Programming Given : A set of n sensor nodes: C = {s1 , s2, …, sn} A set of m targets: R={r1 , r2, …, rm} The relationship between sensors and targets: Ck = { i | sensor si covers target rk} s1 r1 C = {s1 , s2, s3}; s2 r2 R = {r1, r2, r3} s3 r3 C1 = {1,3}; C2 = {1,2}; C3 = {2,3} Variables: xij = 1 if si ∈ Sj, otherwise xij = 0 tj ∈ [0, 1], represents the time allocated for Sj

MSC Heuristic (IP) first constraint : each sensor life time <=1 second constraint : each target is covered by at least one sensor

MSC Heuristic (IP) The term xijtj is not linear Therefore we set yij = xijtj

MSC Heuristic (LP) We are ready to introduce LP-MSC heuristic

MSC Heuristic (LP) O (p3n3)

Greedy Heuristic Input parameter C - the set of sensors R - the set of targets w – sensor lifetime granularity, 0 < w <= 1

Greedy Heuristic O (im2n)

Result

Result

Result

Conclusion Schedule the sensor node activity to alternate between sleep and active mode Our contributions: Propose maximum covers set approach Prove it is NP-complete Propose an efficient heuristic

감사합니다