Virtual Stationary Automata for Mobile Networks

Abstract

We define a programming abstraction for mobile networks called the Virtual Stationary Automata programming layer, consisting of real 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 pre-specified regions that tile the plane, defining a static virtual infrastructure. We present a self-stabilizing algorithm to emulate a VSA using the real mobile nodes that are currently residing in the VSA's region. We also describe several examples of applications whose implementations benefit from the simplicity obtained through use of the VSA abstraction.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 21, 2005
Accession Number
ADA467098

Entities

People

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

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Biomedical
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Algorithms
  • Artificial Intelligence
  • Automata
  • Cellular Networks
  • Communication Channels
  • Computer Programming
  • Computer Science
  • Computers
  • Geographic Regions
  • Geography
  • Machines
  • Mobile Phones
  • Networks
  • Stationary
  • Trajectories
  • Wireless Communications

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.