Some Requirements for Autonomic Routing in Self-organizing Networks

This paper addresses some requirements of self-organizing networks as well as interoperability problems due to merges and splits phenomena. In a mobile environment, merges and splits characterize the spatial overlap between two self-organized networks. While merge refers to the time when two disjoint networks meet and overlap, split refers to the time of partition. In a dynamic environment, AutoComm (AC) principles bring a new support for interoperability since current protocol heterogeneity is observed at all stack layers from the radio interface to applications. In this paper, we reconsider the formalization of a community and its requirements. We then characterize the split and merge phenomena and their implications. We give some requirements that must fulfill solutions to merging (high centext-awareneas) in order for AC groups to self-scale. Finally, we propose a merging solution for overlapping wireless self-organized networks using heterogeneous routing protocols.

[1]  Ravi Prakash,et al.  MANETconf: configuration of hosts in a mobile ad hoc network , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[3]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[4]  R. Manmatha,et al.  Mobile distributed information retrieval for highly-partitioned networks , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[5]  Wilfried Philips EURASIP Journal on Applied Signal Processing Special issue 13 , 2005 .

[6]  Baochun Li,et al.  Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[8]  S. Fdida,et al.  Implicit merging of overlapping spontaneous networks [mobile ad hoc networks] , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[9]  Antti Oulasvirta,et al.  Towards socially aware pervasive computing: a turntaking approach , 2004, Second IEEE Annual Conference on Pervasive Computing and Communications, 2004. Proceedings of the.

[10]  Scott Shenker,et al.  Internet indirection infrastructure , 2002, SIGCOMM 2002.

[11]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[12]  Sandeep K. S. Gupta,et al.  Supporting persistent social groups in ubiquitous computing environments using context-aware ephemeral group service , 2004, Second IEEE Annual Conference on Pervasive Computing and Communications, 2004. Proceedings of the.

[13]  Jonathan P. Cummings Software radios for airborne platforms , 1999, IEEE J. Sel. Areas Commun..

[14]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[15]  David Gesbert,et al.  Guest editorial: MIMO systems and applications. 1 , 2003, IEEE J. Sel. Areas Commun..

[16]  Emin Gün Sirer,et al.  SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks , 2003, MobiHoc '03.

[17]  Richard Gold,et al.  Network pointers , 2003, CCRV.