• DocumentCode
    2718252
  • Title

    Secure Routing Using Ant Colony Method and RPS Algorithm

  • Author

    Dhas, C. Suresh Gnana ; Belinda, J. Carmel Mary ; Manoja, J. Daffini ; Ramar, K.

  • Author_Institution
    Vinayaka Mission´´s Kirupananda Variya Eng. Coll., Tamilnadu
  • Volume
    4
  • fYear
    2007
  • fDate
    13-15 Dec. 2007
  • Firstpage
    37
  • Lastpage
    43
  • Abstract
    Soft computing is one of the emerging fields used in many application problems. This paper mainly deals with the emerging soft computing technique (i.e.) Ant colony algorithm for the optimized network routing and clustering method for the optimized network design. In the design of networks the fundamental problem is to transmit the packets of information from source node to destination node. An important part of network design is to find the best way to layout the nodes and arcs with a minimized cost between each of the path. In the Network Design stage nodes are grouped into clusters and interconnected using the Cluster Method. In the optimized routing stage the best path is selected from the designed network using the Ant Colony Soft Computing Techniques. The paper focuses on securing the path for data transmission using RPS algorithm.
  • Keywords
    network theory (graphs); optimisation; pattern clustering; RPS algorithm; ant colony method; clustering method; data transmission; optimized network design; optimized network routing; secure routing; soft computing; Ant colony optimization; Application software; Clustering algorithms; Computer science; Costs; Data communication; Design optimization; Educational institutions; Routing; Spine;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Conference on Computational Intelligence and Multimedia Applications, 2007. International Conference on
  • Conference_Location
    Sivakasi, Tamil Nadu
  • Print_ISBN
    0-7695-3050-8
  • Type

    conf

  • DOI
    10.1109/ICCIMA.2007.68
  • Filename
    4426446