2 options
Wireless sensor networks / Liam I. Farrugia, editor.
- Format:
- Book
- Series:
- Computer science, technology and applications.
- Computer science, technology and applications
- Language:
- English
- Subjects (All):
- Wireless sensor networks.
- Physical Description:
- 1 online resource (183 p.)
- Edition:
- 1st ed.
- Place of Publication:
- New York : Nova Science Publishers, c2011.
- Language Note:
- English
- Summary:
- A wireless sensor network (WSN) consists of spatially distributed autonomous sensors to co-operatively monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants. This title presents topical research data from around the globe in the field of wireless sensor networks.
- Contents:
- Intro
- WIRELESS SENSOR NETWORKS
- CONTENTS
- PREFACE
- Chapter 1 IMPROVEMENT IN LIFETIME OF WIRELESS SENSOR NETWORKS USING PERFECT DIFFERENCE SET- NETWORKS
- 1. WIRELESS SENSOR NETWORKS
- 1.1. Review and Introduction
- 1.2. Characteristics and Requirements of Wireless Sensor Networks
- 1.3. Fixed (Non Mobile) Deployment of Sensor Nodes
- 1.4. Research Approach
- 1.5. UbiSens: Project at VLSI Lab VNIT Nagpur
- 2. PERFECT DIFFERENCE SET NETWORKS FOR WIRELESS SENSOR NETWORKS
- 2.1. Projective Geometry in WSN
- 2.2. Fixed Geometrical Deployment of Sensor Nodes
- 2.3. Perfect Difference Set
- 2.4. Perfect Difference Networks
- 2.5. Collective Communication in PDS Networks
- 2.6. Perfect Difference Set - Wireless Sensor Network (PDS-WSN)
- 2.7. Routing in PDS-WSN
- 2.8. Clustering Wireless Sensor Network with PDS-WSN
- 2.9. Experimental Results
- 2.10. Limitations of PDS-WSN
- 2.11. Conclusion
- REFERENCES
- Chapter 2 KEY MANAGEMENT PROTOCOL FOR HETEROGENEOUS SENSOR NETWORKS
- 1.1 INTRODUCTION
- 1.2 HETEROGENEOUS SENSOR NETWORKS KEY MANAGEMENT
- 1.3 A NOVEL KEY PRE-DISTRIBUTION PROTOCOL BASED ON PAIR-WISE BALANCED DESIGN
- 1.3.1 Basic Knowledge
- 1.3.2 Pair-wise Balanced Design Based Key Pre-distribution Scheme
- 1.3.2.1 DCPBD Scheme
- 1.3.2.2 VDCPBD Scheme
- 1.4 AN IMPROVED KEY MANAGEMENT PROTOCOL FOR HSN
- 1.4.1 Assumption
- 1.4.2 The Scheme Description
- 1.4.3 Setting Up Si,j
- 1.5 A LOCATION-AWARE AND SECRET-SHARE BASED DYNAMIC KEY MANAGEMENT PROTOCOL
- 1.5.1 Basic knowledge
- 1.5.2 Assumption
- 1.5.3 Basic idea
- 1.5.4 The application of division storage of keys
- 1.5.5 The eviction of the compromised original cluster head node
- 1.5.6 The addition of new gateways and nodes
- CONCLUSION
- Chapter3DATAAGGREGATIONINWSNS:STATEOFTHEARTANDAMULTI-CRITERIAPROPOSAL.
- Abstract
- 1.1.Introduction
- 1.1.1.WSNsandtraditionalnetworks
- 1.1.2.SomeDefinitions
- 1.1.3.ClassificationofDataAggregationmechanisms
- 1.1.4.Organization
- 2.2.Structure-FreeDataAggregation
- 2.2.1.Query-BasedAggregation
- 2.2.2.MobileAgents
- 3.3.Structure-BasedDataAggregation
- 3.3.1.Tree-Based
- Someproposalsoverthetree-basedstructure
- Parent-selectionmethods
- Communicationdelay
- Synchronizationproblem
- 3.3.2.Cluster-Based
- EfficientStatic-Clustering-Centricdataaggregation
- LEACH
- HEED
- Furtherproposals
- Data-Aggregation-CentricCluster-BasedWSN
- ADA
- Event-CentricDataAggregationoverCluster-BasedWSN
- EDMDP
- 4.4.Multi-CriteriaDataAggregation
- 4.4.1.Systemdesign
- 4.4.1.1.Agentroleandimplementation
- 4.4.1.2.Agentknowledgebase
- Agentknowledgefromtheroutingprotocol
- 4.4.2.Dataaggregationsessionscenario
- 4.4.3.CooperationMessage
- 4.4.4.AgentStrategy
- Energy
- Networkdensity
- Positionwithinthenetwork
- InformationImportanceDegree
- 5.5.DiscussionofDataAggregationMechanisms
- 6.6.ImpactofNetworkDeploymentonDataCredibility
- 6.6.1.LowDensityWSNs
- 6.6.2.HighDensityWSNs
- 7.7.Security
- 7.7.1.Hop-by-HopEncryption
- 7.7.2.End-to-EndEncryption
- 7.7.3.Trust-basedauthentication
- 8.8.DataAggregationasaLayer
- 9.9.Conclusion
- References
- Chapter4DETECTIONOFMALICIOUSCODEINJECTIONATTACKSINSENSORNETWORKSUSINGSEQUENTIALANALYSIS
- Abstract
- 1.Introduction
- 2.Models
- 3.MaliciousCodeDetectionUsingSequentialProbabilityRatioTest
- 4.SecurityAnalysis
- 5.Conclusions
- Chapter5THESIMULATIONONWIRELESSSENSORNETWORKS
- 2.2.SimulationArchitectureforWSNs
- 3.3.WSNSimulationTools
- 3.3.1.NS-2
- 3.3.2.OMNET++
- 3.3.3.TOSSIM
- 3.3.4.J-Sim
- 3.3.5.OPNET
- 3.3.6.SENSIM
- 3.3.7.SENSE
- 3.3.8.GloMoSim
- 3.3.9.ATEMU
- 3.3.10.SNetSim.
- 3.3.11.EmStar
- 3.3.12.Prowler/JProwler
- 3.3.13.SNAP
- 3.3.14.Shawn
- 3.3.15.SensorMaker
- 4.4.EvaluationMethodologies
- 4.4.1.ReusabilityandExtensibility(RE)
- 4.4.2.PerformanceandScalability(PS)
- 4.4.3.Graphics,DebugandTrace(GDT)
- 5.5.Conclusion
- Chapter6CONTINUOUSDATACOLLECTIONINWIRELESSSENSORNETWORKS*
- 2.RelatedWork
- 3.Preliminaries
- 3.1.ModelandNotations
- 3.2.NetworkCodingbasedDataCollection:SuperiorityandProblems
- 4.PartialNetworkCodingbasedDataStorageandReplacement
- 4.1.OverviewofPartialNetworkCoding
- 4.2.DataStorageandReplacementinPNC
- 4.3.PerformanceAnalysisofPNCandEnhancements
- 5.ProtocolDesignandPracticalIssues
- 5.1.ComputationandCommunicationOverheads
- 5.2.MultipleDataPattern
- 5.3.CollaborativeandDistributedImplementation
- 6.PerformanceEvaluation
- 6.1.SimulationSettings
- 6.2.ComparisonofEnergyConsumption
- 6.3.PerformanceofPNC
- 6.3.1.PNCvsNon-NC
- 6.3.2.EffectofBufferSize
- 6.3.3.ImpactofN
- 6.4.EffectofClustering
- 6.5.ImpactofMultiplePattern
- 7.ConclusionsandFutureWork
- Acknowledgment
- Chapter 7 ON LOAD-BALANCED DATA GATHERING FOR LIFETIME MAXIMIZATION IN WIRELESS SENSOR NETWORKS
- ABSTRACT
- 1. INTRODUCTION
- 2. CHALLENGES AND DESIGN ISSUES
- 2.1. Traffic Model
- 2.2. Data Aggregation
- 2.3. Energy Model: Load of a Node
- 2.4. Node Deployment
- 2.5. Node Heterogeneity and Mobility
- 3. LOAD BALANCING TECHNIQUES
- 3.1. Load Balancing with Data Aggregation: Uniform Traffic
- 3.1.1. Hierarchical Data Gathering: Clustering Approach
- 3.1.1.1. Distributed Algorithms
- 3.1.1.2. Centralized Algorithms
- 3.1.2. Non-Hierarchical Data Gathering
- 3.1.2.1. Distributed Algorithms
- 3.1.2.2. Centralized Algorithms
- 3.2. Load Balancing without Data Aggregation
- 3.2.1. One-Dimensional Node Distribution.
- 3.2.2. Non-Uniform Node Deployment Schemes
- 3.2.3. Multiple Sinks/Relay Nodes
- 3.3. Load Balancing for Query-Based/Event Driven Traffic
- 3.4. Load Balancing in Heterogeneous Networks
- 4. FUTURE DIRECTIONS
- 5. CONCLUSION
- Commentary FUTURE DIRECTION OF NETWORK OPERATORS: WIRELESS MACHINE-TO-MACHINE COMMUNICATIONS NETWORK INFRASTRUCTURE
- 2. NEW NETWORK
- 3. COMPARISONS WITH OTHER NETWORKS
- 4. STANDARDIZATION
- 5. WIDE AREA UBIQUITOUS NETWORK
- 5. APPLICATION EXPERIMENTS IN TOKYO [6]
- INDEX.
- Notes:
- Description based upon print version of record.
- Includes bibliographical references and index.
- Description based on print version record.
- ISBN:
- 1-61728-328-2
- OCLC:
- 923662437
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.