BISON: Biology-Inspired techniques for Self-Organization in dynamic Networks

Biology-Inspired techniques for Self-Organization in dynamic Networks (BISON) is a three-year Shared-Cost RTD Project (IST-2001-38923) funded by the Future and Emerging Technologies initiative of the Information Society Technologies Programme of the European Commission. It runs from January 2003 until December 2005. The objective of BISON is the design and implementation of algorithms for management and control in modern network environments. These environments are typically large, complex, highly dynamic, and heterogeneous. To cope with these challenges, network algorithms should have fully distributed and self-organizing architectures, and be adaptive, robust, and scalable. The central claim of BISON is that the observation and analysis of complex adaptive systems found in Nature can be a major source of inspiration to design algorithms with such characteristics. In what follows, we first describe the objectives of the project. Then we present the specific classes of networks that have been investigated, and discuss some of the results obtained so far in conjunction with the biological mechanisms that have provided useful design guidelines. More details can be found at http://www.cs.unibo.it/bison.

[1]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[2]  Márk Jelasity,et al.  T-Man: Gossip-Based Overlay Topology Management , 2005, Engineering Self-Organising Systems.

[3]  Luca Maria Gambardella,et al.  AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks , 2005, Eur. Trans. Telecommun..

[4]  I. Glauche,et al.  Continuum percolation of wireless ad hoc communication networks , 2003, cond-mat/0304579.

[5]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[6]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[7]  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.

[8]  Roberto Montemanni,et al.  Exact algorithms for the minimum power symmetric connectivity problem in wireless networks , 2005, Comput. Oper. Res..

[9]  Roberto Montemanni,et al.  Models and algorithms for the MPSCP: an overview , 2006 .

[10]  Márk Jelasity,et al.  Epidemic-style proactive aggregation in large overlay networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[11]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[12]  Luca Maria Gambardella,et al.  Using Ant Agents to Combine Reactive and Proactive Strategies for Routing in Mobile Ad-hoc Networks , 2005, Int. J. Comput. Intell. Appl..

[13]  Niloy Ganguly,et al.  Developing Efficient Search Algorithms for P2P Networks Using Proliferation and Mutation , 2004, ICARIS.

[14]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.