Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by V. Vasudevan
Total Records ( 8 ) for V. Vasudevan
  K.L. Shunmuganathan and V. Vasudevan
  We propose an appearance-based facial recognition system based on multi-agents. By this method a person can be identified and verified using his face. Each RETSINA agent performs the facial recognition with its own small training sets and its stops other agents when it finds a match by communicating through ACL. Experimental results suggest that the proposed multi-agent based Facial recognition method provides a better recognition rate and achieves less time complexity. The worst case analysis shows proposed multi-agent based facial recognition is 80% better than ordinary facial recognition.
  S. Benedict and V. Vasudevan
  Grid computing environment involves all kind of resources namely network, software, data, storage and processing units, evolving towards Global computing to solve a single large problem using Grid scheduling architecture that addresses the interaction between the resource management and data management. In this study, two different approaches have been proposed to solve Grid scheduling problem with the objectives of maximizing the Job Completion Ratio (JCR) and minimizing the lateness. A population based evolutionary algorithm that involves evolution during the search process and a single point local search meta-heuristics that work on a single solution called as hybrid evolutionary algorithm. A Threshold Accepting algorithm (TA) proposed is a single point local search meta-heuristic. Proposed algorithms are evaluated and the experimental results are presented for comparison.
  E. Baburaj and V. Vasudevan
  Wireless networks and the usage of mobile devices are becoming popular in recent days, especially in creating Ad-Hoc networks. There is thus scope for developing mobile systems, where devices take an active part of creating a network infrastructure and can actually be used to route data between networks. This research proposes to assess different models of the usage of static and JADE Mobile Agents to determine the best route through Ad-Hoc networks. The determination of this route is a complex one and requires research into the best metrics to identify the best path, such as memory capacity, network performance, processing capabilities, cost and so on. One model is to use a mixture of mobile and static agents to gather relevant information. These agents could perform important tests, which could be used to generate the best route through a network. This research looks at different models for the deployment of these agents, which balance the usage of static and JADE Mobile Agents. These are appraised in the terms of performance, reconfigurability and easy of installation.
  E. Baburaj and V. Vasudevan
  This study presents a novel multicast routing protocol for mobile ad-hoc wireless networks. The protocol, termed ODMRP (On-Demand Multicast Routing Protocol) is a mesh-based, rather than a conventional treebased, multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently and power is constrained. We evaluate ODMRP`s scalability and performance.This ODMRP is put inside JADE Agents to improve functionality.
  E. Baburaj and V. Vasudevan
  Many potential applications of Mobile Ad hoc Networks (MANETs) involve group communications among the nodes. Multicasting is an useful operation that facilitates group communications. Efficient and scalable multicast routing in MANETs is a difficult issue. In addition to the conventional multicast routing algorithms, recent protocols have adopted the following new approaches: Overlays, backbone-based and stateless. These protocols are implemented within RETSINA agents. In this study, we study these approaches from the protocol state management point of view and compare their scalability behaviors. To enhance performance and enable scalability, we have proposed a framework for hierarchical multicasting in MANET environments. Two classes of hierarchical multicasting approaches, termed as domain-based and overlay-based, are proposed. We have considered a variety of approaches that are suitable for different mobility patterns and multicast group sizes. Results obtained through simulations demonstrate enhanced performance and scalability of the proposed techniques.
  B. Sasikumar and V. Vasudevan
  As 3rd Generation (3G) wireless networks withhigh data rate get widely deployed, optimizing TCP performance over these networks would have a broad and significant impact on data application performance. One of the biggest challenges in optimizing TCP performance over the 3G wireless networks is adapting to the significant delay and rate variations over the wireless channel. In this study, we make two main contributions. First, we present a Window Regulator algorithm that uses the receiver window field in the acknowledgment packets to convey the instantaneous wireless channel conditions to the TCP source and an ack buffer to absorb the channel variations, thereby maximizing long-lived TCP performance. It improves the performance of TCP Sack by up to 100% over a simple drop-tail algorithm for small buffer sizes at the congested router. Second, we present a wireless channel and TCP-aware scheduling and buffer sharing algorithm that reduces the latency of short TCP flows by up to 90% while still exploiting user diversity, thus allowing the wireless channel to be utilized efficiently. TCP protocols implemented in multiagent system.
  V. Vasudevan and R. Sukumar
  In wireless networks high-valued transmissions would need to be encrypted and only paying users should have the decryption keys. As a result, it is very important to securely distribute the multicast data encryption key to a set of legitimate subscribers. Secure key distribution is one of the significant challenges in secure multicast over wireless networks. In this study, we analyze number of key distribution schemes that offer a novel solutions for securely distributing the group key and re-key messages for joining and leaving a mobile host in secure multicast group. We focus on 3 different approaches of group key management The Modified Huffman Technique, Key Management Using One-Way Function Trees and Kronos. We perform a comparative study on these three techniques. We also study the issues related to multicast key management and propose some solutions to overcome those difficulties.
  S. Janakiraman and V. Vasudevan
  The intrusion detection system architectures universally used in commercial and research systems have a number of tribulations that limit their configurability, scalability or efficiency. The most common inadequacy in the existing architectures is that they are built around a single monolithic entity that does most of the data collection and processing. In this study, we review our architecture for a distributed Intrusion Detection System based on multiple sovereign entities working collectively. We call these entities Autonomous Agents. This approach solves some of the problems.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility