Abstract
Ad-hoc and mobile sensor networks are chaotic in nature. The goal of the tutorial is to present several techniques to form virtual infrastructure for such mobile ad-hoc networks. Different approaches (some of which are inherently self-stabilizing [2,3]) will be presented:
∙ The use of randomization to overcome the random nature of the network. In particular the use of random walks to obtain a middleware that supports group communication abstractions [11].
∙ The use of directed antennas to define ad-hoc virtual infrastructure. The directed antennas are used to define virtual tilling of geographic regions. The tilling definition serves as a backbone for communication procedures [7].
∙ The use of GPS service to define a static tilling of a geographic region. Each tile resembles a (base station free) cell in a cellular network. The mobile hosts that happen to be present at a cell implement the base station function. Whenever a mobile host arrives to a populated cell, it copies the state of the virtual base station, whenever the mobile host leaves the cell it erases the virtual state. Thus each tile is in fact a virtual automaton that may implement a router or home location server [1,4,8,9].
∙ One can imagine a virtual automaton deciding to move to a non mobile-host-deserted location to make sure it survives, or even move in order to collect information [5,6].
∙ Implementation of a virtual automaton by the moving hosts requires an investigation of security issues. One would like to avoid the possibility of an host to know or corrupt the state of the virtual automaton, reactive secret sharing techniques are suggested for this sake [10].
Partially supported by the Rita Altura Trust Chair in Computer Sciences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
The virtual infrastructure project, http://groups.csail.mit.edu/tds/vi-project
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17 11, 643–644 (1974)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A.A., Welch, J.L.: Geoquorums: implementing atomic memory in mobile d hoc networks. Distributed Computing 18 2, 125–155 (2005)
Dolev, S., Gilbert, S., Lynch, N.A., Schiller, E., Shvartsman, A.A., Welch, J.L.: Virtual Mobile Nodes for Mobile Ad Hoc Networks. In: The 18th International Conference on Distributed Computing, DISC 2004 (2004)
Dolev, S., Gilbert, S., Schiller, E., Shvartsman, A.A., Welch, J.L.: Autonomous virtual mobile nodes. In: DIALM-POMC, pp. 62–69 (2005)
Dolev, S., Herman, T., Lahiani, L.: Polygonal broadcast, secret maturity, and the firing sensors. Ad Hoc Networks 4 4, 447–486 (2006)
Dolev, S., Gilbert, S., Lahiani, L., Lynch, A.L., Nolte, T.: Timed Virtual Stationary Automata for Mobile Networks. In: 9th International Conference on Principles of Distributed Systems (OPODIS 2005), pp. 96–112 (2005)
Dolev, S., Lahiani, L., Lynch, N., Nolte, T.: Self-stabilizing Mobile Node Location Management and Message Routing. In: Self-Stabilizing Systems (SSS 2005), pp. 96–112 (2005)
Dolev, S., Lahiani, L., Yung, M.: Secret swarm unitreactive k-secret sharing. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 123–137. Springer, Heidelberg (2007)
Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput. 5 7, 893–905 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dolev, S. (2008). Tutorial Abstract Virtual Infrastructure. In: Kulkarni, S., Schiper, A. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2008. Lecture Notes in Computer Science, vol 5340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89335-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-89335-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89334-9
Online ISBN: 978-3-540-89335-6
eBook Packages: Computer ScienceComputer Science (R0)