S. Ramachandram

Learn More
In Mobile Ad-hoc Networks (MANETs) each node has a transmission radius and is able to send message to all of its neighbors that are located with in its radius. In reactive based routing algorithms such as Ad-hoc on demand Routing Algorithm (AODV) and Dynamic Source Routing Algorithm (DSR) a node broadcasts control information (Route Request, Route Reply,(More)
Information Gain Clustering through Prototype - Embedded Genetic K-Mean Algorithm (IGCPGKA) is a novel heuristic used in Recommendation System (RS) for solving personalization problems. In a bid to generate information on the behavior and effectiveness of Prototype-Embedded Genetic K-mean Algorithm (PGKA) -- a clustering algorithm - in Recommender System(More)
The existing reactive routing algorithms in Mobile Ad-hoc Networks (MANETs) generally send route request packet to all the neighbor nodes when it needs to find the destination. This greatly reduces the performance of network and consumes much of the bandwidth. The existing routing algorithms such as Ad-hoc On-demand Routing Algorithm (AODV) and Dynamic(More)
In this paper we propose an approach to improve the performance of existing flood based routing algorithm Ad-hoc on demand Distance Vector Routing [2] for mobile Ad-hoc wireless networks based on heuristic searching technique. Flooding technique is often used for route discovery in on demand mechanism in MANET such as AODV, DSR. To avoid the problem of(More)
In Grid Computing the number of resources and tasks is usually very large, which makes the scheduling task very complex optimization problem. Genetic algorithms (GAs) have been broadly used to solve these NP-complete problems efficiently. On the other hand, the Standard Genetic algorithm (SGA) is too slow when used in a realistic scheduling due to its(More)
Wireless mesh networks are multi hop wireless networks with high performance requirements. To enhance the performance , a large number of routing protocols have been proposed focussing on various link properties.The met-rics designed to capture various link properties make an important assumption that nodes cooperate in network operations. On the other(More)