Algorithms for Sensor and Ad Hoc Networks Advanced Lectures

Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers from many different fields, ranging from hardware technology to operating systems, from antenna d...

Full description

Saved in:
Bibliographic Details
Main Authors Wagner, Dorothea, Wattenhofer, Roger
Format eBook Book
LanguageEnglish
Published Berlin, Heidelberg Springer Nature 2007
Springer
Springer Berlin / Heidelberg
Springer Berlin Heidelberg
Edition1
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN3540749918
9783540749912
354074990X
9783540749905
ISSN0302-9743
1611-3349
DOI10.1007/978-3-540-74991-2

Cover

Table of Contents:
  • 10.5 Chapter Notes -- 11 Pseudo Geometric Routing for Sensor Networks -- 11.1 Introduction -- 11.2 Routing Algorithms for Sensor Networks -- 11.3 Virtual Coordinate Based Routing -- 11.4 Beacon Vector Routing -- 11.5 Algorithmic View -- 11.6 Related Work -- 11.7 Chapter Notes -- 12 Minimal Range Assignments for Broadcasts -- 12.1 Introduction -- 12.2 The Algorithm RAPMST and Its Analysis -- 12.3 Distributed Computation of an MST -- 12.4 Further Advances -- 12.5 Conclusion and Open Questions -- 12.6 Chapter Notes -- 13 Data Gathering in Sensor Networks -- 13.1 Introduction -- 13.2 Network Model -- 13.3 Minimum Energy Data Gathering -- 13.4 Maximum Lifetime Data Gathering -- 13.5 Chapter Notes -- 14 Location Services -- 14.1 Introduction -- 14.2 Grid Location Service (GLS) -- 14.3 Locality-Aware Location Service (LLS) -- 14.4 Mobility-Aware Location Service (MLS) -- 14.5 Outlook -- 14.6 Chapter Notes -- 15 Positioning -- 15.1 Introduction -- 15.2 Hardness Results -- 15.3 Algorithms -- 15.4 Chapter Notes -- 16 Security -- 16.1 Introduction -- 16.2 Symmetric Key Distribution -- 16.3 Public-Key Distribution -- 16.4 Open Questions -- 16.5 Chapter Notes -- 17 Trust Mechanisms and Reputation Systems -- 17.1 Introduction -- 17.2 General Trust Models -- 17.3 Reputation-Based Trust Protocols in Ad Hoc Networks -- 17.4 Open Problems -- 17.5 Chapter Notes -- 18 Selfish Agents and Economic Aspects -- 18.1 Introduction -- 18.2 Mechanism Design -- 18.3 Network Model -- 18.4 Unicast in Selfish Networks -- 18.5 Multicast in Selfish Networks -- 18.6 Chapter Notes -- 19 Time Synchronization -- 19.1 Introduction -- 19.2 Time Synchronization Approaches -- 19.3 Synchronizing Clocks in the Presence of Faults -- 19.4 Theoretical Bounds for Clock Synchronization and Ordering of Events -- 19.5 Gradient Clock Synchronization -- 19.6 Chapter Notes -- Bibliography -- Author Index
  • Subject Index
  • Intro -- Preface -- List of Contributors -- Contents -- 1 Applications of Sensor Networks -- 1.1 Introduction -- 1.2 Applications of Sensor Networks -- 1.3 Current Hardware Platforms -- 1.4 Upcoming Applications -- 1.5 Chapter Notes -- 2 Modeling Sensor and Ad Hoc Networks -- 2.1 Introduction -- 2.2 Distributed Algorithms -- 2.3 Communication -- 2.4 Energy -- 2.5 Mobility -- 2.6 Chapter Notes -- 3 Clustering -- 3.1 Introduction -- 3.2 Models -- 3.3 Clustering Algorithms for Unit Disk Graphs -- 3.4 Clustering Algorithms for General Graphs -- 3.5 Conclusions and Open Problems -- 3.6 Chapter Notes -- 4 MAC Layer and Coloring -- 4.1 Introduction -- 4.2 Algorithms for Vertex Coloring -- 4.3 Conclusion -- 4.4 Chapter Notes -- 5 Topology Control -- 5.1 Introduction -- 5.2 Quality Criteria -- 5.3 Locally Defined Geometric Graphs and Further Proximity Graphs -- 5.4 Localized Algorithms -- 5.5 Chapter Notes -- 6 Interference and Signal-to-Noise-Ratio -- 6.1 Introduction -- 6.2 Interference Models -- 6.3 Low-Interference Topologies -- 6.4 Topology Scheduling -- 6.5 Flow and Path Scheduling -- 6.6 Chapter Notes -- 7 Lower Bounds -- 7.1 Introduction -- 7.2 A Lower Bound on 3-Coloring a Ring -- 7.3 Locally Checkable Labelings -- 7.4 Minimum-Weight Spanning Trees -- 7.5 Chapter Notes -- 8 Facility Location -- 8.1 Introduction -- 8.2 Problem Definition -- 8.3 Centralized Approximations -- 8.4 Simple Distributed Approximation -- 8.5 Fast Distributed Approximation -- 8.6 Discussion and Outlook -- 8.7 Chapter Notes -- 9 Geographic Routing -- 9.1 Introduction -- 9.2 Related Work -- 9.3 Models and Preliminaries -- 9.4 Greedy Routing -- 9.5 Routing with Faces -- 9.6 A Lower Bound -- 9.7 Combining Greedy and Face Routing -- 9.8 Conclusion -- 9.9 Chapter Notes -- 10 Compact Routing -- 10.1 Introduction -- 10.2 Definitions -- 10.3 Overview -- 10.4 Algorithms
  • Intro -- Title Page -- Preface -- List of Contributors -- Contents -- Applications of Sensor Networks -- Introduction -- Applications of Sensor Networks -- Current Hardware Platforms -- Upcoming Applications -- Chapter Notes -- Modeling Sensor and Ad Hoc Networks -- Introduction -- Distributed Algorithms -- Communication -- Energy -- Mobility -- Chapter Notes -- Clustering -- Introduction -- Models -- Clustering Algorithms for Unit Disk Graphs -- Clustering Algorithms for General Graphs -- Conclusions and Open Problems -- Chapter Notes -- MAC Layer and Coloring -- Introduction -- Algorithms for Vertex Coloring -- Conclusion -- Chapter Notes -- Topology Control -- Introduction -- Quality Criteria -- Locally Defined Geometric Graphs and Further Proximity Graphs -- Localized Algorithms -- Chapter Notes -- Interference and Signal-to-Noise-Ratio -- Introduction -- Interference Models -- Low-Interference Topologies -- Topology Scheduling -- Flow and Path Scheduling -- Chapter Notes -- Lower Bounds -- Introduction -- A Lower Bound on 3-Coloring a Ring -- Locally Checkable Labelings -- Minimum-Weight Spanning Trees -- Chapter Notes -- Facility Location -- Introduction -- Problem Definition -- Centralized Approximations -- Simple Distributed Approximation -- Fast Distributed Approximation -- Discussion and Outlook -- Chapter Notes -- Geographic Routing -- Introduction -- Related Work -- Models and Preliminaries -- Greedy Routing -- Routing with Faces -- A Lower Bound -- Combining Greedy and Face Routing -- Conclusion -- Chapter Notes -- Compact Routing -- Introduction -- Definitions -- Overview -- Algorithms -- Chapter Notes -- Pseudo Geometric Routing for Sensor Networks -- Introduction -- Routing Algorithms for Sensor Networks -- Virtual Coordinate Based Routing -- Beacon Vector Routing -- Algorithmic View -- Related Work -- Chapter Notes
  • Minimal Range Assignments for Broadcasts -- Introduction -- The Algorithm RapMst and Its Analysis -- Distributed Computation of an MST -- Further Advances -- Conclusion and Open Questions -- Chapter Notes -- Data Gathering in Sensor Networks -- Introduction -- Network Model -- Minimum Energy Data Gathering -- Maximum Lifetime Data Gathering -- Chapter Notes -- Location Services -- Introduction -- Grid Location Service (GLS) -- Locality-Aware Location Service (LLS) -- Mobility-Aware Location Service (MLS) -- Outlook -- Chapter Notes -- Positioning -- Introduction -- Hardness Results -- Algorithms -- Chapter Notes -- Security -- Introduction -- Symmetric Key Distribution -- Public-Key Distribution -- Open Questions -- Chapter Notes -- Trust Mechanisms and Reputation Systems -- Introduction -- General Trust Models -- Reputation-Based Trust Protocols in Ad Hoc Networks -- Open Problems -- Chapter Notes -- Selfish Agents and Economic Aspects -- Introduction -- Mechanism Design -- Network Model -- Unicast in Selfish Networks -- Multicast in Selfish Networks -- Chapter Notes -- Time Synchronization -- Introduction -- Time Synchronization Approaches -- Synchronizing Clocks in the Presence of Faults -- Theoretical Bounds for Clock Synchronization and Ordering of Events -- Gradient Clock Synchronization -- Chapter Notes -- Bibliography -- Author Index -- Subject Index