پاورپوینت کامل Data Storage selection in sensor networks 73 اسلاید در PowerPoint

توجه : این فایل به صورت فایل power point (پاور پوینت) ارائه میگردد

 پاورپوینت کامل Data Storage selection in sensor networks 73 اسلاید در PowerPoint دارای ۷۳ اسلاید می باشد و دارای تنظیمات کامل در PowerPoint می باشد و آماده ارائه یا چاپ است

شما با استفاده ازاین پاورپوینت میتوانید یک ارائه بسیارعالی و با شکوهی داشته باشید و همه حاضرین با اشتیاق به مطالب شما گوش خواهند داد.

لطفا نگران مطالب داخل پاورپوینت نباشید، مطالب داخل اسلاید ها بسیار ساده و قابل درک برای شما می باشد، ما عالی بودن این فایل رو تضمین می کنیم.

توجه : در صورت  مشاهده  بهم ریختگی احتمالی در متون زیر ،دلیل ان کپی کردن این مطالب از داخل فایل می باشد و در فایل اصلی پاورپوینت کامل Data Storage selection in sensor networks 73 اسلاید در PowerPoint،به هیچ وجه بهم ریختگی وجود ندارد

بخشی از مطالب داخلی اسلاید ها

پاورپوینت کامل Data Storage selection in sensor networks 73 اسلاید در PowerPoint

اسلاید ۴: ۴Disaster ResponseCirculatory NetEmbed numerous distributed devices to monitor and interact with physical world: in work-spaces, hospitals, homes, vehicles, and “the environment” (water, soil, air…)Network these devices so that they can coordinate to perform higher-level tasks.Requires robust distributed systems of tens of thousands of devices.The long term goal

اسلاید ۵: ۵Sensor Net Sample AppsTraditional monitoring apparatus.Earthquake monitoring in shake-test sites.Vehicle detection: sensors along a road, collect data about passing vehicles.Habitat Monitoring: Storm petrels on Great Duck Island, microclimates on James Reserve.

اسلاید ۶: ۶Overview of researchSensor network challengesOne approach: Directed diffusion Basic algorithm Initial simulation results (Intanagowat)Other interesting localized algorithms in progress:Aggregation (Kumar)Adaptive fidelty (Xu)Address free architecture, Time synch (Elson)Localization (Bulusu, Girod)Self-configuration using robotic nodes (Bulusu, Cerpa)Instrumentation and debugging (Jerry Zhao)

اسلاید ۷: ۷The Challenge is Dynamics!The physical world is dynamic Dynamic operating conditionsDynamic availability of resources… particularly energy!Dynamic tasksDevices must adapt automatically to the environmentToo many devices for manual configurationEnvironmental conditions are unpredictableUnattended and un-tethered operation is key to many applications

اسلاید ۸: ۸ApproachEnergy is the bottleneck resourceAnd communication is a major consumer–avoid communication over long distancesPre-configuration and global knowledge are not applicableAchieve desired global behavior through localized interactions Empirically adapt to observed environmentLeverage pointsSmall-form-factor nodes, densely distributed to achieve Physical locality to sensed phenomenaApplication-specific, data-centric networksData processing/aggregation inside the network

اسلاید ۹: ۹Directed Diffusion ConceptsApplication-aware communication primitivesexpressed in terms of named data (not in terms of the nodes generating or requesting data) Consumer of data initiates interest in data with certain attributesNodes diffuse the interest towards producers via a sequence of local interactionsThis process sets up gradients in the network which channel the delivery of dataReinforcement and negative reinforcement used to converge to efficient distributionIntermediate nodes opportunistically fuse interests, aggregate, correlate or cache data

اسلاید ۱۰: ۱۰Illustrating Directed DiffusionSinkSourceSetting up gradientsSinkSourceSending dataSinkSourceRecoveringfrom node failureSinkSourceReinforcingstable path

اسلاید ۱۱: ۱۱Sensor Network Tomography: Key Ideas and ChallengesKinds of tomogramsnetwork healthresource-level indicatorsresponses to external stimuliCan exchange resource health during low-level housekeeping functions… such as radio synchronizationKey challenge: energy-efficiencyneed to aggregate local representationsalgorithms must auto-scaleoutlier indicators are different

اسلاید ۱۲: ۱۲Self configuring networks using and supporting robotic nodes (Bulusu, Cerpa, Estrin, Heidemann, Mataric, Sukhatme)Robotics introduces self-mobile nodes and adaptively placed nodesSelf configuring ad hoc networks in the context of unpredictable RF environmentPlace nodes for network augmentation or formationPlace beacons for localization granularity

اسلاید ۱۳: ۱۳Programming Sensor Nets Is HardMonths of lifetime required from small batteries3-5 days naively; can’t recharge oftenInterleave sleep with processingLossy, low-bandwidth, short range communicationNodes coming and going~20Multi-hopRemote, zero administration deploymentsHighly distributed environmentLimited Development ToolsEmbedded, LEDs for Debugging!Need high level abstractions!200-800 instructions per bit transmitted!High-Level Abstraction Is Needed!

اسلاید ۱۴: ۱۴A Solution: Declarative QueriesUsers specify the data they wantSimple, SQL-like queriesUsing predicates, not specific addressesSame spirit as Cougar – Our system: TinyDBChallenge is to provide:Expressive & easy-to-use interfaceHigh-level operatorsWell-defined interactions“Transparent Optimizations” that many programmers would missSensor-net specific techniquesPower efficient execution frameworkQuestion: do sensor networks change query processingYes!

اسلاید ۱۵: ۱۵OverviewTinyDB: Queries for Sensor NetsProcessing Aggregate Queries (TAG)Taxonomy & ExperimentsAcquisitional Query ProcessingOther Research Future Directions

اسلاید ۱۶: ۱۶OverviewTinyDB: Queries for Sensor NetsProcessing Aggregate Queries (TAG)Taxonomy & ExperimentsAcquisitional Query ProcessingOther Research Future Directions

اسلاید ۱۷: ۱۷TinyDB Demo

اسلاید ۱۸: ۱۸TinyOSSchemaQuery ProcessorMultihop NetworkTinyDB ArchitectureSchema:“Catalog” of commands & attributesFilterlight > 400get (‘temp’)Aggavg(temp)QueriesSELECT AVG(temp) WHERE light > 400ResultsT:1, AVG: 225T:2, AVG: 250TablesSamplesgot(‘temp’)Name: tempTime to sample: 50 uSCost to sample: 90 uJCalibration Table: 3Units: Deg. FError: ± ۵ Deg FGet f : getTempFunc()…getTempFunc(…)TinyDB~10,000 Lines Embedded C Code~5,000 Lines (PC-Side) Java~3200 Bytes RAM (w/ 768 byte heap)~58 kB compiled code(3x larger than 2nd largest TinyOS Program)

اسلاید ۱۹: ۱۹Declarative Queries for Sensor NetworksExamples:SELECT nodeid, nestNo, lightFROM sensorsWHERE light > 400EPOCH DURATION 1s1EpochNodeidnestNoLight0117455022538911174221225405Sensors“Find the sensors in bright nests.”

اسلاید ۲۰: ۲۰Aggregation QueriesEpochregionCNT(…)AVG(…)0North33600South35201North33701South3520“Count the number occupied nests in each loud region of the island.”SELECT region, CNT(occupied) AVG(sound)FROM sensorsGROUP BY regionHAVING AVG(sound) > 200EPOCH DURATION 10s3Regions w/ AVG(sound) > 200SELECT AVG(sound)FROM sensorsEPOCH DURATION 1