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 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. © Springer-Verlag Berlin Heidelberg 2006.