Secure routing using Ant colony method and RPS algorithm

Dhasm, C. Suresh Gnana and Belinda, J. Carmel Mary and Manoja, J. Daffini and Ramar, K. (2007) Secure routing using Ant colony method and RPS algorithm. ICCIMA 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND MULTIMEDIA APPLICATIONS, VOL IV, PROCEEDINGS. 37-+.

Full text not available from this repository.

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.

Item Type: Article
Uncontrolled Keywords: soft computing, Ant colony algorithm, survivability, clustering, dynamic programming
Subjects: Computer Science > Artificial Intelligence
Computer Science > Computer Science
Computer Science > Information Systems
Divisions: Engineering and Technology > Vinayaka Mission's Kirupananda Variyar Engineering College, Salem, India > Computer Science and Engineering
Depositing User: Unnamed user with email techsupport@mosys.org
Last Modified: 06 Feb 2026 07:13
URI: https://ir.vmrfdu.edu.in/id/eprint/7164

Actions (login required)

View Item
View Item