@inbook{6fcb8a5330b341f8b8f6589980a2489f,

title = "Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks",

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.",

keywords = "Mobile Node, Random Walk, Expander Graph, Communication Round, Atomic Step",

author = "Shlomi Dolev and Nir Tzachar",

year = "2010",

language = "???core.languages.en_GB???",

isbn = "3642148484",

series = "Monographs in Theoretical Computer Science. An EATCS Series",

publisher = "Springer Berlin Heidelberg",

pages = "621--653",

booktitle = "Theoretical Aspects of Distributed Computing in Sensor Networks",

}