Cauvery N K

R. V. College of Engineering, Computer Science and Engineering, Faculty Member

Followers

292

Following

Public Views

Habiba Drias

nordin zakaria

Carlos Cotta

Universidad de Málaga

Christine Mumford

David A Pelta

University of Granada

VELIN KRALEV

South-Western University - Blagoevgrad

Radoslava Kraleva

South-Western University - Blagoevgrad

IJERA Journal

International Journal of Engineering Research and Applications (IJERA)

hamed babaei

Islamic Azad University, Ahar branch

Mario Pavone

University of Catania

Interests

Uploads

Papers by Cauvery N K

Timetable Scheduling using Graph Coloring

ijpttjournal.org

The problem of constructing an automated system for timetabling is a particularly well known one.... more The problem of constructing an automated system for timetabling is a particularly well known one. Timetabling is a common example of a scheduling problem and can manifest itself in several different forms; the particular form of timetable required is specific to the environment or organization in which it is needed. Many programs exist for this task but they perform well only in particular isolated environment. With the help of graph coloring, it is proposed to develop a general system that can cope with the ever changing requirements of large educational institutions. Timetabling problem is a NP-hard problem. many combinatorial problems (optimization problems) are NP-hard. It is generally believed that NPhard problems cannot be solved to optimality within times which are polynomial bounded functions of input size. Therefore there is much interest in heuristic algorithms which can find near optimal solutions within reasonable running time. One of the most studied NP-hard problems is the "graph coloring problem". Graph coloring has numerous applications in scheduling and other practical problem; "timetabling" is one of them. One of the heuristic approaches to solve graph coloring is "Ant algorithm" [1].

Download

Water Marking on Digital Image using Genetic Algorithm

ijcsi.org

Due to the explosion of data exchange on the Internet and the extensive use of digital media, it ... more Due to the explosion of data exchange on the Internet and the extensive use of digital media, it has been a great matter of interest in multimedia security and multimedia copyright protection. This work presents a secure algorithm for watermarking images, and a methodology for digital watermarking that may be generalized to video data. The watermark should be constructed as an independent and identically distributed. The main issues to be are considered during watermarking are Robustness and Fidelity. Robustness of the watermark implies the strength of the watermark against various image processing attacks. Fidelity is the factor which determines the quality of the image after embedding the watermark. The insertion of a watermark under this regime makes the watermark robust to signal processing operations and common geometric transformations provided that the original image is available and that it can be successfully registered against the transformed watermarked image. Genetic algorithm is used to identify the position for marking.

Download

Routing Algorithm using mobile agents and Genetic Algorithm

ijcee.org

This paper presents a routing algorithm for computer network using mobile agents (Ant algorithm) ... more This paper presents a routing algorithm for computer network using mobile agents (Ant algorithm) and genetic algorithm. Ant algorithm is a class of Swarm Intelligence (SI) algorithms. SI is the local interaction of many simple agents to achieve a global goal. SI is based on social insect metaphor for solving different types of problems. Ant algorithm uses mobile agents called ants to explore network. Ants help in finding paths between two nodes in the network. Paths generated by ants act as input to Genetic Algorithm (GA). GA finds the set of suboptimal paths between nodes with the objective of minimum cost. This hybrid algorithm exhibits better performance when compared to basic ant algorithm.

Download

ADAPTIVE ROUTING ALGORITHM FOR MANET: TERMITE 1

Mobile Ad hoc network consists of a set of mobile nodes. This network does not have any infrastru... more

Different types of Swarm Intelligence algorithm for routing

… on Advances in Recent Technologies in …, Jan 1, 2009

Abstract Swarm intelligence (SI) is emerged with collective intelligence of groups of simple age... more

Ant Algorithm for Mobile Ad Hoc network

Proceedings of the International Conference on …, Jan 1, 2008

Routing in Dynamic Network using Ants and Genetic Algorithm

IJCSNS, Jan 1, 2009

Routing in dynamic network is a challenging one, because the topology of the network is not fixed... more Routing in dynamic network is a challenging one, because the topology of the network is not fixed. This issue is addressed in this presentation using ant algorithm to explore the network using intelligent packets. The paths generated by ants are given as input to genetic algorithm. The genetic algorithm finds the set of optimal routes. The importance of using ant algorithm is to reduce the size of routing table. The significance of genetic algorithm is based on the principle evolution of routes rather than storing the precomputed routes.

Download

Enhanced ant colony based algorithm for routing in mobile ad hoc network

Proceedings of World Academy of …, Jan 1, 2008

Mobile Ad hoc network consists of a set of mobile nodes. It is a dynamic network which does not h... more Mobile Ad hoc network consists of a set of mobile nodes. It is a dynamic network which does not have fixed topology. This network does not have any infrastructure or central administration, hence it is called infrastructure-less network. The change in topology makes the route from source to destination as dynamic fixed and changes with respect to time. The nature of network requires the algorithm to perform route discovery, maintain route and detect failure along the path between two nodes [1]. This paper presents the enhancements of ARA [2] to improve the performance of routing algorithm. ARA [2] finds route between nodes in mobile ad-hoc network. The algorithm is on-demand source initiated routing algorithm. This is based on the principles of swarm intelligence. The algorithm is adaptive, scalable and favors load balancing. The improvements suggested in this paper are handling of loss ants and resource reservation.

Download

Timetable Scheduling using Graph Coloring

ijpttjournal.org

Download

Water Marking on Digital Image using Genetic Algorithm

ijcsi.org

Download

Routing Algorithm using mobile agents and Genetic Algorithm

ijcee.org

Download

ADAPTIVE ROUTING ALGORITHM FOR MANET: TERMITE 1

Mobile Ad hoc network consists of a set of mobile nodes. This network does not have any infrastru... more