Shlomi Dolev
ABSTRACT
Self-stabilization ([Dij74], [Dolev00] is an important property of any dynamic long-lived system. Self-stabilizing systems may start operating in any arbitrary state, and can therefore recover following a temporary violation of the assumption made by the system designer. Mobile ad-hoc networks are very dynamic in nature and must cope with unreliable and sometimes unpredictable environments. Thus the design of self-stabilizing mobile and ad-hoc networks is of great importance. Self-stabilizing networks are self-organizing if they start to operate as they should in sub-linear time. We overview several recent works demonstrating several directions for creating adaptive infrastructures and abstractions; namely self-stabilizing and self-organizing infrastructures. These infrastructures fit the mobile ad-hoc network characteristic.
- The virtual infrastructure project. http://groups.csail.mit.edu/tds/vi-project.Google Scholar
- Dijkstra, E. W. Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 11 (1974), 643--644. Google ScholarDigital Library
- Dolev, S. Self-Stabilization. MIT Press, 2000. Google ScholarDigital Library
- Dolev, S., Gilbert, S., Guerraoui, R., and Newport, C. C. Secure communication over radio channels. In PODC (2008). Google ScholarDigital Library
- Dolev, S., Gilbert, S., Lynch, N. A., Shvartsman, A. A., and Welch, J. L. Geoquorums: implementing atomic memory in mobile Ad hoc networks. Distributed Computing 18, 2 (2005), 125--155. Google ScholarDigital Library
- Dolev, S., Gilbert, S., Schiller, E., Shvartsman, A. A., and Welch, J. L. Autonomous virtual mobile nodes. In DIALM-POMC (2005), pp. 62--69. Google ScholarDigital Library
- Dolev, S., Herman, T., and Lahiani, L. Polygonal broadcast, secret maturity, and the firing sensors. Ad Hoc Networks 4, 4 (2006), 447--486.Google ScholarCross Ref
- Dolev, S., Lahiani, L., and Yung, M. Secret swarm unitreactive k-secret sharing. In INDOCRYPT (2007), pp. 123--137. Google ScholarDigital Library
- Dolev, S., Schiller, E., and Welch, J. L. Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput. 5, 7 (2006), 893--905. Google ScholarDigital Library
- Dolev, S., and Tzachar, N. Empire of colonies: Self-stabilizing and self-organizing distributed algorithms. In OPODIS (2006), pp. 230--243. Google ScholarDigital Library
- Dolev, S., and Tzachar, N. Spanders: Distributed spanning expanders. In Dept. of Computer Science, Ben-Gurion University, TR-08-02 (2007).Google Scholar
Index Terms
- Self-stabilizing and self-orgenizing mobile networks
Recommendations
A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks
OPODIS'05: Proceedings of the 9th international conference on Principles of Distributed SystemsSelf-stabilizing protocols can tolerate any type and any number of transient faults. However, in general, self-stabilizing protocols provide no guarantee about their behavior against permanent faults. This paper proposes a self-stabilizing link-coloring ...
Fault-containing self-stabilizing distributed protocols
Self-stabilization is an elegant approach for designing a class of fault-tolerant distributed protocols. A self-stabilizing protocol is guaranteed to eventually converge to a legitimate state after a transient fault. However, even a minor transient ...
Self-Stabilizing Byzantine Broadcast
SRDS '14: Proceedings of the 2014 IEEE 33rd International Symposium on Reliable Distributed SystemsWe consider the problem of reliably broadcasting messages in a multi-hop network where nodes can fail in some unforeseen manner. We consider the most general failure model: the Byzantine model, where failing nodes may exhibit arbitrary behavior, and ...
Comments