• DocumentCode
    2539915
  • Title

    An Multicast Routing Based on Ant Colony Optimization Algorithm for DTN

  • Author

    Zhufang, Kuang

  • Author_Institution
    Sch. of Comput. & Inf. Eng., Central South Univ. of Forestry & Technol., Changsha, China
  • fYear
    2010
  • fDate
    13-15 Dec. 2010
  • Firstpage
    354
  • Lastpage
    357
  • Abstract
    Delay tolerant networks (DTNs) are a class of emerging networks that experience frequent and long-duration partitions. Multicast supports the distribution of data to a group of users, a service needed for many potential DTN applications, due to the unique characteristic of frequent partitioning in DTNs, multicasting in DTNs is a considerably different and challenging problem. In this paper, The mathematics model for DTNs is established, and the ant colony optimization algorithm introduce to solve the multicast problem.A multicast routing based on ant colony optimization algorithm-MRACO is proposed in this paper.Simulation results show that our multicast routing MRACO can not only have a higher delivery ratio and lower delay, but also have a lower data forwarding cost, in terms of the number of relays used.
  • Keywords
    multicast communication; particle swarm optimisation; telecommunication network routing; DTN; MRACO; ant colony optimization algorithm; delay tolerant networks; emerging networks; long-duration partitions; multicast routing; Ant colony optimization; Delay; Mathematical model; Optimization; Relays; Routing; Time factors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on
  • Conference_Location
    Shenzhen
  • Print_ISBN
    978-1-4244-8891-9
  • Electronic_ISBN
    978-0-7695-4281-2
  • Type

    conf

  • DOI
    10.1109/ICGEC.2010.94
  • Filename
    5715442