Timed Virtual Stationary Automata for Mobile Networks

Shlomi Dolev, Seth Gilbert, Limor Lahiani, Nancy Lynch, Tina Nolte

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations


We define a programming abstraction for mobile networks called the Timed Virtual Stationary Automata programming layer, consisting of mobile clients, virtual timed I/O automata called virtual stationary automata (VSAs), and a communication service connecting VSAs and client nodes. The VSAs are located at prespecified regions that tile the plane, defining a static virtual infrastructure. We present a self-stabilizing algorithm to emulate a timed VSA using the real mobile nodes that are currently residing in the VS A's region. We also discuss examples of applications whose implementations benefit from the simplicity obtained through use of the VSA abstraction.

Original languageEnglish
Title of host publicationPrinciples of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers
Number of pages16
StatePublished - 1 Dec 2006
Event9th International Conference on Principles of Distributed Systems, OPODIS 2005 - Pisa, Italy
Duration: 12 Dec 200514 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3974 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Conference on Principles of Distributed Systems, OPODIS 2005


  • Ad-hoc networks
  • Fault tolerance/availability
  • Location-aware distributed computing
  • Mobile computing
  • State replication
  • Virtual infrastructure
  • Virtual machine

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Timed Virtual Stationary Automata for Mobile Networks'. Together they form a unique fingerprint.

Cite this