Nous avons présenté ici notre vision de l'auto-organisation. Pour nous, une auto-organisation consiste en la création d'un comportement émergent, structurant le réseau, et permettant par ce biais d'en faciliter l'exploitation. Nous avons exposé diérentes solutions de construction de struc-tures virtuelles que nous classons, selon notre vision, dans la catégorie de l'auto-organisation. Cependant, ces solutions ne répondent pas, comme nous l'avons vu, à la totalité de nos exi-gences en terme de persistance, de robustesse, de passage à l'échelle et de distributivité. Nous allons donc présenter dans le chapitre suivant la structure d'auto-organisation que nous avons proposée.
Bibliographie 25
Bibliographie
[1] K. M. Alzoubi, P.-J. Wan, and O. Frieder. Distributed heuristics for connected dominating set in wireless ad hoc networks. IEEE ComSoc/KICS Journal of Communications and Networks, Special Issue on Innovations in Ad Hoc Mobile Pervasive Networks, 4(1) :2229, march 2002.
[2] A. Amis, R. Prakash, T. Vuong, and D. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In INFOCOM, pages 3241, Tel-Aviv, Israel, March 1999. IEEE.
[3] B. An and S. Papavassiliou. A mobility-based clustering approach to support mobility ma-nagement and multicast routing in mobile ad-hoc wireless networks. International Journal of Network Management, 11(6) :387395, November/December 2001.
[4] S. Bannerjee and S. Khuller. A clustering scheme for hierarchical control in wireless net-works. In INFOCOM, pages 10281037, Anchorage, Alaska, April 2001. IEEE.
[5] L. Bao and J. Garcia Luna Aceves. Topology management in ad hoc networks. In Interna-tional Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Anapolis, USA, June 2003. ACM.
[6] S. Basagni, D. Turgut, and S. K. Das. Mobility-adaptive protocols for managing large ad hoc networks. In International Conference on Communications (ICC), pages 15391543, Helsinki, Finland, June 2001. IEEE.
[7] S. Butenko, X. Cheng, D.-Z. Du, and P. M. Pardalos. On the construction of virtual backbone for ad hoc wireless networks. In Cooperative Control : Models, Applications and Algorithms, volume 1 of Cooperative Systems, chapter 3, pages 4354. Kluwer Academic Publishers, January 2003.
[8] I. Cardei, S. Varadarajan, A. Pavan, L. Graba, M. Cardei, and M. Min. Resource manage-ment for ad hoc wireless networks with cluster organization. Cluster Computing, 7(1) :91 103, January 2004.
[9] M. Cardei, X. Cheng, X. Cheng, and D.-Z. Du. Connected domination in ad hoc wireless networks. In International Conference on Computer Science and Informatics (CSI), North Carolina, USA, March 2002.
[10] J. Carle and D. Simplot-Ryl. Energy ecient area monitoring by sensor networks. IEEE Computer Magazine, 37(2) :4046, February 2004.
[11] Y. Caro, D. B. West, and R. Yuster. Connected domination and spanning trees with many leaves. SIAM Journal on Discrete Mathematics, 13(2) :202211, 2000.
[12] J. Cartigny, D. Simplot, and I. Stojmenovic. Localized minimum-energy broadcasting in ad-hoc networks. In INFOCOM, pages 22102217, San Francisco, USA, March-Avril 2003. IEEE.
[13] J. Cartigny, D. Simplot-Ryl, and I. Stojmenovic. An adaptive localized scheme for energy-ecient broadcasting in ad hoc networks with directional antennas. In Personal Wireless Communications (PWC), Delft, Netherlands, September 2004. IFIP.
[14] G. Chen, F. Garcia, J. Solano, and I. Stojmenovic. Connectivity based k-hop clustering in wireless networks. In Proceedings of the 35th Hawaii International Conference on System Sciences, Maui, Hawaii, January 2002. IEEE.
[15] Y. P. Chen and A. L. Liestman. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In International Symposium on Mobile Ad Hoc Networking and Computing (MOBICOM), pages 165172, Lausanne, Switzerland, June 2002. ACM.
[16] X. Cheng and D.-z. Du. Virtual backbone-based routing in multihop ad hoc wireless net-works. Technical Report 02-002, University of Minnesota, Minnesota, USA, January 2002.
[17] B. N. Clark, C. J. Colburn, and D. S. Johnson. Unit disks graphs. Discrete Mathematics, 86 :165177, December 1990.
[18] J. E. Dunbar, J. W. Grossman, J. H. Hattingh, S. T. Hedetniemi, and A. A. McRae. On weakly connected domination in graphs. Discrete Mathematics, 167-168 :261269, April 1997.
[19] Encyclopædia Universalis.
[20] D. Eppstein. Spanning trees and spanners. Technical Report 96-16, University Of California, Irvine, USA, May 1996.
[21] Y. Fernandess and D. Malkhi. K-clustering in wireless ad hoc networks. In International Workshop on Principles of Mobile Computing (POMC), pages 3137, Toulouse, France, October 2002. ACM Press.
[22] R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems (TO-PLAS), 5(1) :6677, January 1983.
[23] M. Gerla and K. Xu. Topology management of hierarchical mobile ad hoc networks. In I. C. M. Cardei and D. Z-Du, editors, Resource Management in Wireless Networking. Kluwer Academic Publisher, 2004.
[24] F. Heylighen. Principles of systems and cybernetics : an evolutionary perspective. Cyber-netics and Systems, 23 :310, 1992.
[25] T.-C. Hou and T.-J. Tsai. An access-based clustering protocol for multihop wireless ad hoc networks. IEEE Journal on Selected Areas in Commnications, 19(7) :12011210, July 2001. [26] J. Jaromczyck and G. T. Toussaint. Relative neighborhood graphs and their relatives. In
Proceedings of the IEEE, volume 80 of 9, pages 15021517, September 1992.
[27] M. Jiang, J. Li, and Y. C. Tay. Cluster based routing protocol (CBRP). Internet draft version 01, IETF, July 1999.
[28] B. Karp and H. Kung. GPSR : Greedy perimeter stateless routing for wireless networks. In International Conference on Mobile Computing and Networking (MOBICOM), pages 243254, Boston, USA, August 2000. ACM.
[29] U. C. Kozat, G. Kondylis, B. Ryu, and M. K. Marina. Virtual dynamic backbone for mobile ad hoc networks. In International Conference on Communications (ICC), Helsinki, Finland, June 2001. IEEE.
[30] P. Krishna, N. Vaidya, M. Chatterjee, and D. Pradhan. A cluster-based approach for routing in dynamic networks. In SIGCOMM, pages 4965, Cannes, France, April 1997. ACM. [31] T. J. Kwon and M. Gerla. Ecient ooding with passive clustering (pc) in ad-hoc networks.
ACM SIGCOMM Computer Communication Review, 32(1) :4456, January 2002.
[32] N. Li, J. C. Hou, and L. SHa. Design and analysis of an MST-based topology control algorithm. In INFOCOM, pages 17021712, San Francisco, USA, April 2003. IEEE. [33] B. Liang and Z. J. Haas. Virtual backbone generation and maintenance in ad hoc network
mobility management. In INFOCOM, pages 12931302, Tel-Aviv, Israel, March 2000. IEEE. [34] C. R. Lin and M. Gerla. Adaptive clustering for mobile wireless networks. IEEE Journal
of Selected Areas in Communications, 15(7) :12651275, 1997.
[35] J.-H. Lin, C.-R. Dow, and S.-F. Hwang. A distributed virtual backbone development scheme for ad-hoc wireless networks. Wireless Personal Communications, 27(3) :215233, 2003. [36] M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple heuristics
Bibliographie 27 [37] R. Meraihi, G. Le Grand, N. Puech, M. Riguidel, and S. Tohmé. Improving ad hoc network performance with backbone topology control. In Vehicular Technology Conference (VTC Fall), Los Angeles, USA, September 2004. IEEE.
[38] M. Min, F. Wang, D.-Z. Du, and P. M. Pardalos. A reliable virtual backbone scheme in mobile ad-hoc networks. In International Conference on Mobile Ad-hoc and Sensor Systems (MASS), pages 6069, Fort Lauderdale, USA, October 2004. IEEE.
[39] M. Mouly and M.-B. Pautet. The GSM System for Mobile Communications. Cell & Sys, 1992.
[40] S. Peng, A. Stephens, and Y. Yesha. Algorithms for a core and k-tree core of a tree. Journal of Algorithms, 15(1) :143159, July 1993.
[41] C. Prehofer and C. Bettstetter. Self-organization in communication networks : principles and design paradigm. IEEE Communications Magazine, 43(7) :7885, July 2005.
[42] S. Radhakrishnan, G. Racherla, C. N. Sekharan, N. S. Rao, and l. S. Batsel. Protocol for dynamic ad-hoc networks using distributed spanning trees. Wireless Networks, 9(6) :673 686, November 2003.
[43] Y. Rekhter and T. Li. BGP version 4. RFC 1771, IETF, March 1995.
[44] I. Rubin, A. Behzad, H.-J. Ju, R. Zhang, X. Huang, Y. Liu, R. Khalaf, and J. Hsu. Ad Hoc Wireless Networks with Mobile Backbones, chapter 9. Kluwer, 2005.
[45] I. Rubin, X. Huang, Y. C. Liu, and H.-j. Ju. A distributed stable backbone maintenance protocol for ad hoc wireless networks. In Vehicular Technology Conference (VTC Spring), Jeju, Korea, April 2003. IEEE.
[46] B. Ryu, J. Erickson, J. Smallcomb, and S. Dao. Virtual wire for managing virtual dynamic backbone in wireless ad hoc networks. In International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL'M), Seattle, USA, August 1999. IEEE.
[47] C. A. Santivanez, B. McDonald, I. Stavrakakis, and R. Ramanathan. On the scalability of ad hoc routing protocols. In INFOCOM, New York, USA, June 2002. IEEE.
[48] M. Seaman. Spanning tree. Standard 802.1D, IEEE, 2004.
[49] S. Srivastava and R. Ghosh. Distributed algorithms for nding and maintaining a k-tree core in a dynamic network. Information Processing Letters, 88(4) :187194, November 2003. [50] S. Srivastava and R. K. Ghosh. Cluster based routing using a k-tree core backbone for mobile ad hoc networks. In International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL'M), pages 1423. ACM Press, 2002. [51] I. Stojmenovic, M. Seddigh, and J. Zunic. Dominating sets and neighbor
elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(12) :1425, December 2001.
[52] D. Turgut, B. Turgut, R. Elmasri, and T. V. Le. Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing. In Wireless Communications and Networking Conference (WCNC), New Orleans, USA, March 2003. IEEE.
[53] P.-j. Wan, K. M. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications, 9(2) :141149, April 2004.
[54] B.-F. Wang. Finding a k-tree core and a k-tree center of a tree network in parallel. IEEE Transactions on Parallel and Distributed Systems, 9(2) :186191, 1998.
[55] Y. Wang, W. Wang, and X.-Y. Li. Low-cost routing in selsh and rational wireless ad hoc networks. In International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Urbana-Champaign, USA, May 2005. IEEE.
[56] Wikipedia, l'encyclopédie libre. http://wikipedia.org.
[57] J. Wu. An enhanced approach to determine a small forward node set based on multipoint relays. In Vehicular Technology Conference (VTC Fall), pages 27742777, Orlando, USA, October 2003. IEEE.
[58] J. Wu and H. Li. Dominating-set-based routing in ad hoc wireless networks. In International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL'M), pages 714, Seattle, USA, August 1999. ACM.
Bibliographie 29
Publications
Chapitre de livre
[1] F. Theoleyre and F. Valois. Réseaux mobiles ad hoc et réseaux de capteurs (Traité IC2, série Réseaux et télécommunications), chapitre Auto-organisation de réseaux ad hoc : concepts et impacts, pages 101128. Hermes, 2006.
Séminaire
[2] F. Theoleyre and F. Valois. Construction de structures virtuelles dans les réseaux ad hoc. In Techniques Algorithmiques, Réseaux et d'Optimisation pour les Télécommunications (TAROT), Paris, France, January 2004.
Une proposition d'auto-organisation pour réseaux ad hoc et hybrides 31
Chapitre 3
Une proposition d'auto-organisation
pour réseaux ad hoc et hybrides
3.1 Introduction
De nombreuses structures virtuelles d'auto-organisation ont déjà été proposées, comme nous l'avons vu précédemment. Les propositions considèrent soit la construction d'une dorsale per-mettant d'optimiser la diusion d'information, soit le découpage du réseau en zones plus petites, en formant une structure hiérarchique. Cependant, comme nous l'avons vu précédemment, ces structures sourent pour la plupart de carences en termes de robustesse aux changements de topologie, de persistance dans le temps ou de trac de contrôle.
Ainsi, nous proposons ici une structure virtuelle d'auto-organisation permettant de structurer le réseau en orant une vue logique plus stable de la topologie radio. Cette structure doit présenter une utilité par exemple pour le routage, comme nous les verrons par la suite. Nous proposons de combiner les avantages des infrastructures virtuelles de dorsales et de clusters. Une hiérarchie, une organisation est maintenue, et tous les processus chargés de construire et maintenir cette hiérarchie partagent des informations communes an de réduire le trac de contrôle induit.
Ce chapitre est consacré à la présentation de la structure d'auto-organisation tandis que le chapitre suivant analysera plus en détails les algorithmes proposés ici, en démontrant notamment leur propriété d'auto-stabilisation. Dans ce chapitre, nous allons dans un premier temps exposer les motivations de notre travail et donner un aperçu général de notre solution d'auto-organisation. Ensuite, nous présenterons dans la section3.3les algorithmes de construction, puis la section3.4
détaillera les algorithmes de maintenance. La section3.5donnera une méthode pour prendre en charge plusieurs dorsales. Enn, la section 3.6 étudiera les performances de cette structure au travers de simulations.