Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks

Shlomi Dolev, Nir Tzachar

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Self-stabilizing algorithms can be started in any arbitrary state to exhibit a desired behavior following a convergence period. The class of self-organizing distributed algorithms is regarded here as a subclass of the self-stabilizing class of algorithms, where convergence is sub-linear in the size of the system and local perturbation of state is handled locally converging faster than the convergence from an arbitrary state. The chapter starts with a short overview of several virtual infrastructures and fitting self-stabilizing and self-organizing techniques: Group communication by random walks [23]Polygon-based stateless infrastructure [19]Geographic quorum systems [1, 16]Autonomous virtual node [18]Secret swarm units [20]Spanners, spanning expanders The last design, which is based on expanders and short random walks, is described in detail.
Original languageEnglish
Title of host publicationTheoretical Aspects of Distributed Computing in Sensor Networks
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Pages621-653
Number of pages33
ISBN (Print)3642148484
StatePublished - 2010

Publication series

NameMonographs in Theoretical Computer Science. An EATCS Series
PublisherSpringer Berlin Heidelberg

Keywords

  • Mobile Node
  • Random Walk
  • Expander Graph
  • Communication Round
  • Atomic Step

Fingerprint

Dive into the research topics of 'Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks'. Together they form a unique fingerprint.

Cite this