Virtual Stationary Automata for Mobile Networks
| dc.date.accessioned | 2005-12-22T02:20:41Z | |
| dc.date.accessioned | 2018-11-24T10:24:22Z | |
| dc.date.available | 2005-12-22T02:20:41Z | |
| dc.date.available | 2018-11-24T10:24:22Z | |
| dc.date.issued | 2005-01-21 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30517 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/30517 | |
| dc.description.abstract | 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. | |
| dc.format.extent | 16 p. | |
| dc.format.extent | 24963489 bytes | |
| dc.format.extent | 1042588 bytes | |
| dc.language.iso | en_US | |
| dc.title | Virtual Stationary Automata for Mobile Networks |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2005-004.pdf | 1.042Mb | application/pdf | View/ |
| MIT-CSAIL-TR-2005-004.ps | 24.96Mb | application/postscript | View/ |