Timed virtual stationary automata for mobile networks

  • Authors:
  • Shlomi Dolev;Seth Gilbert;Limor Lahiani;Nancy Lynch;Tina Nolte

  • Affiliations:
  • Dep. of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;MIT CSAIL, Cambridge, MA;Dep. of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;MIT CSAIL, Cambridge, MA;MIT CSAIL, Cambridge, MA

  • Venue:
  • OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 VSA's region. We also discuss examples of applications whose implementations benefit from the simplicity obtained through use of the VSA abstraction.