Post on 12-Jan-2016
description
transcript
Survey: Barrier Coverage Survey: Barrier Coverage with Wireless Sensor with Wireless Sensor
Networks.Networks.
Feras BatarsehFeras Batarseh
EEL 6788EEL 6788
Presentation’s OutlinePresentation’s Outline
IntroductionIntroduction CharacteristicsCharacteristics Algorithms/ MethodologiesAlgorithms/ Methodologies Algorithms Comparison and Algorithms Comparison and
ComplexityComplexity TopologiesTopologies
IntroductionIntroduction
Wireless network consists of Wireless network consists of spatially distributed spatially distributed autonomous devices using autonomous devices using sensors to monitor physical or sensors to monitor physical or environmental conditions.environmental conditions.
The development of wireless The development of wireless sensor networks was sensor networks was originally motivated by originally motivated by military applications such as military applications such as battlefield surveillance.battlefield surveillance.
A look back..A look back..
•Moats?
•Walls?
•Landmines?
WSN CharacteristicsWSN Characteristics
More effective.More effective. More efficient.More efficient. Covers more areas.Covers more areas. Ability to withstand harsh Ability to withstand harsh
environmental conditions. environmental conditions. Ability to cope with node failures. Ability to cope with node failures. Mobility of nodes. Mobility of nodes. Dynamic network topology.Dynamic network topology.
GoalsGoals
StealthinessStealthiness: A sensor network is said to: A sensor network is said to
satisfy the stealthiness assumption if nosatisfy the stealthiness assumption if no
intruder is aware of the locations of theintruder is aware of the locations of the
sensors.sensors. k-coverage of a pathk-coverage of a path: A path (i.e. line: A path (i.e. line
or curve) is said to be k-covered if everyor curve) is said to be k-covered if every
point in it is covered by at least k sensors.point in it is covered by at least k sensors.
Breach?Breach?
Intersection point method (IPM)
Association Sensors Method (ASM)
Probing
IPMIPM
Using polygons to cover an area.Using polygons to cover an area. Sensors on polygon edgesSensors on polygon edges
Overlapping…Overlapping…badbad Intersecting…Intersecting…badbad Tilling…Tilling…goodgood Inside…Inside…multiple protectionmultiple protection
ASMASM
FOR (each node) {•Check Radius of coverage area•Check all intersection points of area•if diameter is inside other coverage areas of sensors•Sensor go to Sleep }//end of loop
Optimization protocol to make sure that the coverage of the entire network will not drop early nor fast.
ProbingProbing
Sleeping nodes wake upSleeping nodes wake upperiodically and broadcast aperiodically and broadcast aprobing signal to detect theprobing signal to detect theactive sensors in their active sensors in their
probingprobingrange. If no active sensor isrange. If no active sensor isdetected, the sensor detected, the sensor
switches toswitches toactive state, otherwise theactive state, otherwise thesensor resets its sleep timer sensor resets its sleep timer and goes back to sleep.and goes back to sleep.
ComplexityComplexity
IPM: O (k*m*n*m) log (n*m))IPM: O (k*m*n*m) log (n*m)) ASM: O (n*m^2+n)ASM: O (n*m^2+n) Probing: O (n)Probing: O (n)
Where: Where: n is average number of neighbors of a n is average number of neighbors of a
nodenodem is number of nodesm is number of nodesk average edges involved in the nodek average edges involved in the node
ComparisonComparison
1. IPM 1. IPM ComplexComplex slower algorithmslower algorithm efficientefficient2. Probing2. Probing FastFast SimpleSimple un necessary power wasted!un necessary power wasted!3. ACM 3. ACM SlowSlow Assumes full power of sensor!Assumes full power of sensor!
Barrier Sensors TopologiesBarrier Sensors Topologies
Disc-based sensing: Disc-based sensing: where each active where each active sensor has a sensing radius of sensor has a sensing radius of rr; any ; any object within the disc of radius object within the disc of radius r r centered centered at an active sensor is reliably detected by at an active sensor is reliably detected by it.it.
RIS scheme: RIS scheme: Time is divided in regular Time is divided in regular intervals and in each interval, eachintervals and in each interval, each
sensor is active.sensor is active. Belt of dimension w X h : Belt of dimension w X h : A rectangular A rectangular
region.region.
Barrier Sensors TopologiesBarrier Sensors Topologies
Depends on the shape of the barrier/area to cover.
ReferencesReferences1- 1- Barrier coverage with wireless sensorsBarrier coverage with wireless sensorsSantosh Kumar, Ten H. Lai, Anish AroraSantosh Kumar, Ten H. Lai, Anish AroraAugust 2005August 2005MobiCom '05: Proceedings of the 11th annual international conference on Mobile computing and MobiCom '05: Proceedings of the 11th annual international conference on Mobile computing and
networkingnetworking2- Reliable density estimates for coverage and connectivity in thin strips of finite length2- Reliable density estimates for coverage and connectivity in thin strips of finite lengthPaul Balister, Béla Bollobas, Amites Sarkar, Santosh KumarPaul Balister, Béla Bollobas, Amites Sarkar, Santosh KumarSeptember 2007September 2007MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and
networkingnetworking3- 3- Coverage breach problems in bandwidth-constrained sensor networksCoverage breach problems in bandwidth-constrained sensor networks Maggie X. Cheng, Lu Ruan, Weili WuMaggie X. Cheng, Lu Ruan, Weili WuJune 2000June 2000ACM Transactions on Sensor Networks (TOSN), Volume 3 Issue 2ACM Transactions on Sensor Networks (TOSN), Volume 3 Issue 24- 4- Coverage protocols for detecting fully sponsored sensors in wireless sensor networksCoverage protocols for detecting fully sponsored sensors in wireless sensor networks Azzedine Boukerche, Xin FeiAzzedine Boukerche, Xin FeiOctober 2006October 2006PE-WASUN '06: Proceedings of the 3rd ACM international workshop on Performance evaluation of PE-WASUN '06: Proceedings of the 3rd ACM international workshop on Performance evaluation of
wireless ad hoc, sensor and ubiquitous networkswireless ad hoc, sensor and ubiquitous networks5- Results on coverage for finite wireless networks 5- Results on coverage for finite wireless networks Woei Ling Leow, Hossein Pishro-NikWoei Ling Leow, Hossein Pishro-NikAugust 2007August 2007IWCMC '07: Proceedings of the 2007 international conference on Wireless communications and mobile IWCMC '07: Proceedings of the 2007 international conference on Wireless communications and mobile
computingcomputing
References 2References 26- 6- Designing localized algorithms for barrier coverage Designing localized algorithms for barrier coverage Ai Chen, Santosh Kumar, Ten H. LaiAi Chen, Santosh Kumar, Ten H. LaiSeptember 2007September 2007MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and
networkingnetworking7- 7- Multi-Agent Simulation For Assessing Massive Sensor DeploymentMulti-Agent Simulation For Assessing Massive Sensor Deployment CAPT Sean E. Hynes, USMC, and Neil C. RoweCAPT Sean E. Hynes, USMC, and Neil C. RoweJuly 2004July 2004Journal of Battlefield Technology, Vol. 7, No. 2, July 2004, 23-26 Journal of Battlefield Technology, Vol. 7, No. 2, July 2004, 23-26 8-8-Constraint Coverage for Mobile Sensor NetworksConstraint Coverage for Mobile Sensor Networks S Poduri, GS Sukhatme S Poduri, GS Sukhatme April 2004April 2004Robotics and Automation. Proceedings. ICRA'04Robotics and Automation. Proceedings. ICRA'049- 9- Overload traffic management for sensor networksOverload traffic management for sensor networks Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbell, Jon CrowcroftChieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbell, Jon CrowcroftOctober 2007October 2007ACM Transactions on Sensor Networks (TOSN), Volume 3 Issue 4ACM Transactions on Sensor Networks (TOSN), Volume 3 Issue 410- 10- The self-protection problem in wireless sensor networksThe self-protection problem in wireless sensor networks Dan Wang, Qian Zhang, Jiangchuan LiuDan Wang, Qian Zhang, Jiangchuan LiuOctober 2007October 2007ACM Transactions on Sensor Networks (TOSN), Volume 3 Issue 4 ACM Transactions on Sensor Networks (TOSN), Volume 3 Issue 4
Thank YouThank You
Questions?