E-Book, Englisch, Band 28, 915 Seiten
Mao / Zhu / Midkiff Ad Hoc Networks
1. Auflage 2010
ISBN: 978-3-642-11723-7
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
First International Conference, ADHOCNETS 2009, Niagara Falls, Ontario, Canada, September 22-25, 2009. Revised Selected Papers
E-Book, Englisch, Band 28, 915 Seiten
ISBN: 978-3-642-11723-7
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
This volume constitutes the refereed proceedings of the First International Conference on Ad Hoc Networks, held in Niagara Falls, Ontario, Canada, in September 2009. The 62 revised full papers presented were carefully reviewed. Ad hoc networks refer to the wireless networking paradigm that covers a variety of network forms for specific purposes, such as mobile ad hoc networks, sensor networks, vehicular networks, underwater networks, underground networks, personal area networks, and home networks. The various forms of ad hoc networks promise a broad scope of applications in civilian, commercial, and military areas, which have led to significant new research problems and challenges, and have attracted great efforts from academia, industry, and government. This unique networking paradigm necessitates re-examination of many established wireless networking concepts and protocols, and calls for developing new fundamental understanding of problems such as interference, mobility, connectivity, capacity, and security, among others. While it is essential to advance theoretical research on fundamentals and practical research on efficient algorithms and protocols, it is also critical to develop useful applications, experimental prototypes, and real-world deployments to achieve a practical impact on our society for the success of this networking paradigm.
Autoren/Hrsg.
Weitere Infos & Material
1;Preface;5
2;Organization;6
3;Table of Contents;10
4;1st ICST International Conference on Ad Hoc Networks;16
4.1;Supporting Proactive Application Event Notification to Improve Sensor Network Performance;17
4.1.1;Introduction;17
4.1.2;Goals and Challenges of WSN Architectures and Middleware Support;19
4.1.3;Related Work;19
4.1.3.1;On Existing Architectures;20
4.1.3.2;On Existing Middleware;20
4.1.4;X-Lisa, an Architecture for Cross-Layer Information Sharing;21
4.1.4.1;Information Sharing Structures;21
4.1.4.2;Event Signaling;22
4.1.4.3;Information Exchange;22
4.1.4.4;Important Services;22
4.1.5;Middleware Support;22
4.1.5.1;General Ideas;22
4.1.5.2;Integration into an Information-Sharing Architecture;23
4.1.5.3;Composite Query Registration and Deregistration;25
4.1.5.4;Interest Registration and Deregistration;26
4.1.5.5;Query Notification;26
4.1.6;Evaluation of Middleware Support;27
4.1.6.1;Health Monitoring Test Scenario;27
4.1.6.2;Simulation Results;29
4.1.7;Conclusions and Future Work;30
4.1.8;References;31
4.2;An Energy-Efficient Cluster-Head Selection Protocol for Energy-Constrained Wireless Sensor Networks;33
4.2.1;Introduction;33
4.2.2;Related Work;35
4.2.3;ECHS Protocol;37
4.2.3.1;Two-Phase Cluster Set-Up Period;38
4.2.3.2;Steady State Period;41
4.2.4;Simulations;42
4.2.5;Conclusion;45
4.2.6;References;45
4.3;Optimization of Cluster Heads for Energy Efficiency in Large-Scale Wireless Sensor Networks;47
4.3.1;Introduction;47
4.3.2;Related Work;49
4.3.3;Cost Model and Problem Formulation;50
4.3.3.1;Energy Consumption Model;50
4.3.3.2;Problem Formulation;51
4.3.4;Optimizing Number and Location of CHs;52
4.3.4.1;Analytical Derivation for Uniform Distribution;52
4.3.4.2;Algorithm Design for General Distribution;54
4.3.5;Performance Evaluation;55
4.3.5.1;Implementation and Experimental Settings;55
4.3.5.2;Case Study for Uniform Distribution;55
4.3.5.3;Case Study for General Distribution;57
4.3.6;Conclusion and Future Work;60
4.3.7;References;61
4.4;Optimal Cluster Sizes for Wireless Sensor Networks: An Experimental Analysis;63
4.4.1;Introduction;63
4.4.2;Current Practice for Clustering Algorithms;64
4.4.2.1;State of the Art Clustering Protocols;65
4.4.2.2;Evaluation Methodologies for Clustering Algorithms;67
4.4.2.3;Related Efforts in Clustering Analysis;68
4.4.3;Defining the Optimal Cluster;69
4.4.4;Identifying the Optimal Cluster;70
4.4.4.1;Cluster Size C;71
4.4.4.2;Number of Base Stations M;72
4.4.4.3;Position of the Cluster Head PCH;73
4.4.4.4;In-Network Processing IN;74
4.4.4.5;Node Density N/A2;75
4.4.5;Conclusions and Future Work;75
4.4.6;References;76
4.5;A Parallel Paths Communication Technique for Energy Efficient Wireless Sensor Networks;78
4.5.1;Introduction;78
4.5.2;Network Model and Problem Definition;80
4.5.3;A Parallel Path Communication Technique;82
4.5.3.1;Algorithm Description;82
4.5.3.2;Forming Gradient Bands;82
4.5.3.3;Group Leader Election;83
4.5.3.4;Communication Network Setup Phase;84
4.5.4;Properties of the Parallel Path Technique;84
4.5.5;Simulation Setup;87
4.5.6;Performance Comparison;88
4.5.7;Conclusion;91
4.5.8;References;91
4.6;Scalable Max-Min Fairness in Wireless Ad Hoc Networks;93
4.6.1;Introduction;93
4.6.2;The Macro Model;94
4.6.3;Applying the Macro Model to Max-Min Fairness;95
4.6.4;Comparison of Three Methods;98
4.6.4.1;Experiment Model;98
4.6.4.2;Node-Path Model;98
4.6.4.3;Estimation Model;99
4.6.5;Simulation Results;99
4.6.5.1;600-Node and 20-Flow;99
4.6.5.2;600-Node and Different-Flow;102
4.6.5.3;1000-Node and 100-Flow;103
4.6.5.4;Time Square;104
4.6.6;Conclusions and Future Work;106
4.6.7;References;106
4.7;Upper Bounding Service Capacity in Multihop Wireless SSMA-Based Ad Hoc Networks;108
4.7.1;Introduction;108
4.7.2;Joint Transmission Scheduling and Power Control Problem Formulation;110
4.7.3;Tabu Search-Based Heuristic Algorithm;113
4.7.4;Simulations and Results;118
4.7.5;Conclusions;122
4.7.6;References;122
4.8;QoS over Real-Time Wireless Multi-hop Protocol;124
4.8.1;Introduction;124
4.8.2; Related Work;125
4.8.3;RT-WMP Overview;126
4.8.3.1;Protocol Operations.;127
4.8.3.1.1;The Link Quality Matrix.;127
4.8.3.1.2;Error Handling in RT-WMP.;128
4.8.3.1.3;Worst-Case in RT-WMP.;128
4.8.4;System Overview;129
4.8.4.1;Available Time;129
4.8.4.2;Protocol Operations;130
4.8.5; The RT-WMP QoS Extension Details;131
4.8.5.1;Frame Header Modification;131
4.8.5.2;Phases of the Protocol;132
4.8.5.2.1;The Message Selection Phase.;132
4.8.5.2.2;The QoS Authorization Phase.;132
4.8.5.2.3;The QoS Message Phase.;133
4.8.5.3;Message Priority Policy;133
4.8.6;Flow Admission Control;134
4.8.6.1;Available Resource Estimation;134
4.8.6.1.1;Principle of Operations.;135
4.8.7; Evaluation;137
4.8.7.1;Available Time;137
4.8.7.2;RT-WMP Traffic Impact;138
4.8.7.3;Fairness;138
4.8.7.4;End-to-End Delay;139
4.8.7.5;Multi-hop Transmission;139
4.8.7.6;PDR Evaluation;140
4.8.7.7;Real Scenario Experiments;140
4.8.8;Conclusions;141
4.8.9;References;142
4.9;Efficient Distribution of Large Files in UMTS Supported by Network Coded M2M Data Transfer with Multiple Generations;143
4.9.1;Related Previous Work;143
4.9.2;Enhanced Network Coding for Operation on Data of Arbitrary Size;144
4.9.2.1;Generations: Optimized Packet Combination;146
4.9.2.2;Analysis of Relationship between Different Figures of Merit;147
4.9.3;Numerical Results;149
4.9.3.1;Generation Size and File Size;150
4.9.3.2;Quality of Service (QoS) Requirements;151
4.9.3.3;Comparison of NC-MG-m2m File Sharing with Replicate-and-Forward m2m Data Dissemination;153
4.9.4;Summary;155
4.9.5;References;156
4.10;Enhancement of Self-organisation in Wireless Networking through a Cross-Layer Approach;158
4.10.1;Introduction;158
4.10.2;Self-organisation;159
4.10.2.1;Self-organising Networking Systems;160
4.10.2.2;Self-organising Algorithms in Networking Systems;160
4.10.3;Cross-Layer Design ;161
4.10.3.1;What Is the Cross-Layer Approach?;162
4.10.3.2;Cross-Layering in Self-organisation;162
4.10.4;Related Study;163
4.10.5;Demonstration of the Enhancement;163
4.10.5.1;Simulation and Results;164
4.10.6;Conclusions;170
4.10.7;References;171
4.11;SPECS: Secure and Privacy Enhancing Communications Schemes for VANETs;174
4.11.1;Introduction;174
4.11.2;Problem Statement;176
4.11.3;Preliminaries;177
4.11.3.1;Bilinear Maps;177
4.11.3.2;Bloom Filter;178
4.11.4;Our Solutions - SPECS;178
4.11.4.1;Initial Handshaking;179
4.11.4.2;Message Signing;180
4.11.4.3;Batch Verification;180
4.11.4.4;Real Identity Tracking;182
4.11.4.5;Group Key Generation;183
4.11.4.6;Group Message Signing and Verification;184
4.11.5;Analysis;184
4.11.5.1;Security Analysis;184
4.11.5.2;Analysis on Bloom Filter Approach;185
4.11.6;Simulation Results;186
4.11.6.1;Simulation Models;186
4.11.6.2;Simulation Results;187
4.11.7;Conclusions;188
4.11.8;References;189
4.12;Security and Privacy in a Sensor-Based Search and Rescue System;190
4.12.1;Introduction;190
4.12.2;SenSearch: A Brief Overview;191
4.12.3;Threat Model;192
4.12.4;Security and Privacy Framework;194
4.12.4.1;System Constraints;194
4.12.4.2;Design Overview;195
4.12.4.3;AP-Node Authentication and Initial Setup;196
4.12.4.4;Node-Node Authentication and Record Exchanges;200
4.12.5;Implementation and Performance;201
4.12.5.1;Performance: Cryptographic Operations;201
4.12.5.2;Performance: AP-Node Authentication and Initial Setup;202
4.12.5.3;Performance: Node-Node Authentication;203
4.12.5.4;Security Overhead;203
4.12.5.5;Power Consumption;204
4.12.6;Conclusion;204
4.12.7;References;204
4.13;Computationally Efficient Mutual Entity Authentication in Wireless Sensor Networks;206
4.13.1;Introduction;206
4.13.2;LPN Problem and HB-Family;207
4.13.2.1;LPN Problem;208
4.13.2.2;HB-Family Authentication;208
4.13.3;Proposed Mutual Authentication Protocols;210
4.13.3.1;Protocols Description;210
4.13.3.2;Protocol Parameters;211
4.13.3.3;Performance;213
4.13.4;Security Analysis;214
4.13.4.1;Threat Model;214
4.13.4.2;Security Properties;215
4.13.5;Application Scenarios;217
4.13.6;Conclusion and Further Work;219
4.13.7;References;219
4.14;Distributed Detection of Wormhole Attacks in Wireless Sensor Networks;222
4.14.1;Introduction;222
4.14.1.1;Related Work;223
4.14.1.2;Our Contribution;224
4.14.2;Definitions and Models;225
4.14.2.1;Communication Model;226
4.14.2.2;Adversary Model;227
4.14.3;Intrusion Detection System;227
4.14.3.1;Intrusion Detection Nodes;227
4.14.3.2;Detecting Wormholes;227
4.14.3.2.1;FMC Validation.;228
4.14.3.2.2;Active Wormholes.;229
4.14.3.2.3;Passive Wormholes.;229
4.14.3.2.4;Distinguishing Active from Passive Wormholes.;230
4.14.3.3;False Alarms;231
4.14.3.4;Response to Wormholes;233
4.14.4;Simulation;234
4.14.4.1;Connectivity of Sensor Nodes;234
4.14.4.2;ID Nodes Density;235
4.14.4.3;Effect of Wormhole Length on Detection;235
4.14.5;Conclusions and Future Work;236
4.14.6;References;237
4.15;Power-Aware Intrusion Detection in Mobile Ad Hoc Networks;238
4.15.1;Introduction;238
4.15.1.1;Our Contributions;239
4.15.2;Related Work;240
4.15.3;Intrusion Detection in MANETs;241
4.15.4;Evolutionary Computation Techniques in Intrusion Detection;242
4.15.4.1;Genetic Programming;242
4.15.4.2;Multi-Objective Optimisation (MOO);245
4.15.5;Power-Aware Intrusion Detection in MANETs;245
4.15.5.1;Experimental Results;247
4.15.6;Conclusions and Future Work;250
4.15.7;The Features;253
4.16;DHT-Based Detection of Node Clone in Wireless Sensor Networks;254
4.16.1;Introduction;254
4.16.2;Previous Protocols;255
4.16.2.1;Centralized Detection;255
4.16.2.2;Distributed Detection;256
4.16.3;Goals and Models;257
4.16.3.1;Security Goals and Performance Metrics;257
4.16.3.2;Network Model;257
4.16.3.3;Adversary Model;258
4.16.4;Proposed Protocol;259
4.16.4.1;Distributed Hash Table;259
4.16.4.2;Protocol Details;260
4.16.5;Analysis;262
4.16.5.1;Communication Cost;262
4.16.5.2;Storage Cost and Number of Witnesses;262
4.16.5.3;Security Analysis;263
4.16.6;Simulations;264
4.16.6.1;Settings;264
4.16.6.2;Protocol Performance;265
4.16.6.3;Resilience against Message-Discarding by Clones;266
4.16.7;Conclusion and Future Work;267
4.16.8;References;267
4.17;Connectivity-Aware Minimum-Delay Geographic Routing with Vehicle Tracking in VANETs;270
4.17.1;Introduction;270
4.17.2;Connectivity-Aware Minimum-Delay Geographic Routing;272
4.17.2.1;Assumptions and System Model;272
4.17.2.2;CMGR Protocol Operations;272
4.17.2.3;Route Selection Logic;273
4.17.2.4;Vehicle Tracking Mechanism in CMGR;274
4.17.3;Performance Evaluations;274
4.17.3.1;Simulation Settings;274
4.17.3.2;Simulation Results;275
4.17.4;Conclusion;279
4.17.5;References;280
4.18;Buckshot Routing - A Robust Source Routing Protocol for Dense Ad-Hoc Networks;282
4.18.1;Introduction;282
4.18.2;The Nature of Unidirectional Links;283
4.18.3;Impact on the Routing Layer;285
4.18.4;The Buckshot Routing Protocol;287
4.18.4.1;Lossy or Unidirectional Links;288
4.18.5;Evaluation;288
4.18.5.1;OMNeT++;288
4.18.5.2;TMote Sky;292
4.18.6;Related Work;294
4.18.7;Conclusion and Future Work;295
4.18.8;References;296
4.19;Enhanced Route-Split Routing Tolerant to Multiple Concurrent Link Failure for Mobile Ad Hoc Networks;298
4.19.1;Introduction;298
4.19.2;RSR (Route-Split Routing);299
4.19.2.1;Outline of RSR;299
4.19.2.2;Route Creation;300
4.19.2.3;Route Maintenance;301
4.19.2.4;Resiliency to Simultaneous Failure of RSR;302
4.19.3;Enhanced RSR;302
4.19.3.1;Proposal Mechanism 1;303
4.19.3.2;Proposal Mechanism 2;303
4.19.3.3;Proposal Mechanism 3;305
4.19.4;Simulation Evaluation;306
4.19.4.1;Simulation Environment;306
4.19.4.2;Simulation Results and Observations;308
4.19.5;Conclusion;312
4.19.6;References;313
4.20;A Simulation-Based Performance Analysis of VariousMultipath Routing Techniques in ZigBee Sensor Networks;314
4.20.1;Introduction;314
4.20.2;Multipath Routing;315
4.20.2.1;Multipath Formation Strategies;316
4.20.2.2;Multipath Usage Strategies;316
4.20.2.3;Benefits of Multipath Routing;317
4.20.2.4;The Challenges of Multipath Routing in the Wireless Domain;318
4.20.3;ZigBee Wireless Sensor Networks;318
4.20.3.1;ZigBee Network Topology;319
4.20.3.2;The ZigBee Stack;319
4.20.4;Simulations;320
4.20.4.1;Implemented Multipath Algorithms;321
4.20.4.2;Parameters;322
4.20.4.3;Metrics;323
4.20.4.4;Results;323
4.20.4.5;Per-Hop Packet Loss;328
4.20.5;Conclusion and Future Work;328
4.20.6;References;329
4.21;Centralized Routing and Scheduling Using Multi-Channel System Single Transceiver in 802.16d;330
4.21.1;Introduction;330
4.21.2;System Design Algorithms;331
4.21.2.1;Routing Path Construction Algorithm;332
4.21.2.2;Channel Assignment Algorithm for Multi-Channel System;333
4.21.2.3;Collision Free Centralized Scheduling Algorithm;334
4.21.3;Cross-Layer Design;336
4.21.4;Simulations;337
4.21.4.1;Performance Metrics;337
4.21.4.2;Simulation Setup;338
4.21.5;Results and Discussions;339
4.21.6;Conclusions;344
4.21.7;References;345
4.22;Contact Time in Random Walk and Random Waypoint: Dichotomy in Tail Distribution;347
4.22.1;Introduction;347
4.22.2;Model Analysis;349
4.22.2.1;Model Settings and Assumptions;349
4.22.2.2;Random Walk with Infinite Flight Lengths;350
4.22.2.3;Tail Behavior of Contact Time Distribution;352
4.22.2.4;Random Walk with Finite Flight Lengths;354
4.22.3;Validation;357
4.22.3.1;Infinite Flight Lengths without Pause;357
4.22.3.2;Finite Flight Lengths without Pause;358
4.22.4;Conclusion and Future Work;361
4.22.5;References;361
4.23;Throughput Analysis of IEEE 802.11 DCF in the Presence of Transmission Errors;363
4.23.1;Introduction;363
4.23.2;IEEE 802.11 Distributed Coordination Function (DCF);364
4.23.2.1;Transmission Errors;366
4.23.3;System Performance Analysis;368
4.23.3.1;Network Model Assumptions;368
4.23.3.2;Transmission Probability;368
4.23.3.3;The Throughput;372
4.23.4;Analysis Results;374
4.23.5;Conclusion;377
4.23.6;References;377
4.24;Effects of Unintentional Denial of Service (DOS) Due to Push-to-Talk (PTT) Delays on Performance of CSMA/CA Based Adhoc Land Mobile Radio (LMR) Networks;379
4.24.1;Introduction;379
4.24.2;Push-To-Talk (PTT) Delays;381
4.24.3;CSMA/CA Implementation for the Medium Access Layer (MAC);382
4.24.4;Unintentional Denial of Service (DOS) Due to RTSI Delays;382
4.24.5;Simulation;386
4.24.6;Conclusions;388
4.24.7;References;389
4.25;Achievable Region in Slotted ALOHA Throughput for One-Relay Two-Hop Wireless Network Coding;390
4.25.1;Introduction;390
4.25.2;Previous Work;392
4.25.2.1;System Description;392
4.25.2.2;Achievable Region of Direct Communication Systems;394
4.25.3;Achievable Region of Non-NC Systems;395
4.25.4;Achievable Region of NC Systems;399
4.25.5;Conclusion;404
4.25.6;References;405
4.26;Exact Models for the $k$-Connected Minimum Energy Problem;406
4.26.1;Introduction;406
4.26.2;The Homogeneous Minimum Energy Problem;408
4.26.3;Exact 1-Connected Models;409
4.26.3.1;Literature Review;409
4.26.3.2;A New Model;412
4.26.4;Exact k-Connected Models;412
4.26.5;Numerical Results;414
4.26.5.1;Computational Complexity;418
4.26.6;Discussion;418
4.26.7;References;419
4.27;Performance Evaluation of Quality of Service in IEEE 802.11e Wireless LANs;421
4.27.1;Introduction;421
4.27.2;Comparison of DCF and EDCA;423
4.27.2.1;Contention Window Based Priority;423
4.27.2.2;Arbitrary Interframe Space;423
4.27.2.3;Transmission Opportunity Limit;424
4.27.3;Average Conditional Collision Probability;424
4.27.3.1;Normal Contention Markov Backoff Process;424
4.27.3.2;Average Conditional Probability;425
4.27.4;Throughput Analysis;427
4.27.5;Model Validation;429
4.27.6;Conclusions;434
4.27.7;References;434
4.28;Cooperative Localization in GPS-Limited Urban Environments;436
4.28.1;Introduction;436
4.28.2;Related Work;437
4.28.3;Cooperative Localization;438
4.28.4;Sensor Evaluation and Error Models;441
4.28.5;Simulation Results;444
4.28.5.1;Simple Averaging: 300-Meter Maximum Range;444
4.28.5.2;Simple Averaging: 100-Meter Range;445
4.28.5.3;Simple Averaging: 15-Meter Range;446
4.28.5.4;Distribution of Error;446
4.28.5.5;Selective Averaging;447
4.28.5.6;Filtered Trilateration;448
4.28.6;Future Work;450
4.28.7;Conclusion;450
4.28.8;References;451
4.29;Tracking a Vehicle Moving in a Wireless Sensor Network;452
4.29.1;Introduction;452
4.29.2;Mote Topology and Communication;453
4.29.3;Hot Motes and Network Resolution;455
4.29.3.1;Hot Mote;455
4.29.4;Updating the Target Location over Time;456
4.29.5;Test Bed Experiment;457
4.29.6;Conclusions;462
4.29.7;References;463
4.30;Improved Topology Control Algorithms for Simple Mobile Networks;464
4.30.1;Introduction;464
4.30.2;Related Work;466
4.30.3;Preliminaries;467
4.30.3.1;Graph Definitions;467
4.30.3.2;Voronoi Diagram and Delaunay Triangulation;468
4.30.4;Decision Version of SMN;470
4.30.5;Optimization Version of SMN;472
4.30.5.1;Running Times;473
4.30.6;An Approximation Algorithm for SMN;475
4.30.7;Simulation Results;477
4.30.8;Conclusions and Future Work;478
4.30.9;References;479
4.31;Reliable Coverage Area Based Link Expiration Time (LET) Routing Metric for Mobile Ad Hoc Networks;480
4.31.1;Introduction;480
4.31.2;Related Work;481
4.31.2.1;AODV Overview;481
4.31.2.2;Coverage Area Analysis;482
4.31.2.3;Link Expiration Time;483
4.31.3;Proposed Routing Metric Description;483
4.31.4;Simulation Environment and Results;486
4.31.5;Conclusions;489
4.31.6;References;489
4.32;Constructing Minimum Relay Connected Sensor Coverin Heterogeneous Wireless Sensor Networks;491
4.32.1;Introduction;491
4.32.2;Related Work;493
4.32.3;Problem Formulation;494
4.32.4;Theoretical Analysis;495
4.32.4.1;Full Coverage;495
4.32.4.2;Relay Connectivity;497
4.32.5;Distributed Algorithm;498
4.32.5.1;MSC Construction;498
4.32.5.2;Relay Connectivity Reinforcement;500
4.32.6;Performance Evaluation;501
4.32.7;Conclusions;505
4.32.8;References;505
4.33;Experimentation Made Easy;507
4.33.1;Introduction;507
4.33.2;DES-Testbed;509
4.33.3;DES-TBMS;510
4.33.3.1;Architecture of DES-TBMS;510
4.33.3.2;DES-Cript;511
4.33.3.3;DES-Exp;512
4.33.3.4;DES-Mon;513
4.33.3.5;DES-Eval;513
4.33.3.6;DES-Vis;514
4.33.3.7;Experiment Workflow;514
4.33.4;Evaluation;516
4.33.4.1;Contributions of DES-TBMS;516
4.33.4.2;Limitations;516
4.33.5;Related Work;517
4.33.5.1;Testbeds;517
4.33.5.2;Simulation Environments;518
4.33.6;Conclusions and Future Work;518
4.33.7;References;519
4.34;Enhancing Learning Using Modular Wireless Sensor Networking (WSN) Hands-On Experiments;520
4.34.1;Introduction;520
4.34.2;Wireless Sensor Networks Platform Experiments;521
4.34.2.1;Experiment 1 – Basic Target Detection;522
4.34.2.2;Experiment 2 – Local, Selected and Consensus Decision on Target Detection;525
4.34.2.3;Experiment 3 – Motion Tracking;529
4.34.3;Assessment Survey and Evaluation;531
4.34.3.1;Assessment Survey;531
4.34.3.2;Results of the Survey;532
4.34.3.3;Conclusive Assessments;533
4.34.4;Conclusions;534
4.34.5;References;535
4.34.6;Appendix;536
4.35;Sensor Network in the Wireless UHF Band;537
4.35.1;Introduction;537
4.35.2;Data Acquisition System;538
4.35.2.1;Data from Sensors;539
4.35.3;Global Data Management;541
4.35.4;The State-of-the-Art and the Implemented Network;541
4.35.4.1;The Wireless Sensor Network (WSN);543
4.35.5;Implementation of the WSN in the UHF Band;544
4.35.6;Future Developments;548
4.35.7;Conclusions;548
4.35.8;References;549
4.36;VoIP Implementation and Experiments on a Mobile Wireless AdHoc Network;551
4.36.1;Introduction;551
4.36.2;Testbed Configuration and Network Operations;552
4.36.2.1;The ASNC Scheme;554
4.36.3;Testbed Implementation;555
4.36.3.1;Hardware Setup;555
4.36.3.2;Software Setup;555
4.36.4;Mobile Scenarios and Their Measurements;557
4.36.4.1;Measurements and Observations;557
4.36.5;Verification of Simulations;560
4.36.6;Conclusion;561
4.36.7;References;561
4.37;Relay Implementation in WiMAX System Level Simulator;563
4.37.1;Introduction;563
4.37.2;Characteristics of the Relay;564
4.37.3;System Model Architecture;565
4.37.3.1;Cellular Layout;565
4.37.3.2;System Model;565
4.37.3.3;Relay Selection;567
4.37.3.4;Effective SINR-Based Relay Selection Algorithm;567
4.37.3.5;Path Loss-Based Relay Selection Algorithm;568
4.37.4;Simulation Results;569
4.37.5;Conclusion;574
4.37.6;References;574
4.38;MeshMAC: Enabling Mesh Networking over IEEE 802.15.4 through Distributed Beacon Scheduling;575
4.38.1;Introduction;575
4.38.2;Related Work;576
4.38.3;The MeshMAC;579
4.38.3.1;Distributed Beacon Scheduling Specification;579
4.38.3.2;Mesh Data Transfer;580
4.38.3.3;MeshMAC Operation;581
4.38.4;Evaluation;582
4.38.4.1;Distributed Beacon Scheduling;583
4.38.4.2;Multipath Mesh Networking;585
4.38.4.3;Energy Efficiency;587
4.38.5;Conclusions;588
4.38.6;References;589
4.39;Compressing MAC Headers on Shared Wireless Media;590
4.39.1;Introduction;590
4.39.2;MAC Header Compression;594
4.39.2.1;Compression;594
4.39.2.2;Decompression;595
4.39.3;Compressing 802.11 Headers;599
4.39.3.1;Data Frames;600
4.39.3.2;ACK Frames;601
4.39.4;Experimental Results;602
4.39.4.1;Label Conflicts;602
4.39.4.2;Performance;603
4.39.5;Conclusions;604
4.39.6;References;605
4.40;An RTS Based Data Channel Reservations and Access Scheme in Multi-Channel Systems;606
4.40.1;Introduction;606
4.40.2;Motivation;607
4.40.3;Related Work;607
4.40.4;System Model;609
4.40.5;Simulation Model and Numerical Results;611
4.40.6;Future Work;618
4.40.7;Conclusion;618
4.40.8;References;619
4.41;Building Intrusion Detection with a Wireless Sensor Network;621
4.41.1;Introduction;621
4.41.2;Related Work;622
4.41.2.1;Visual Sensor Networks;622
4.41.2.2;Event Classification;623
4.41.2.3;Anomaly Detection;624
4.41.3;Office Monitoring;624
4.41.3.1;System Design;625
4.41.3.2;ART Neural Networks;626
4.41.3.3;System-Wide Anomaly Detection;628
4.41.4;Anomaly Detection Performance;631
4.41.4.1;Office Occupancy Patterns;631
4.41.4.2;Computation at Desktop PC;631
4.41.4.3;Detection Performance of the Anomaly Detectors;632
4.41.4.4;Message Load;633
4.41.4.5;Reporting and Triggering Delay;634
4.41.5;Conclusions and Future Work;634
4.41.6;References;635
4.42;Passive and Active Analysis in DSR-Based Ad Hoc Networks;637
4.42.1;Introduction;637
4.42.2;Motivation, Previous Work, Contributions;638
4.42.2.1;Motivation;638
4.42.2.2;Previous Work;639
4.42.2.3;Contributions;640
4.42.3;Network Model;640
4.42.4;Intelligent Jamming;641
4.42.5;Classification Algorithm;643
4.42.5.1;Handling Fluctuating Congestion Window Sizes;645
4.42.5.2;Cross-Protocol Detection;645
4.42.5.3;Dynamic Mean Delay Calculation;646
4.42.6;Numerical Results;646
4.42.7;Active Network Analysis;647
4.42.7.1;Controlling the Network;648
4.42.7.2;Lomb Periodogram;650
4.42.8;Conclusion;651
4.42.9;References;651
4.43;An E-Hospital Security Architecture;653
4.43.1;Introduction;653
4.43.2;Background and Related Work;654
4.43.2.1;E-Hospital System;654
4.43.2.2;Related Cryptography;656
4.43.3;Security Goal of E-Hospital;657
4.43.3.1;Related Privacy Acts and Regulations;657
4.43.3.2;User Requirements;658
4.43.3.3;Security Goal of E-Hospital;658
4.43.4;Security Architecture of E-Hospital;659
4.43.4.1;Layered Design to Meet Security Goals;659
4.43.4.2;Secure Communication Channel by Identity-Based Cryptography;661
4.43.4.3;Secure Communication between End User and Backbone Network by Policy Based Cryptography;663
4.43.4.4;Database Security;664
4.43.5;Conclusion and Future Work;664
4.43.6;References;665
4.44;Cooperative Certificate Revocation List Distribution Methods in VANETs;666
4.44.1;Introduction;666
4.44.2;Overview of DSRC/WAVE;668
4.44.3;Overview of Network Coding versus Erasure Coding;669
4.44.4;Overview of Previous CRL Distribution Methods;670
4.44.5;Overview of Code Torrent;671
4.44.5.1;Using Code Torrent for CRL Distribution;672
4.44.6;Development of Methods to Reduce Channel Contention;672
4.44.6.1;Description of "Most Pieces Broadcast" (MPB) Method;672
4.44.6.2;Description of “Generation Per Channel" (GPC) Method;674
4.44.7;Simulation Setup;675
4.44.8;Simulation Results and Analysis;676
4.44.9;Conclusion;677
4.44.10;References;678
4.45;Distributed Channel Selection for Ad-Hoc Networks in the Presence of Jamming Sources;680
4.45.1;Introduction;680
4.45.2;Problem Definition;681
4.45.3;Performance Testbed;683
4.45.3.1;Implementation of Distributed Channel Selection;684
4.45.3.2;Homogeneous Scenarios;685
4.45.3.3;Heterogeneous Scenarios;687
4.45.4;Conclusion and Future Work;691
4.45.5;References;691
4.46;Joint Random Access and Power Control Game in Ad Hoc Networks with Noncooperative Users;693
4.46.1;Introduction;693
4.46.2;Related Work;695
4.46.3;System Model and Problem Formulation;695
4.46.3.1;Random Access, Power Control and Link Capacity;695
4.46.3.2;Joint Random Access and Power Control Game;697
4.46.4;Existence of Nash Equilibrium;698
4.46.5;Distributed Algorithm;699
4.46.6;Conclusion and Future Work;703
4.46.7;References;703
4.47;Graph Marginalization for Rapid Assignment in Wide-Area Surveillance;705
4.47.1;Introduction;705
4.47.2;Decentralization of the Algorithm;706
4.47.3;The Sensor Network;708
4.47.3.1;Objects;709
4.47.3.2;Sensors;710
4.47.3.3;Objective;711
4.47.3.4;Probability That an Object Will Be Visible to a Sensor;711
4.47.4;Simulations;712
4.47.4.1;Data Structure;712
4.47.4.2;First Application;713
4.47.4.3;Second Application;715
4.47.5;Conclusion;716
4.47.6;References;717
4.48;Error Correction with the Implicit Encoding Capability of Random Network Coding;718
4.48.1;Introduction;718
4.48.2;Network Model;719
4.48.2.1;Random Network Coding;720
4.48.3;Error Correction in Random Network Coding: Traditional Method;722
4.48.3.1; Redundant Symbols;722
4.48.3.2;Redundant Packets;723
4.48.4;Error Correction in Random Network Coding: Proposed Method;724
4.48.4.1;Network Configurations;724
4.48.4.2;Example 3;726
4.48.5;Analysis;727
4.48.5.1;Probability of Decoding;728
4.48.5.2;Discussion of Complexity;729
4.48.5.3;Time Delay;729
4.48.5.4;Error Correcting Capability;729
4.48.6;Advantages;730
4.48.7;Conclusion;730
4.48.8;References;731
4.49;An End-to-End Loss Discrimination Scheme for Multimedia Transmission over Wireless IP Networks;732
4.49.1;Introduction;732
4.49.2;Theoretical Foundation of the WMPLD Algorithm;733
4.49.3;Implementation Aspects of WMPLD;734
4.49.3.1;Senders Behavior;734
4.49.3.2;Receivers Behavior;735
4.49.4;Simulation Results;736
4.49.4.1;Wireless Last Hop;737
4.49.4.2;Wireless Backbone;739
4.49.5;Conclusion;741
4.49.6;References;742
5;2009 International Workshop on Advanced Sensor Integration Technology;743
5.1;Architecture for WSN Nodes Integration in Context Aware Systems Using Semantic Messages;744
5.1.1;Introduction;744
5.1.2;Related Work;745
5.1.3;Semantic Adaptation;746
5.1.3.1;Information Representation;746
5.1.3.2;General Packet Structure;748
5.1.3.3;Network Protocol;749
5.1.4;Context Management;750
5.1.4.1;System General Operation;751
5.1.5;Prototype;752
5.1.5.1;Hardware Platform;752
5.1.5.2;Network Protocol;752
5.1.5.3;Software Implementation;753
5.1.5.4;Application Scenario;754
5.1.5.5;Prototype Analysis;755
5.1.6;Conclusions and Future Work;757
5.1.7;References;758
5.2;Performance Analysis of ZigBee Technology for Wireless Body Area Sensor Networks;760
5.2.1;Introduction;760
5.2.2;Architecture;762
5.2.2.1;System Architecture;762
5.2.2.2;WBASN Topology;764
5.2.3;ZigBee Network;765
5.2.4;Performance Evaluations;765
5.2.4.1;Simulation Setup;766
5.2.4.2;Average Reception Ratio and Throughput;767
5.2.4.3;Latency;769
5.2.4.4;Fairness;770
5.2.4.5;Mobility;771
5.2.5;Conclusion;772
5.2.6;References;773
5.3;Analytical Models of Cross-Layer Protocol Optimization in Real-Time Wireless Sensor $Ad Hoc$ Networks;775
5.3.1;Introduction;775
5.3.2;Quality of Service;777
5.3.2.1;Previous Research on Quality of Service in Cross-Layer Models;777
5.3.2.2;Data Classes and Protocol Layers;777
5.3.3;Analytical Models of Cross-Layer Design;780
5.3.3.1;Statistical Properties of Packetized Traffic;781
5.3.3.2;Statistical Properties of QoS Classes;782
5.3.3.3;Energy-Efficient Routing;783
5.3.3.4;Routing Policies;783
5.3.3.5;Network Processes and Conditional Rates;784
5.3.3.6;Protocol Parameters and QoS Metrics;785
5.3.4;Cross-Layer Optimization;787
5.3.4.1;Energy-Constrained QoS Optimization;787
5.3.4.2;Recursive Optimality Conditions with Complete Network Observations;788
5.3.4.3;Optimality Conditions with Markov Assumptions;789
5.3.5;Explicit Solutions versus Closed-Form Solutions;789
5.3.6;Conclusions;791
5.3.7;References;791
5.4;Programmable Re-tasking of Wireless Sensor Networks Using WISEMAN;793
5.4.1;Introduction;793
5.4.2;Overview of WISEMAN;795
5.4.2.1;WISEMAN’s Architecture;795
5.4.2.2;WISEMAN’s Language Constructs;797
5.4.3;Migration Procedures and Agent Execution Flow;799
5.4.3.1;Code Migration Methodology;800
5.4.3.2;Agent Execution Flow;801
5.4.4;Performance Evaluations;803
5.4.5;Conclusions;805
5.4.6;References;806
5.5;Oxybuoy: Constructing a Real-Time Inexpensive Hypoxia Monitoring Platform;808
5.5.1;Introduction;808
5.5.2;Oxybuoy Architecture;810
5.5.3;Experiments;812
5.5.4;Conclusion;816
5.5.5;References;817
5.6;An Energy-Efficient, Application-Oriented Control Algorithm for MAC Protocols in WSN;818
5.6.1;Introduction;818
5.6.2;Related Work;820
5.6.3;The Algorithm;821
5.6.3.1;Mapping Parameter for Traffic Load;821
5.6.3.2;The Balance Point;822
5.6.3.3;QoS Threshold;824
5.6.3.4;Control Threshold;825
5.6.3.5;Algorithm Description;825
5.6.4;Performance Evaluation;826
5.6.4.1;Simulation Setup;826
5.6.4.2;The Energy Consumption Efficiency of Single Application in the Network;827
5.6.4.3;The Energy Performance of Multiple Applications;828
5.6.5;Conclusion;829
5.6.6;References;830
5.7;An Integrated RFID and Sensor System for Emergency Handling in Underground Coal Mines Environments;831
5.7.1;Introduction;831
5.7.2;Related Works;833
5.7.3;Integrated RFID and Sensor System for Emergency Handling;835
5.7.3.1;Overview of Traditional Emergency Handling;835
5.7.3.2;The Proposed Emergency Handling Scheme;835
5.7.4;Conclusion;837
5.7.5;References;837
5.8;An Area-Based Overlay Architecture for Scalable Integration of Sensor Networks;838
5.8.1;Introduction;838
5.8.2;Related Work;839
5.8.3;System Overview;841
5.8.3.1;System Elements;841
5.8.3.2;Area Names;843
5.8.3.3;Sensor Types;844
5.8.3.4;Query Submission and Reception of Results;844
5.8.4;Maintenance of the Overlay;845
5.8.4.1;A Query Processor Joins the System;845
5.8.4.2;A Query Processor Leaves the System;846
5.8.4.3;A Query Processor Fails;846
5.8.4.4;Areas of Responsibility and Promotion of Query Processors;846
5.8.4.5;Examples;847
5.8.5;Query Processing;848
5.8.5.1;Query Forwarding and Multiplexing;848
5.8.5.2;Result Delivery and De-multiplexing;849
5.8.5.3;Query Cancellation;849
5.8.6;Evaluation;849
5.8.7;Conclusion;852
5.8.8;References;852
6;2009 International Workshop on Cross-Layer Design in Wireless Mobile Ad Hoc Networks;854
6.1;Outage Probability for ARQ Decode-and-Forward Relaying under Packet-Rate Fading;855
6.1.1;Introduction;855
6.1.2;System Model;856
6.1.3;Outage Performance Analysis;858
6.1.3.1;Direct ARQ Transmission Scheme;859
6.1.3.2;DF Cooperative ARQ Relay Scheme;859
6.1.4;Simulation Results;863
6.1.5;Conclusions;865
6.1.6;References;865
6.2;Distributed Spectrum Sharing for Video Streaming in Cognitive Radio Ad Hoc Networks;867
6.2.1;Introduction;867
6.2.2;System Model;869
6.2.2.1;Prioritized Queuing;869
6.2.3;Distributed Spectrum Sharing and Medium Access Control for Video Streaming;870
6.2.3.1;Spectrum Sharing Principle;871
6.2.3.2;Spectrum Utility;872
6.2.3.3;Dynamic Spectrum Allocation;873
6.2.3.4;Delay Estimation;874
6.2.3.5;Proposed Cross-Layer Control Scheme;875
6.2.4;Performance Evaluation;876
6.2.5;Conclusions;878
6.2.6;References;878
6.3;The Cognitive Radio Channel: From Spectrum Sensing to Message Cribbing;880
6.3.1;Introduction;880
6.3.2;Channel Model;882
6.3.3;Capacity Lower Bounds;883
6.3.3.1;b21+P2;884
6.3.3.2;1b2<1+P2;884
6.3.3.3;b2<1;888
6.3.4;Capacity Outer Bounds;890
6.3.5;Conclusion and Discussions;894
6.3.6;References;894
6.4;AM-AOMDV: Adaptive Multi-metric Ad-HocOn-Dem and Multipath Distance Vector Routing;896
6.4.1;Introduction;896
6.4.2;Adaptive Multi-metric AOMDV Routing Scheme;897
6.4.2.1;Multiple Routing Metrics;897
6.4.2.2;Route Setup Stage;898
6.4.2.3;Data Transmission Using Local Path Update;898
6.4.2.4;Enhanced Link Layer Failure Handling;899
6.4.2.5;Route Maintenance;899
6.4.3;Simulation and Discussion;900
6.4.3.1;Simulation Scenario;900
6.4.3.2;Varying Average Node Speed;901
6.4.3.3;Varying Number of Connections;903
6.4.3.4;Varying Packet Rates;905
6.4.4;Conclusion;906
6.4.5;References;907
6.5;A Low-Latency TDMA Scheduler for Multi-hop Cluster Based MANETs with Directional Antennas;908
6.5.1;Introduction;908
6.5.1.1;Routing;908
6.5.1.2;MAC;909
6.5.2;Proposed Solution;910
6.5.2.1;The Scheduling Algorithm;911
6.5.3;Expected Latencies;913
6.5.3.1;Linear Topology;914
6.5.3.2;Intra-cluster, One Branch;914
6.5.3.3;Intra-cluster, Two Branches;915
6.5.3.4;Neighboring Clusters, One Branch Each;916
6.5.3.5;Neighboring Clusters, Two Branches Each;917
6.5.3.6;Many Clusters, One Branch in Each End Cluster;917
6.5.3.7;Many Clusters, Two Branches in Each End Cluster;917
6.5.3.8;Summary of Analysis;918
6.5.4;Simulation Results;918
6.5.4.1;Static, Linear;918
6.5.4.2;Non-linear, Static Case;919
6.5.4.3;Mobile Case;921
6.5.5;Conclusion;923
6.5.6;References;924
7;Author Index;925
