Timed Virtual Stationary Automata for Mobile Networks

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

Timed Virtual Stationary Automata for Mobile Networks

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	43rd Annual Allerton Conference on Communication, Control and Computing 2005
Publisher	University of Illinois at Urbana-Champaign
Pages	1717-1726
Number of pages	10
Volume	4
ISBN (Electronic)	9781604234916
State	Published - 2005
Event	43rd Annual Allerton Conference on Communication, Control and Computing 2005 - Monticello, United States Duration: 28 Sep 2005 → 30 Sep 2005

Conference

Conference	43rd Annual Allerton Conference on Communication, Control and Computing 2005
Country/Territory	United States
City	Monticello
Period	28/09/05 → 30/09/05

ASJC Scopus subject areas

Computer Networks and Communications
Computer Science Applications

Cite this

@inproceedings{e9a82f927b764b2186b46328c6045f13,

title = "Timed Virtual Stationary Automata for Mobile Networks",

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

author = "Shlomi Dolev and Limor Lahiani and Seth Gilbert and Nancy Lynch and Tina Nolte",

year = "2005",

language = "English",

volume = "4",

pages = "1717--1726",

booktitle = "43rd Annual Allerton Conference on Communication, Control and Computing 2005",

publisher = "University of Illinois at Urbana-Champaign",

address = "United States",

note = "43rd Annual Allerton Conference on Communication, Control and Computing 2005 ; Conference date: 28-09-2005 Through 30-09-2005",

}

Dolev, S, Lahiani, L, Gilbert, S, Lynch, N & Nolte, T 2005, Timed Virtual Stationary Automata for Mobile Networks. in 43rd Annual Allerton Conference on Communication, Control and Computing 2005. vol. 4, University of Illinois at Urbana-Champaign, pp. 1717-1726, 43rd Annual Allerton Conference on Communication, Control and Computing 2005, Monticello, United States, 28/09/05.

Timed Virtual Stationary Automata for Mobile Networks. / Dolev, Shlomi; Lahiani, Limor; Gilbert, Seth; Lynch, Nancy; Nolte, Tina.

43rd Annual Allerton Conference on Communication, Control and Computing 2005. Vol. 4 University of Illinois at Urbana-Champaign, 2005. p. 1717-1726.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Timed Virtual Stationary Automata for Mobile Networks

AU - Dolev, Shlomi

AU - Lahiani, Limor

AU - Gilbert, Seth

AU - Lynch, Nancy

AU - Nolte, Tina

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84961928014&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84961928014

VL - 4

SP - 1717

EP - 1726

BT - 43rd Annual Allerton Conference on Communication, Control and Computing 2005

PB - University of Illinois at Urbana-Champaign

T2 - 43rd Annual Allerton Conference on Communication, Control and Computing 2005

Y2 - 28 September 2005 through 30 September 2005

ER -

Timed Virtual Stationary Automata for Mobile Networks

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this