CGrAnt: A swarm intelligence-based routing protocol for delay tolerant networks

GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation

Volumn , Issue , 2012, Pages 33-40

  Vendramin, Ana Cristina B Kochem ^a   Munaretto, Anelise ^a   Delgado, Myriam R ^a   Viana, Aline Carneiro ^b  

^a UNIVERSIDADE TECNOLÓGICA FEDERAL DO PARANÁ   (Brazil)

^b INRIA SACLAY   (France)

Author keywords

ant colony optimization; cultural algorithms; delay tolerant network; routing protocol; social metrics

Indexed keywords

ACTIVITY-BASED; ANT COLONY OPTIMIZATION (ACO); BELIEF SPACE; CULTURAL ALGORITHM; DELAY TOLERANT NETWORKS; DELIVERY RATIO; GLOBAL INFORMATIONS; HEURISTIC FUNCTIONS; LOCAL INFORMATION; METAHEURISTIC; ROUTING DECISIONS; SOCIAL METRICS; SWARM INTELLIGENCE; TRANSITION RULE;

HEURISTIC ALGORITHMS; ROUTERS; ROUTING PROTOCOLS; WIRELESS NETWORKS;

ARTIFICIAL INTELLIGENCE;

EID: 84864724044     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2330163.2330169     Document Type: Conference Paper

References (20)

1. Fall, K. 2003. A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. ACM, New York, NY, USA, 27-34. DOI= http://doi.acm.org/10.1145/863955.863960.
2. Fall, K. and Farrel, S. 2008. DTN: an architectural retrospective. IEEE J. Sel. Areas in Commun., 26, 5 (June 2008), 828-836. DOI= http://dx.doi.org/10. 1109/JSAC.2008.080609.
3. Cerf, V. et al. 2007. Delay-tolerant network architecture, IETF RFC 4838, DTN Research Group, 〈http://www.ietf.org/rfc/rfc4838.txt〉.
4. Dorigo, M., Maniezzo, V., and Colorni, A. 1996. Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B Cybern., 26, 1 (Feb. 1996), 29-41. DOI= http://dx.doi.org/10.1109/3477.484436.
5. Dorigo, M. and Caro, G. 1999. Ant colony optimization meta-heuristic. New Ideas in Optimization, McGraw-Hill, 11-32.
6. Reynolds, R. 1994. An introduction to cultural algorithm. In Proceedings of the 3rd Annual Conference on Evolutionary Programming, World Scientific Publishing, River Edge, New Jersey, USA, 131-139.
7. Saleem, S. M. 2001. Knowledge-Based Solution to Dynamic Optimization Problems using Cultural Algorithms. PhD Thesis, Wayne State University, Detroit, Michigan.
8. Vadhat, A. and Becker, D. 2000. Epidemic routing for partially connected ad hoc networks. Technical Report CS-2000-06, Duke University.
9. Lindgren, A., Doria, A, and Schelén, O. 2004. Probabilistic routing in intermittently connected networks. In Lect. Notes Comput. Sci., 3126 (Jan. 2004), 239-254. DOI= http://dx.doi.org/10.1007/978-3-540-27767-5-24.
10. Liu, L. and Feng, G. 2005. Swarm intelligence based node-disjoint multi-path routing protocol for mobile ad hoc networks. In Proceedings of the 5th International Conference on Information, Communications and Signal Processing, Bangkok, Thailand, 598-602. DOI= http://dx.doi.org/10.1109/ICICS. 2005.1689117.
11. Rosati L., Berioli, M., and Reali, G. 2008. On ant routing algorithms in ad hoc networks with critical connectivity. Ad Hoc Networks, 6, 6 (Aug. 2008), 827-859. DOI= http://dx.doi.org/10.1016/j.adhoc.2007.07.003.
12. La, R. J., and Ranjan, P. 2009. Ant-based adaptive message forwarding scheme for challenged networks with sparse connectivity. In Proceedings of the 28th IEEE Military Communications Conference, Boston, MA, USA, 1-7. DOI= http://dx.doi.org/10.1109/MILCOM.2009.5379884.
13. Zhang, P. et al. 2010. ACRP: Ant-colony-based routing protocol for DTMNs. In Proceedings of the 2010 International Conference on Educational and Information Technology, 2, Chongqing, China, 272-276. DOI= http://dx.doi.org/10. 1109/ICEIT.2010.5607571.
14. Vendramin, A. C. B. K., Munaretto, A., Delgado, M., and Viana, A. C. 2012. GrAnt: Inferring Best Forwarders from Complex Networks' Dynamics through a Greedy Ant Colony Optimization. Computer Networks, 56, 3 (Feb. 2012), 997-1015. DOI= http://dx.doi.org/10.1016/j.comnet.2011.10.028.
15. Ma, J. et al. 2008. Research on cultural algorithm for solving routing problem of mobile agents. The Journal of China Universities of Posts and Telecommunications, 15, 4 (Dec. 2008), 121-125. DOI= http://dx.doi.org/10.1016/ S1005-8885(08)60415-X.
16. Zhang, M.-W., Sun, X.-M., and Lv, X.-Y. 2010. A QoS routing algorithm based on culture-ant colony algorithm. In Proceedings of the International Conference on Computer Application and System Modeling, Taiyuan, China, 198-201. DOI= http://dx.doi.org/10.1109/ICCASM.2010.5622234.
17. Freeman, L. C. 1979. Centrality in social networks: conceptual clarification. Social Networks, 1, 3, 215-239. DOI= http://dx.doi.org/10.1016/ 0378-8733(78)90021-7.
18. Daly, E. M. and Haahr, M. 2007. Social network analysis for routing in disconnected delay-tolerant MANETs. In Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, ACM, New York, NY, USA, 32-40. DOI= http://doi.acm.org/10.1145/1288107.1288113.
19. Ekman, F. et al. 2008. Working day movement model. In Proceedings of 1st ACM SIGMOBILE Workshop on Mobility Models, ACM, New York, NY, USA, 33-40. DOI= http://doi.acm.org/10.1145/1374688.1374695.
20. Keränen, A., Kärkkäinen, T., and Ott, J. 2010. Simulating mobility and DTNs with the ONE. Journal of Communications, 5, 2, 92-105 (Feb. 2010). DOI= http://dx.doi.org/10.4304/jcm.5.2.92-105.