Virtual Stationary Automata for Mobile Networks
Shlomi Dolev, Seth Lewis Gilbert, Limor Lahiani, Nancy Ann Lynch, Tina Nolte · 2005
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 prespecified 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. I.