+ All Categories
Home > Documents > Achieving Long-Term Surveillance in VigilNet

Achieving Long-Term Surveillance in VigilNet

Date post: 30-Jan-2016
Category:
Upload: alyson
View: 22 times
Download: 0 times
Share this document with a friend
Description:
Achieving Long-Term Surveillance in VigilNet. Tian He, Pascal Vicaire, Ting Yan, Qing Cao, Gang Zhou, Lin Gu, Liqian Luo, Radu Stoleru, John A. Stankovic, Tarek F. Abdelzaher Department of Computer Science, University of Virginia IEEE Infocom 2006. outlines. Introduction Power management - PowerPoint PPT Presentation
Popular Tags:

of 40

Click here to load reader

Transcript
  • Achieving Long-Term Surveillance in VigilNetTian He, Pascal Vicaire, Ting Yan, Qing Cao, Gang Zhou, Lin Gu, Liqian Luo, Radu Stoleru, John A. Stankovic, Tarek F. Abdelzaher

    Department of Computer Science, University of Virginia

    IEEE Infocom 2006

  • outlinesIntroductionPower management Power management in VigilNetSystem implementationSystem evaluationConclusion

  • IntroductionVigilNetAn Integrated Sensor Network System for Energy-Efficient SurveillanceGoal : to achieve long-term surveillance in a realistic mission deployment.long-term : minimum 3 ~6 months life time http://www.cs.virginia.edu/~control/SOWN/index.html

  • IntroductionEnergy efficiencySingle protocol : the hardware designcoverageMACroutingdata disseminationdata gatheringdata aggregationdata cachingtopology managementclusteringplacement...etc.Our : an integrated multi-dimensional power management system.tripwire servicesentry serviceduty cycle scheduling

  • IntroductionContributions1) Our design is validated through an extensive system implementation: VigilNet a large-scale sensor network system delivered to military agencies.2) VigilNet takes a systematic approach. We propose a novel tripwire service, integrated with an effective sentry and duty cycle scheduling to increase the system lifetime.3) We devote considerable effort to evaluate the system with 200 XSM motes in an outdoor environment and an extensive simulation of 10,000 nodes.

  • Power managementSampling System regular reportingEx : Great Duck IslandPredefined sampling schedulesNodes can conserve energy by turning themselves off, according to a predefined schedule.Synchronized and coordinated operationsOnce the sampling interval is defined a priori, nodes can communicate in a synchronized fashion.Data aggregation and compressionSince channel media access is costly, especially when the receiver is in a deep-sleep state

  • Power managementSurveillance System : event-drivenCoverage controlactivating only a subset of nodes at a given point of time, waiting for potential targets.Duty cycle schedulingBy coordinating nodes sleep schedules, we can conserve energy without noticeably reducing the chance of detection.Incremental activationFirst activate only a subset of sensors for the initial detection, then activate other sensors to achieve a higher sensing fidelity.

  • Power management in VigilNetPower management requirements in VigilNetContinuous surveillanceVigilNet is a military surveillance application.Real-timeVigilNet is a real-time online system for target tracking.Rare and critical event detectionVigilNet deals with the rare and critical event model. In this model, the total duration of events is small.StealthinessDeployed in hostile environments, miniaturization makes nodes hard to detect.Flexibilitythe deployment of VigilNet is under different densities, topologies, sensing and communication capabilities.

  • Power management in VigilNet3 main power management strategies in VigilNettripwire servicesentry service duty cycle scheduling

  • Tripwire ServicesDivides the sensor field into multiple sections, called tripwire sections, and applies different working schedules to each tripwire section.A tripwire section can be either in an active or a dormant state.

  • Tripwire ServicesTripwire partitionVigilNet implements its tripwire partition policy based on the Voronoi diagram.Can reduce the energy consumption and the end-to-end delay in data delivery.A network with n bases is partitioned into n tripwire sections and each tripwire section contains exactly one base i.Every node in the network uniquely belongs to one and only one tripwire section.The base placement strategy is normally determined by the mission plan and topology.

  • Tripwire ServicesTripwire partition mechanism1) each base broadcasts one initialization beacon to its neighbors with a hop count parameter initialized to one2) Each receiving node maintains the minimum hop-count value of all beacons it received from the nearest base, in terms of the physical distance.Supported partition policiesHop count (currently used)Distance

  • Data Structure MaintenanceTripWire TableMax Num of TripWire Base a node can remember, currently set be 5TripWire IDHopsstatus (active, dormant)

  • 12Green: Base (active), Blue: Base (dormant), Yellow: MotesRed: example node

  • 12Green: Base (active), Blue: Base (dormant), Yellow: MotesRed: example node

  • 12Green: Base (active), Blue: Base (dormant), Yellow: MotesRed: example node8...Find min hop, if it choose the first one

  • Tripwire Services

  • Tripwire ServicesTripwire schedulingConfigure the state of each tripwire section by setting a 16 bits schedule. Each bit in the schedule denotes the state of this tripwire section in each round (rotation) up to 16 rounds. After 16 rounds, the pattern is repeated.Can assign 65536 different schedules to each tripwire and assign 65536^N (N is the number of tripwires.) different schedules to the network.The schedule can be predetermined or randomly generated.Random scheduling is done by setting the Tripwire Duty Cycle (TDC), which is the percentage of active rounds in the schedule.

  • Sentry serviceThe main purpose of the sentry service is to select a subset of nodes, called sentries.2 phases1) Nodes exchange neighboring information through hello messages.a sender attaches its node ID, position, number of neighbors and its own energy readings.2) each node sets a delay timerRenergy : weighted Energy rankRcover : weighted Cover rankOur : Renergy = Rcover

  • Sentry serviceRange of Vicinity (ROV)The effective range, in physical distance, of a sentrys declaration message.1) How to choose ROV?The sentry density is upper bounded by to achieve a 99% detection probabilitya sentry density of 0.008 nodes/m2 (ROV= 6 meters) with 8 meter sensing rangea lower density of 0.004 nodes/m2 (ROV=8.5 meters) with 14 meters sensing range

  • Sentry service 2) How to enforce ROV ?discard declaration messages from any sentry beyond the distance of ROV.provides a more predictable sentry distributionLocalization[38] is supported in VigilNet.

  • Sentry duty cycle schedulingTon be the active duration Toff be the inactive durationSentry Toggle Period (STP) : Ton + Toff Sentry Duty Cycle (SDC) : Ton / STPlowering the SDC value increases the detection delay and reduces the detection probabilityUse random duty cycle scheduling, not the sophisticated / optimal scheduling algorithms[33] to coordinate node activities to maximize performance

  • Integrated solutiontripwire service controls the network-wide distribution of power consumption among sectionsTripwire Duty Cycle (TDC), the percentage of active time for each tripwire section, to control the network-wide energy burning rate.sentry service controls the power distribution within each section.use the Range of Vicinity (ROV) parameter to control the energy-burning rate of active sections.duty cycle scheduling controls the energy-burning rate of individual sentry nodes Sentry Duty Cycle (SDC) parameter is used to control the awareness of sentry nodes, which is the percentage of active time

  • System implementation

  • System implementationOS : TinyOSLanguage : NesCCode size : about 40,000 lines of code, supporting MICA2 and XSM mote platforms.83,963 bytes of code memory3,586 bytes of data memoryNodes are randomly placed roughly 10 meters apart, deployed 200 XSM motes on a dirt T-shape road (200 * 300 meters).

  • System evaluation

  • The Voronoi-based tripwire partitioning is very effective and that all nodes attach to the nearest base nodes through the shortest path.

  • It is not the case that nodes with highvoltages are always selected as sentries.

    The average minimum distancesbetween sentry-pairs is 9.57 meterswith 1.88 meters standard deviation.

  • communication delay < detection report < classification delay < velocity estimations delay

  • SSA (Sentry Service Activation)1)To reduce the detection delay, choose a sentry toggle period as small as possible.

    2)To increase the network lifetime, select a small sentry duty cycle.SDC, detection delay

  • SDC, detection prob

  • STP, detection delaySTP, detection prob

  • a low tripwire duty cycle(TDC) increases the network lifetime, but increases the detection delay and decreasesthe detection probabilityTDC, detection probTDC, detection delay

  • it takes more time todetect slow targets than faster ones;a high target speeddecreases the detection delayTarget speed ,detection delay

  • ConclusionsIt is a comprehensive case study on power management in a realistic environment with a large testbed.Investigate the power management at the network, section and node level by using a novel tripwire service, sentry service and duty cycle scheduling, respectively.

  • References[7] T. Yan, T. He, and J. Stankovic, Differentiated Surveillance Service for Sensor Networks, in SenSys 2003, November 2003.[33] Q. Cao, T. Abdelzaher, T. He, and J. Stankovic, Towards Optimal Sleep Scheduling in Sensor Networks for Rare Event Detection , in IPSN05, 2005.[37] G.Simon and et. al., Sensor Network-Based Countersniper System, in SenSys 2004, November 2004.[38] T. He, S. Krishnamurthy, J. A. Stankovic, and T. Abdelzaher, An Energy-Effi cient Surveillance System Using Wireless Sensor Networks, in MobiSys04, June 2004.[39] R. Stoleru, T. He, and J. A. Stankovic, Walking GPS: A Practical Solution for Localization in Manually Deployed Wireless Sensor Networks, in EmNetS-I, October 2004. [41] G. Zhou, T. He, and J. A. Stankovic, Impact of Radio Irregularity on Wireless Sensor Networks, in MobiSys04, June 2004.[43] T. He, C. Huang, B. M. Blum, J. A. Stankovic, and T. Abdelzaher, Range-Free Localization Schemes in Large-Scale Sensor Networks, in MOBICOM03, September 2003.[44] T. He, B. M. Blum, J. A. Stankovic, and T. F. Abdelzaher, AIDA: Adaptive Application Independent Data Aggregation in Wireless Sensor Networks, ACM Transactions on Embedded Computing System, Special issue on Dynamically Adaptable Embedded Systems, 2004. http://www.cs.virginia.edu/~control/SOWN/index.htmlhttp://www.xbow.com

  • ReferencesTian He, Pascal Vicaire, Ting Yan, Qing Cao, Gang Zhou, Lin Gu, Liqian Luo, Radu Stoleru, John A. Stankovic, and Tarek Abdelzaher. Achieving Long-Term Surveillance in VigilNet. IEEE Infocom, April 2006.Liqian Luo, Tian He, Gang Zhou, Lin Gu, Tarek Abdelzaher, and John Stankovic. Achieving Repeatability of Asynchronous Events in Wireless Sensor Networks with EnviroLog. IEEE Infocom, April 2006 Qing Cao, Tian He, Lei Fang, Tarek Abdelzaher, John Stankovic, and Sang Son. Efficiency Centric Communication Model for Wireless Sensor Networks. IEEE Infocom, April 2006 Gang Zhou, Chengdu Huang, Ting Yan, Tian He, and John A. Stankovic. MMSN: Multi-Frequency Media Access Control for Wireless Sensor Networks. IEEE Infocom, April 2006


Recommended