Timed Virtual Stationary Automata for Mobile Networks

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

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

Abstract

We define a programming abstraction for mobile networks called the Timed 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 clients. The VSAs are located at prespecified regions that tile the plane, defining a static virtual infrastructure. We sketch an 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, such as intruder detection and tracking, whose implementations benefit from the simplicity obtained through use of the VSA abstraction.

Original languageEnglish
Title of host publication43rd Annual Allerton Conference on Communication, Control and Computing 2005
PublisherUniversity of Illinois at Urbana-Champaign
Pages1717-1726
Number of pages10
Volume4
ISBN (Electronic)9781604234916
StatePublished - 2005
Event43rd Annual Allerton Conference on Communication, Control and Computing 2005 - Monticello, United States
Duration: 28 Sep 200530 Sep 2005

Conference

Conference43rd Annual Allerton Conference on Communication, Control and Computing 2005
Country/TerritoryUnited States
CityMonticello
Period28/09/0530/09/05

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint

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

Cite this