Outline. Energy-Efficient Target Coverage in Wireless Sensor Networks. Sensor Node. Introduction. Characteristics of WSN

Similar documents
V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS

EP2200 Queuing theory and teletraffic systems. 3rd lecture Markov chains Birth-death process - Poisson process. Viktoria Fodor KTH EES

e-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov

Midterm Exam. Thursday, April hour, 15 minutes

The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach

F-Tests and Analysis of Variance (ANOVA) in the Simple Linear Regression Model. 1. Introduction

Our main purpose in this section is to undertake an examination of the stock

Nonlinear System Modeling Using GA-based B-spline Membership Fuzzy-Neural Networks

UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005

Robustness Experiments with Two Variance Components

Normal Random Variable and its discriminant functions

A Cell Decomposition Approach to Online Evasive Path Planning and the Video Game Ms. Pac-Man

Notes on the stability of dynamic systems and the use of Eigen Values.

Dual Approximate Dynamic Programming for Large Scale Hydro Valleys

û s L u t 0 s a ; i.e., û s 0

HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD

Area Minimization of Power Distribution Network Using Efficient Nonlinear. Programming Techniques *

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model

Solution in semi infinite diffusion couples (error function analysis)

Chapter 6 DETECTION AND ESTIMATION: Model of digital communication system. Fundamental issues in digital communications are

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!

Density Matrix Description of NMR BCMB/CHEM 8190

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7

Variants of Pegasos. December 11, 2009

Pattern Classification (III) & Pattern Verification

Calculation of time complexity (3%)

Learning Objectives. Self Organization Map. Hamming Distance(1/5) Introduction. Hamming Distance(3/5) Hamming Distance(2/5) 15/04/2015

Chapters 2 Kinematics. Position, Distance, Displacement

Chapter Lagrangian Interpolation

( ) () we define the interaction representation by the unitary transformation () = ()

CH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC

CHAPTER 10: LINEAR DISCRIMINATION

Rethinking MIMO for Wireless Networks: Linear Throughput Increases with Multiple Receive Antennas

Modeling and Solving of Multi-Product Inventory Lot-Sizing with Supplier Selection under Quantity Discounts

A New Approach for Solving the Unit Commitment Problem by Adaptive Particle Swarm Optimization

CS 268: Packet Scheduling

Graduate Macroeconomics 2 Problem set 5. - Solutions

Advanced time-series analysis (University of Lund, Economic History Department)

TSS = SST + SSE An orthogonal partition of the total SS

Increasing the Probablility of Timely and Correct Message Delivery in Road Side Unit Based Vehicular Communcation

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4

Single-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method

Dynamic Team Decision Theory

Dynamic Power Management Based on Continuous-Time Markov Decision Processes*

グラフィカルモデルによる推論 確率伝搬法 (2) Kenji Fukumizu The Institute of Statistical Mathematics 計算推論科学概論 II (2010 年度, 後期 )

Density Matrix Description of NMR BCMB/CHEM 8190

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS

Introduction to Boosting

On One Analytic Method of. Constructing Program Controls

Chapter 5. Circuit Theorems

Stochastic Maxwell Equations in Photonic Crystal Modeling and Simulations

Linear Response Theory: The connection between QFT and experiments

A Principled Approach to MILP Modeling

Lecture 2 M/G/1 queues. M/G/1-queue

Including the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.

(,,, ) (,,, ). In addition, there are three other consumers, -2, -1, and 0. Consumer -2 has the utility function

Outline. Bayesian Networks: Maximum Likelihood Estimation and Tree Structure Learning. Our Model and Data. Outline

Chapter 6 DETECTION AND ESTIMATION: Model of digital communication system. Fundamental issues in digital communications are

APOC #232 Capacity Planning for Fault-Tolerant All-Optical Network

Chapter 6: AC Circuits

Sensor Scheduling for Multiple Parameters Estimation Under Energy Constraint

Dynamic Multi-Level Capacitated and Uncapacitated Location Problems: an approach using primal-dual heuristics

An introduction to Support Vector Machine

Ordinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s

Planar truss bridge optimization by dynamic programming and linear programming

An ant colony optimization solution to the integrated generation and transmission maintenance scheduling problem

OP = OO' + Ut + Vn + Wb. Material We Will Cover Today. Computer Vision Lecture 3. Multi-view Geometry I. Amnon Shashua

Robust and Accurate Cancer Classification with Gene Expression Profiling

Lecture 2 L n i e n a e r a M od o e d l e s

Comparison between the Discrete and Continuous Time Models

Additional Exercises for Chapter What is the slope-intercept form of the equation of the line given by 3x + 5y + 2 = 0?

A Deza Frankl type theorem for set partitions

Li An-Ping. Beijing , P.R.China

SMARANDACHE-GALOIS FIELDS

02. MOTION. Questions and Answers

2/20/2013. EE 101 Midterm 2 Review

EECS 427 Lecture 5: Logical Effort. Reminders

Advanced Macroeconomics II: Exchange economy

Online Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading

Scattering at an Interface: Oblique Incidence

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up

Efficient Asynchronous Channel Hopping Design for Cognitive Radio Networks

UNIVERSAL BOUNDS FOR EIGENVALUES OF FOURTH-ORDER WEIGHTED POLYNOMIAL OPERATOR ON DOMAINS IN COMPLEX PROJECTIVE SPACES

Let s treat the problem of the response of a system to an applied external force. Again,

A L A BA M A L A W R E V IE W

Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression

