Abstract
In this article, we quantify the amount of “practical” information (i.e., views obtained from the neighbors, colors attributed to the nodes and links) to obtain “theoretical” information (i.e., the local topology of the network up to distance k) in anonymous networks. In more detail, we show that a coloring at distance 2k + 1 is necessary and sufficient to obtain the local topology at distance k that includes outgoing links. This bound drops to 2k when outgoing links are not needed. A second contribution of this article deals with color bootstrapping (from which local topology can be obtained using the aforementioned mechanisms). On the negative side, we show that (i) with a distributed daemon, it is impossible to achieve deterministic color bootstrap, even if the whole network topology can be instantaneously obtained, and (ii) with a central daemon, it is impossible to achieve distance m when instantaneous topology knowledge is limited to m − 1. On the positive side, we show that (i) under the k-central daemon, deterministic self-stabilizing bootstrap of colors up to distance k is possible provided that k-local topology can be instantaneously obtained, and (ii) under the distributed daemon, probabilistic self-stabilizing bootstrap is possible for any range.
- Beauquier, J., Delaët, S., Dolev, S., and Tixeuil, S. 2007. Transient fault detectors. Distrib. Comput. 20, 1, 39--51.Google Scholar
Digital Library
- Beauquier, J., Gradinariu, M., and Johnen, C. 1999. Memory space requirements for self-stabilizing leader election protocols. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC'99). 199--208. Google Scholar
Digital Library
- Boldi, P. and Vigna, S. 2002. Universal dynamic synchronous self-stabilization. Distrib. Comput. 15, 3, 137--153. Google Scholar
Digital Library
- Danturi, P., Nesterenko, M., and Tixeuil, S. 2006. Self-stabilizing philosophers with generic conflicts. In proceedings of the 8th International Symposium on Stebilization, Safety, and Security on Distributed Systems (SSS'06), A. K. Datta and M. Gradinariu, Eds. Lecture Notes in Computer Science, vol. 4280. Springer-Verlag, 214--230. Google Scholar
Digital Library
- Delaët, S. and Tixeuil, S. 2002. Tolerating transient and intermittent failures. J. Parall. Distrib. Comput. 62, 5, 961--981. Google Scholar
Digital Library
- Dolev, S. 2000. Self-Stabilization. MIT Press. Google Scholar
Digital Library
- Dolev, S., Gouda, M. G., and Schneider, M. 1999. Memory requirements for silent stabilization. Acta Inf. 36, 6, 447--462.Google Scholar
Cross Ref
- Dolev, S. and Herman, T. 1997. Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci. Google Scholar
Digital Library
- Fraigniaud, P., Pelc, A., Peleg, D., and Perennes, S. 2001. Assigning labels in an unknown anonymous network with a leader. Distrib. Comput. 14, 3, 163--183. Google Scholar
Digital Library
- Gouda, M. G. and Herman, T. 1991. Adaptive programming. IEEE Trans. Softw. Engin. 17, 9, 911--921. Google Scholar
Digital Library
- Gradinariu, M. and Tixeuil, S. 2000. Self-stabilizing vertex coloring of arbitrary graphs. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS'00), 55--70.Google Scholar
- Herman, T. and Tixeuil, S. 2004. A distributed TDMA slot assignment algorithm for wireless sensor networks. In Proceedings of the 1st Workshop on Algorithmic Aspects of Wireless Sensor Networks (AlgoSensors'04). Lecture Notes in Computer Science, vol. 3121, Springer-Verlag, 45--58.Google Scholar
- Hill, J. L. and Culler, D. E. 2002. Mica: A wireless platform for deeply embedded networks. IEEE Micro 22, 6, 12--24. Google Scholar
Digital Library
- Masuzawa, T. 1995. A fault-tolerant and self-stabilizing protocol for the topology problem. In Proceedings of the 2nd Workshop on Self-Stabilizing Systems, 1.1--1.15.Google Scholar
- Mitton, N., Fleury, E., Guérin-Lassous, I., Séricola, B., and Tixeuil, S. 2006. On fast randomized colorings in sensor networks. In Proceedings of the International Conference on Parallel and Distributed Systems (ICPADS'06). IEEE Press, 31--38.Google Scholar
- Mitton, N., Fleury, E., Guérin-Lassous, I., and Tixeuil, S. 2005. Self-stabilization in self-organized wireless multihop networks. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops (WWAN'05). IEEE Press, 909--915. Google Scholar
Digital Library
- Moy, J. T. 1998. OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley Longman Publishing Co., Inc., Boston, MA. Google Scholar
Digital Library
- Perlman, R. 2000. Interconnexion Networks. Addison-Wesley.Google Scholar
- Sakamoto, N. 2000. Structure of initial conditions for distributed algorithms. IEICE Trans. Inform. Syst. E83-D, 12, 2029--2038.Google Scholar
- Spinelli, J. and Gallager, R. 1989. Event driven topology broadcast without sequence numbers. IEEE Trans. Comm. 37, 468--474.Google Scholar
Cross Ref
- Yamashita, M. and Kameda, T. 1999. Leader election problem on networks in which processor identity numbers are not distinct. IEEE Trans. Paral. Distrib. Syst. 10, 9, 878--887. Google Scholar
Digital Library
Index Terms
On bootstrapping topology knowledge in anonymous networks
Recommendations
On bootstrapping topology knowledge in anonymous networks
SSS'06: Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systemsIn this paper, we quantify the amount of "practical" information (i.e. views obtained from the neighbors, colors attributed to the nodes and links) to obtain "theoretical" information (i.e. the local topology of the network up to distance k) in ...
Adaptive trust-based anonymous network
A novel Adaptive Trust-based Anonymous Network (ATAN) is proposed. The distributed and decentralised network management in ATAN does not require a central authority so that ATAN alleviates the problem of a single point of failure. In some existing ...
Topology Control for Time-Evolving and Predictable Delay-Tolerant Networks
In delay tolerant networks (DTNs), the lack of continuous connectivity, network partitioning, and long delays make design of network protocols very challenging. Previous DTN research mainly focuses on routing and information propagation. However, with a ...






Comments