Secure routing using Ant colony method and RPS algorithm

被引：0

作者：

Dhasm, C. Suresh Gnana ^{[1
]}

Belinda, J. Carmel Mary ^{[2
]}

Manoja, J. Daffini ^{[3
]}

Ramar, K. ^{[4
]}

机构：

[1] Vinayaka Miss Kirupananda Variya Engn Coll, Dept Comp Sci & Engn, Salem, Tamil Nadu, India

[2] CSI Inst Technol, Dept Comp Sci & Engn, Thovalai 629302, Tamil Nadu, India

[3] SSN Coll Engn, Dept Comp Sci & Engn, Kalavakam, Tamil Nadu, India

[4] Natl Engn Coll, Dept Comp Sci & Engn, Kovilpatti, Tamil Nadu, India

来源：

ICCIMA 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND MULTIMEDIA APPLICATIONS, VOL IV, PROCEEDINGS | 2007年

关键词：

soft computing; Ant colony algorithm; survivability; clustering; dynamic programming;

D O I：

10.1109/ICCIMA.2007.68

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：37 / +

页数：3

共 14 条

[1]

[Anonymous], 2004, Ant colony optimization

[2]

[Anonymous], 1992, OPTIMIZATION LEARNIN

[3]

BONABEAU E, 1999, MARCO DORIGO THERAUL

[4]

Colorni A, 1991, P 1 EUR C ART LIF, DOI DOI 10.1109/MHS.1995.494215

[5]

DENGIZ B, GENETIC ALGORITHM AP

[6]

Dodis Y., 1999, Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, P750, DOI 10.1145/301250.301447

[7] Network flow models for designing Diameter-Constrained Minimum-Spanning and Steiner trees [J].

Gouveia, L ;

Magnanti, TL .

NETWORKS, 2003, 41 (03) :159-173

[8] Topology design for free space optical networks [J].

Gurumohan, PC ;

Hui, J .

ICCCN 2003: 12TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2003, :576-579

[9]

JALLDAL F, INTRO ANT COLONY ALG

[10]

RAIDL GR, 2003, P 18 ACM S APPL COMP, P747

← 1 2 →