HEURISTICS FOR ONE CLASS OF MINIMAL COVERING PROBLEM IN CASE OF LOCATING UNDESIRABLE GOODS

Reactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times

[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5

st semester. Kei Sakaguchi. ee ac May. 10, 2011

On Convergence Rate of Concave-Convex Procedure

Lecture 18: The Laplace Transform (See Sections and 14.7 in Boas)

Dynamic Poverty Measures

Resource Sharing Models

Review of Numerical Schemes for Two Point Second Order Non-Linear Boundary Value Problems

A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window

Some Algorithms on Cactus Graphs

Baseflow Analysis. Objectives. Baseflow definition and significance. Reservoir model for recession analysis. Physically-based aquifer model

THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.

Transcription:

Ener-Effcen Tare Coverae n Wreless Sensor Newors Presened b M Trà Tá -4-4 Inroducon Bacround Relaed Wor Our Proosal Oulne Maxmum Se Covers (MSC) Problem MSC Problem s NP-Comlee MSC Heursc Concluson Sensor Node Inroducon A n devce equed w: One or more sensors One or more wreless ranscevers Sorae resources We lmaon Power lmaon Relacn e baer s no feasble Wreless Sensor Newors (WSN) Sensor newor consss of auonomous sensor nodes Sensor nodes oranze n newors o collaborae on a lare sensn as Alcaons: Naonal Secur Survellance Heal care Envronmenal Monorn Ec Caracerscs of WSN Dense Dnamc Toolo Lmed Resources Crcal Issue: Power Scarc!!! Queson: How o omze e sensor ener ulzaon?

Wa Is Coverae Problem Gven: A feld A n sensor nodes Queson: How well can e feld be monored? Coverae Problems Can be classfed n e follown es: Area coverae: obecve s o cover an area Pon (are) coverae: obecve s o cover a se of ons (ares) Oers: obecve s o deermne e maxmal suor/breac as a raverse a sensor feld: Bes case coverae: for an on on e a, e dsance o e closes sensor s mnmzed Worse case coverae: smlar bu e dsance o e closes sensor s maxmzed Relaed Wor Dson Se Covers Dvde sensor nodes no dson ses Eac se comleel monor all ares One se s acve eac me unl ran ou of ener Goal: To fnd e maxmum number of dson ses Ts s NP-Comlee Our Proosal Our Aroac Maxmum Se Covers (MSC) Dson ses: S {s, s } S {s, s 4 } Lfeme G C {s, s, s, s 4 } R {r, r, r } Our Aroac: S {s, s } w.5; S {s, s } w.5 S {s, s } w.5; S 4 {s 4 } w 4 Lfeme G.5 Gven: C: se of sensors R: se of ares Goal: Deermne a number of se covers S,, S and,, were: os comleel covers R omaxmze + +

MSC Teorem: MSC s NP-Comlee Proof: Frs, defne e Decson Verson of MSC roblem. To sow a MSC NP: Gven a collecon C of subses of a fne se R, o Gven and a a number faml of, se fnd covers a faml S, of, se S covers w me wes S,,,..., S, and w e me number wes.,..., n [, ] suc o Ten a we + can verf + n and olnomal for eac me subse weer s n C, e se covers s aears mee n e S, requremens, S w a oal we of a To rove mos, e were decson e verson lfeme of eac MSC sensor. s NP-ard: o Reduce -SAT roblem o n olnomal me Problem Formulaon Usn Lnear Prorammn Aroac Gven: A se of n sensor nodes: C {s, s,, s n } A se of m ares: R{r, r,, r m } Te relaons beween sensors and ares: C { sensor s covers are r } s r C {s, s, s }; s r R {r, r, r } s r C {,}; C {,}; C {,} Varables: x f s S, oerwse x [, ], reresens e me allocaed for S Problem Formulaon MSC Heursc Maxmze +... + subec o x s x r were x,( x ff s S Maxmze +... +,.., ) subec o Maxmze x s +... + subec o x r,.., s C were x, ( x ff s S, ) r R,.., C were or and se x Inal: G. Le * * (, ), L n, L, be e omal soluon of e LP formulaed before. Frs aroxmaon can be obaned as follows: * ) Se mn max ) For eac, coose an * C s., se. Se oer ) Udae e remann lfeme for eac sensor 4) Udae e newor lfeme G G + T MSC Heursc An Examle. Ieravel reea se and b solvn s Maxmze +... + subec o were T s C r,.., 4. Reurn G f ere s no loner an se a can cover all ares s r C {s, s, s }; R {r, r, r } s r C {,}; C {,}; C {,} s r..........667.667.667 mn max.. S {s, s } S {s, s } S {s, s } C. T. T. T. G............... S {s, s } S {s, s } S {s, s } T. T. T. G. G.5

Noaons Performance Analss Le (, ) be e omal soluon of e LP n e eraon Le mn r R C max Le or s r,, Denoe: ρ max r R C Teorecal Analss Lemma : for an eraon ρ Lemma : + for an eraon Teorem: For an eraon, G ( ( / ρ) + ), were G l l Teorecal Resuls Corollar: If MSC as an omal soluon w no more an se-covers, en and * lm G Remar: Te newor lfeme of our eursc wll convere o MSC omal soluon Concluson Concluson WSNs are baer owered. Hence, rolonn e newor lfeme s l desrable Scedule e sensor node acv o alernae beween slee and acve mode Our conrbuons: Proose maxmum covers se aroac Prove s NP-comlee Proose an effcen eursc usn a LP formulaon 4

Tan ou! 5