Preface |
Applications of Sensor Networks / H.-J. Hof1: |
Introduction / 1.1: |
Current Hardware Platforms / 1.2: |
Upcoming Applications / 1.4: |
Chapter Notes / 1.5: |
Modeling Sensor and Ad Hoc Networks / F. Schuh2: |
Distributed Algorithms / 2.1: |
Communication / 2.3: |
Energy / 2.4: |
Mobility / 2.5: |
Clustering / T. Moscibroda2.6: |
Models / 3.1: |
Clustering Algorithms for Unit Disk Graphs / 3.3: |
Clustering Algorithms for General Graphs / 3.4: |
Conclusionsand Open Problems / 3.5: |
MAC Layer and Coloring / S. Mecke3.6: |
Algorithms for Vertex Coloring / 4.1: |
Conclusion / 4.3: |
Topology Control / K. Buchin ; M. Buchin4.4: |
Quality Criteria / 5.1: |
Locally Defined Geometric Graphs and Further Proximity Graphs / 5.3: |
Localized Algorithms / 5.4: |
Interference and Signal-to-Noise-Ratio / A. Kröller5.5: |
Interference Models / 6.1: |
Low-Interference Topologies / 6.3: |
Topology Scheduling / 6.4: |
Flow and Path Scheduling / 6.5: |
Lower Bounds / Z. Benenson6.6: |
A Lower Boundon3-Coloringa Ring / 7.1: |
Locally Checkable Labelings / 7.3: |
Minimum-Weight Spanning Trees / 7.4: |
Facility Location / C. Frank7.5: |
Problem Definition / 8.1: |
Centralized Approximations / 8.3: |
Simple Distributed Approximation / 8.4: |
Fast Distributed Approximation / 8.5: |
Discussionand Outlook / 8.6: |
Geographic Routing / A. Zollinger8.7: |
Related Work / 9.1: |
Models and Preliminaries / 9.3: |
Greedy Routing / 9.4: |
Routing with Faces / 9.5: |
A Lower Bound / 9.6: |
Combining Greedy and Face Routing / 9.7: |
Compact Routing / M. Dom9.8: |
Definitions / 10.1: |
Overview / 10.3: |
Algorithms / 10.4: |
Pseudo Geometric Routing for Sensor Networks / O. Landsiedel10.5: |
Routing Algorithmsfor Sensor Networks / 11.1: |
Virtual Coordinate Based Routing / 11.3: |
Beacon Vector Routing / 11.4: |
Algorithmic View / 11.5: |
Minimal Range Assignments for Broadcasts / C. Gunia11.6: |
The Algorithm RAPMST and Its Analysis / 12.1: |
Distributed Computation of an MST / 12.3: |
Further Advances / 12.4: |
Conclusion and Open Questions / 12.5: |
Data Gathering in Sensor Networks / L. Scharf12.6: |
Network Model / 13.1: |
Minimum Energy Data Gathering / 13.3: |
Maximum Lifetime Data Gathering / 13.4: |
Location Services / B. Fabian ; M. Fischmann ; S.F. Gürses13.5: |
Grid Location Service (GLS) / 14.1: |
Locality-Aware Location Service (LLS) / 14.3: |
Mobility-Aware Location Service (MLS) / 14.4: |
Outlook / 14.5: |
Positioning / D. Fleischer ; C. Pich14.6: |
Hardness Results / 15.1: |
Security / E.-O. Blaß15.3: |
Symmetric Key Distribution / 16.1: |
Public-Key Distribution / 16.3: |
Open Questions / 16.4: |
Trust Mechanisms and Reputation Systems / E. Buchmann16.5: |
General Trust Models / 17.1: |
Reputation-Based Trust Protocols in Ad Hoc Networks / 17.3: |
Open Problems / 17.4: |
Selfish Agents and Economic Aspects / 17.5: |
Mechanism Design / 18.1: |
Unicast in Selfish Networks / 18.3: |
Multicast in Selfish Networks / 18.5: |
Time Synchronization / M. Busse ; T. Streichert18.6: |
Time Synchronization Approaches / 19.1: |
Synchronizing Clocks in the Presence of Faults / 19.3: |
Theoretical Bounds for Clock Synchronization and Ordering ofEvents / 19.4: |
Gradient Clock Synchronization / 19.5: |
Bibliography / 19.6: |
Author Index |
Subject Index |
Preface |
Applications of Sensor Networks / H.-J. Hof1: |
Introduction / 1.1: |