Bio-Inspired Event Dissemination in Dynamic and Decentralized Networks

• Adam S. Banzi UFPR
• Aurora T. R. Pozo UFPR
• Elias P. Duarte Jr. UFPR

Abstract

This work presents a strategy based on swarm intelligence for spreading events in dynamic and decentralized networks. An event is defined as a state transition of a node or link. By means of ants, which correspond to mobile agents, information is spread throughout the network. A node which detects an event in its neighborhood starts disseminating the new information. Pheromones are used to both control the ant population and help define the paths that the agents take. An empirical study was performed, in which the proposed strategy was compared with flooding and gossip algorithms. Results obtained show that the proposed strategy presents a good trade-off between the time required to disseminate information and the overhead in terms of the number of messages.

References

Ahmed, A. and Far, B. (2007). Performance of mobile agent based network topology discovery. In Electrical and Computer Engineering, 2007. CCECE 2007. Canadian Conference on, pages 66–69.

Aissani, M., Fenouche, M., Sadour, H., and Mellouk, A. (2007). Ant-dsr: Cache maintenance based routing protocol for mobile ad-hoc networks. In Telecommunications, 2007. AICT 2007. The Third Advanced International Conference on, pages 35–35.

Bollobas, B. (2001). Random graphs. Cambridge Univ. Press.

Bonabeau, E., Dorigo, M., and Theraulaz, G. (1999). Swarm intelligence: from natural to artificial systems. Oxford University Press, USA.

Brocco, A., Malatras, A., and Hirsbrunner, B. (2009). Proactive information caching for efficient resource discovery in a self-structured grid. In BADS ’09: Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems, pages 11–18, New York, NY, USA. ACM.

Bu, T. and Towsley, D. (2002). On distinguishing between Internet power law topology generators. In IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings, volume 2.

Dong, C., rong Cheng, X., and quan Zhang, M. (2006). Research of mobile agent based network topology discovery. In Innovative Computing, Information and Control, 2006. ICICIC ’06. First International Conference on, volume 1, pages 733–736.

Eugster, P., Guerraoui, R., Kermarrec, A., and Massoulie, L. (2004). Epidemic information dissemination in distributed systems. Computer, 37(5):60–67.

Gopalan, N., Mala, C., Shriram, R., and Agarwal, S. (2006). Multicast tree computation for group communication in mobile networks using optimization techniques. In Ad Hoc and Ubiquitous Computing, 2006. ISAUHC ’06. International Symposium on, pages 88–93.

Mullender, S. (1993). Distributed Systems. Addison Wesley Publishing Company.

Nassu, B., Nanya, T., and Duarte, E. (2007). Topology discovery in dynamic and decentralized networks with mobile agents and swarm intelligence. Proceedings of 7th ISDA, IEEE Computer Society, Washington, pages 685–690.

Wei, J., Guo, W., Su, J., and Tang, W. (2009). Mobile agent based topology discovery in mobile ad hoc networks. In Wireless Communications, Networking and Mobile Computing, 2009. WiCom ’09. 5th International Conference on, pages 1–4.

White, T. and Pagurek, B. (1998). Towards multi-swarm problem solving in networks. In Proceedings of Third International Conference on Multi-Agent Systems (ICMAS’98), pages 333–340.

Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6):80–83.