Virtual Stationary Automata for Mobile Networks
We define a programming abstraction formobile networks called the Virtual Stationary Automataprogramming layer, consisting of real mobile clients, virtualtimed I/O automata called virtual stationary automata(VSAs), and a communication service connecting VSAs andclient nodes. The VSAs are located at...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://hdl.handle.net/1721.1/30517 |
| _version_ | 1826190529282441216 |
|---|---|
| author | Dolev, Shlomi Gilbert, Seth Lahiani, Limor Lynch, Nancy Nolte, Tina |
| author2 | Theory of Computation |
| author_facet | Theory of Computation Dolev, Shlomi Gilbert, Seth Lahiani, Limor Lynch, Nancy Nolte, Tina |
| author_sort | Dolev, Shlomi |
| collection | MIT |
| description | We define a programming abstraction formobile networks called the Virtual Stationary Automataprogramming layer, consisting of real mobile clients, virtualtimed I/O automata called virtual stationary automata(VSAs), and a communication service connecting VSAs andclient nodes. The VSAs are located at prespecified regionsthat tile the plane, defining a static virtual infrastructure.We present a self-stabilizing algorithm to emulate a VSAusing the real mobile nodes that are currently residingin the VSAÂs region. We also describe several examplesof applications whose implementations benefit from thesimplicity obtained through use of the VSA abstraction. |
| first_indexed | 2024-09-23T08:41:40Z |
| id | mit-1721.1/30517 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:41:40Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | mit-1721.1/305172019-04-09T19:16:01Z Virtual Stationary Automata for Mobile Networks Dolev, Shlomi Gilbert, Seth Lahiani, Limor Lynch, Nancy Nolte, Tina Theory of Computation We define a programming abstraction formobile networks called the Virtual Stationary Automataprogramming layer, consisting of real mobile clients, virtualtimed I/O automata called virtual stationary automata(VSAs), and a communication service connecting VSAs andclient nodes. The VSAs are located at prespecified regionsthat tile the plane, defining a static virtual infrastructure.We present a self-stabilizing algorithm to emulate a VSAusing the real mobile nodes that are currently residingin the VSAÂs region. We also describe several examplesof applications whose implementations benefit from thesimplicity obtained through use of the VSA abstraction. 2005-12-22T02:20:41Z 2005-12-22T02:20:41Z 2005-01-21 MIT-CSAIL-TR-2005-004 MIT-LCS-TR-979 http://hdl.handle.net/1721.1/30517 en_US Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory 16 p. 24963489 bytes 1042588 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Dolev, Shlomi Gilbert, Seth Lahiani, Limor Lynch, Nancy Nolte, Tina Virtual Stationary Automata for Mobile Networks |
| title | Virtual Stationary Automata for Mobile Networks |
| title_full | Virtual Stationary Automata for Mobile Networks |
| title_fullStr | Virtual Stationary Automata for Mobile Networks |
| title_full_unstemmed | Virtual Stationary Automata for Mobile Networks |
| title_short | Virtual Stationary Automata for Mobile Networks |
| title_sort | virtual stationary automata for mobile networks |
| url | http://hdl.handle.net/1721.1/30517 |
| work_keys_str_mv | AT dolevshlomi virtualstationaryautomataformobilenetworks AT gilbertseth virtualstationaryautomataformobilenetworks AT lahianilimor virtualstationaryautomataformobilenetworks AT lynchnancy virtualstationaryautomataformobilenetworks AT noltetina virtualstationaryautomataformobilenetworks |