V.P. Arunachalam

SNS College of Technology, Coimbatore, State of Tamil Nadu, India

Are you V.P. Arunachalam?

Claim your profile

Publications (25)0 Total impact

  • R. Bharathiraja · S. Karthik · V.P. Arunachalam
    [Show abstract] [Hide abstract]
    ABSTRACT: In Mobile Ad hoc Networks (MANET), most of the existing works does not consider energy efficiency during selecting the appropriate route. Hence in MANET selecting the appropriate route and also maintaining energy efficiency is very important. Hence in order to overcome these issues, in this study we propose Channel Based Adaptive Rate Control technique for MANET. Here the most appropriate links is selected to transmit the node with efficient power consumption. The node broadcasts the information of its outgoing and incoming links in NSET instead of waiting for the feedback informattion from receiver. The number of packets transmitted in a channel access time is maximized by implementing the benefit ratio in rate selection algorithm. This study also introduces node cooperation, in node cooperation the node determines the feasibility of new rate setting determined by rate selection algorithm and it carries out new setting if it is feasible by following help, ack, reject and accept method. By simulation results we show that the proposed approach is power efficient and also increases the trasmission rate.
    No preview · Article · Jan 2014 · Research Journal of Applied Sciences, Engineering and Technology
  • R. Bharathiraja · S. Karthik · V.P. Arunachalam
    [Show abstract] [Hide abstract]
    ABSTRACT: The network connectivity of Mobile Ad hoc Networks (MANETs) is a multifaceted problem due to the uncertainty of the network topology. Since, wireless links have significantly limited capacity, they are affected by several errors that results in degradation of the received signal and consequently lead to the problem of coverage and connectivity. In this paper, we propose to develop a smart transmission power adjustment routing technique based on connectivity and coverage for MANETs. Initially traffic factor is calculated for each node which is based on the input and output capacity at each node and data generation rate. Then the path which has minimum transmission power and traffic factor is selected for transmission. The proposed technique also provides transmission of data to the node which is outside the coverage area. From the simulation results, we show that the proposed routing technique provides optimal power control in MANET by attaining good throughput and reduced energy consumption.
    No preview · Article · Jul 2013
  • K. Srihari · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: The content is extracted by means of semantic relevancy. The semantic relevancies relate the content of videos based on a certain parameter. The parameter varies between system to system (implementation). The parameter will improve the performance of semantic relevancy and accuracy. This accuracy is obtained after various random experiments. Here a method called concept, sub concept graph method is used to implement the semantic relevancies. A graph algorithm is constructed to improve the relevancies between concepts. The ontology model is created based on the relationship between the vertices. At first relationship between the parent and child are calculated. Then based on all the relationships the diagrammatic representations are done. Based on hit rates the priority of web pages are done and based on the number of relationships the value for the vertices are noted.
    No preview · Article · Mar 2013
  • R. Bharathiraja · S. Karthik · V.P. Arunachalam
    [Show abstract] [Hide abstract]
    ABSTRACT: In Mobile Ad hoc Networks (MANETs), battery power is a limited resource and it is expected that battery technology is not likely to progress as fast as computing and communication technologies do. Hence, in order to lengthen the lifetime of batteries is an important issue which is supported by batteries only. But the existing power control techniques rarely consider the delay incurred in power estimation and connectivity of the network. Overhead problems are also caused by sending RTS packets. In order to solve the above problems, researchers propose to develop a power control MAC protocol for minimizing the power consumption and increasing the throughput in MANET. Initially, researchers assume that each node contains a neighbor set (NSET). Based upon the critical transmission range for connectivity, the nodes within the transmission range can be identified. Within the transmission range, the source node chooses the nodes with optimal initial transmission power value. These are stored in NSET to which the source can directly transmit the data with the selected optimal transmission power values. For the nodes beyond the transmission range, the power values of the intermediate nodes are also calculated and the source node sends data to the destination through nodes that has minimum transmission power value.
    No preview · Article · Jan 2013
  • S. Nandagopal · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: In the past, mining association rules are concentrated only on mining intra-transaction associations. In this study, we break the hindrances of mining association rules from classical intra-transaction associations to inter-transaction associations. Mining inter-transaction associations have more challenges on efficient processing than mining intra-transaction associations because the number of potential association rules becomes extremely large. Several algorithms have been proposed to solve the problem of generating large amount of association rules. At present, the FITI algorithm is the state of the art in inter-transaction association rule mining, but it generates many unneeded combinations of items because the set of generated extended items is much larger than the set of items. To solve this problem, we introduce an alternative approach of crumb based inter-transaction association rule mining, where a crumb is a group of identical transactions that meet a certain condition. The results show that our crumb based approach is most promising than the FITI.
    No preview · Article · Jul 2012
  • K. Praveen Kumar · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: In wireless sensor networks, the protocols with minimum energy path deprives the nodes energy quickly and the time taken to determine an alternate path increases. Further, the energy hole problem reduces the lifetime of the network and results in wastage of more energy of the nodes. In this paper, we propose to develop a cluster based multi path routing protocol for energy conservation in wireless sensor networks. It includes three phases such as cluster construction, inter-cluster multipath route establishment, cluster reconstruction and alternate path selection. By simulation results, we show that the proposed approach achieves better throughput, packet delivery ratio with reduced energy consumption and delay.
    No preview · Article · Jun 2012
  • T. Kalaikumaran · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: Today, in the world, crime analysis is the most popular in crime prediction. The forecasting of crime by place, time, types of crimes and number of crimes to get precautions. Spatial and Temporal crime hotspot is identified by the use of spatial clustering algorithm and structured crime classification algorithm is used to classify the forecasting of the criminal activities. In this paper we identified the related factors to prevent crime by analysis the crime forecasting on place, time and crime type. This helps the police department in tactical and prevent the crime.
    No preview · Article · May 2012
  • S. Kannan · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: Group communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method for implementing group communications. However, it is challenging to implement multicast packet forwarding over a dynamic topology. Researchers propose a novel Efficient Geographic Multicast Protocol (EGMP). A network wide zone based bi-directional tree is constructed to achieve more efficient multicast delivery. The position information is used to guide the zone structure building, multicast tree construction and multicast packet forwarding which efficiently reduces the overhead for route searching and tree structure maintenance. Several strategies have been proposed to further improve the efficiency of the protocol, for example introducing the concept of zone depth for building an optimal tree structure and integrating the location search of group members with the hierarchical group membership management. Finally, researchers design a scheme to handle empty zone problem faced by most routing protocols using a zone structure. The scalability and the efficiency of EGMP are evaluated through simulations. The simulation results demonstrate that EGMP has high packet delivery ratio and low control overhead and multicast group joining delay under all test scenarios and is scalable to both group size and network size. EGMP has significantly lower control overhead, data transmission overhead and multicast group joining delay.
    No preview · Article · Mar 2012
  • A. Viswanathan · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: Mitigation is one of the countermeasure to overcome the Distributed Denial of service (DDoS) attack. The delay in the availability of services to the intended users is mainly caused by DDoS attacks done by a mischievous intruder in the internet. In protesting the DDoS attack by various methods, it is unethical to boycott the genuine packet sent by a harmless personnel. In this paper we focus on privilege constraints that apply tautological method to prevent exact packet that harms to the victim. Usually a novel push back mechanism deals with all upstream routers and the victim can trace back the source from which the attack is emerged and pass the command to the attack diagnosis (AD) router not to send the troublesome packet further. Thus the harmful packet is filtered and the attack is isolated from this iterative process until the attack is quenched. When we use Geographical Division Traceback (GDT) techniques the push-back mechanism need not share with all the routers. The regional identification mark (RIM) with destination address and the size of the packet and GDT information, it makes the router to identify the attack packet easier. Here tauotological method is carried out with the help of (AD). IP spoofing can be prevented by this strategy as we include a RIM value along with the packets.This method of strategy allows legitimate user to keep sending the packet uninterruptedly by focusing on thwrating and traceback. This technique provides several features such as easy traversing and improves the effectiveness of traceback in finding the source of the attacker. Geographical Division Traceback for Thwarting DDoS using Normal Distribution and Tautological Theorem
    No preview · Article · Feb 2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Problem statement: The last decade has seen many prominent Distributed Denial of Service (DDoS) attacks on high profile webservers. In this study, we deal with DDoS attacks by proposing a dynamic reactive defense system using an adaptive Spin Lock Rate control (D3SLR). D3SLR identifies malicious traffic flow towards a target system based on the volume of traffic flowing towards the victim machine. Approach: The proposed scheme uses a divide and conquer approach to identify the infected interface via which malicious traffic are received and selectively implements rate limiting based on the source of traffic flow towards victim and type of packet rather than a collective rate limiting on flow towards victim. Results: The results observed in simulation shows that D3SLR detects the onset of the attacks very early and reacts to the threat by rate limiting the malicious flow. The spin lock rate control adapts quickly to any changes in the rate of flow. Conclusion: D3SLR can be successfully implemented at critical points in the network as autonomous defense systems working independently to limit damage to the victim and also allows legitimate flows towards the target system with a higher degree of accuracy.
    No preview · Article · Jan 2012
  • A. Viswanathan · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: Problem statement: Distributed Denial of Service (DDoS) was a serious threat to the internet world that denies the legitimate users from being access the internet by blocking the service. Approach: In this study, we proposed a novel approach, Geographical Division Traceback (GDT) for efficient IP traceback and DDoS defense methodology. DDoS attack was one of the most serious and threatening issue in the modern world web because of its notorious harmfulness and it causes the delay in the availability of services to the intended users. Results: Unless like a traditional traceback methodology, GDT proposes a quick mechanism to identify the attacker with the help of single packet which imposes very less computational overhead on the routers and also victim can avoid receiving data from the same machine in future. This mechanism for IP Traceback utilizes the geographical information for finding out the machine which was responsible for making the delay was proposed. The IP packet consists of the subspaces details in which the path denotes. It helps to make sure whether the packet travels in the network and falls within any one of the subspaces. The division of subspaces leads to the source of attack system. Conclusion/Recommendations: This method possesses several advantageous features such as easy traversing to the attacker and improves the efficiency of tracing the attacker system.
    No preview · Article · Jan 2012
  • K. Srihari · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: In this fast moving world searching is the important and vital field where each and every activity involved in it. The semantic search adds special flavor to the normal searching technique. It improves accuracy, amount of time for searching is reduced and the knowledge about searching is also improved. In this paper a technique for the search engine which involves logic based retrieval and relationship are based on RDF. In current RDF the relationship are based on static and manual methods for obtaining relations. We propose a method which automatically generates the logical relation with the help of input URL. The URL is given as input and automatic RDF is generated. The RDF which is generated with the help of URL can be optimized.
    No preview · Article · Jan 2012
  • K. Srihari · V.P. Arunachalam · S. Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: Queries play a vital role in a semantic search engine. Developing a search engine involves query optimization. The queries has to be properly aligned, the queries has to be properly distributed among the database. Queries are related together and they are compared with the algorithms. This performance will be better than the query index method. Here we propose a semantic based algorithm and implemented that algorithm. A new semantic search engine is created with an URL. http://researchsrihari.replicoders.com. The results of our semantic search engine is compared to the existing search engines like hakia,swoogle,lexxe and comparison graph is generated. By comparing the result the number of quality pages visited is improved in our research. The proposed semantic search engine is practically implemented and compared with the current semantic search engines like hakia,swoogle.
    No preview · Article · Jan 2012
  • S. Nandagopal · S. Karthik · V.P. Arunachalam
    [Show abstract] [Hide abstract]
    ABSTRACT: The traditional studies on mining association rules are on mining intra-transaction associations. In this study, we extend scope of mining association rules from traditional intra-transaction associations to N-Dimensional inter-transaction associations. Mining inter-transaction associations poses more challenges on efficient processing than mining intra-transaction associations because the number of potential association rules becomes extremely large. The current paper extends in both theoretical and practical aspects. In the theoretical aspects, we improve the inter-transactional association rule framework by giving a more concise definition of inter-transactional association rules and related measurements, and investigate the closure property, theoretical foundations, multidimensional mining contexts, and performance issues in mining such extended association rules. We study the downward closure property problem within the inter-transactional association rule framework, and propose a solution for efficient mining of inter-transactional association rules. We also present a Modified Apriori algorithm for mining inter-transactional association rules. We take data holes that possibly exist in the mining contexts into consideration. We also address some important technical issues, including correctness, termination and computational complexity, in this paper. In practice, we study the applicability of inter-transactional association rules to weather prediction, using multistation meteorological data. We report our experimental results as well as the experiences gained during the weather study. In particular, the deficiency of the current support/confidence-based association mining framework and its further extension in providing N-dimensional predictive capabilities are addressed.
    No preview · Article · Nov 2010
  • S. Karthik · V. P. Arunachalam · T. Ravichandran · M. L. Valarmathi
    [Show abstract] [Hide abstract]
    ABSTRACT: DoS / DDoS(Distributed Denial of Service) attacks deny regular, internet services accessed by legitimate users, either by blocking the services completely, or by disturbing it completely, so as to cause customer baulking. Several traceback schemes are available to mitigate these attacks. The simulation approach also can be used to test the performing effects of different marking schemes in large-scale DDoS attacks. Based on the simulation and evaluation results, more efficient and effective algorithms, techniques and procedures to combat these attacks may be developed. DGT8, directional geographical trackback scheme, with 8 directions is one of them. Having a limited set of 8 directions, DGT8 may not work for routers with more than 8 interfaces. In this paper, we propose M-DGT i.e DGT 16, a 16 directional geographical traceback scheme having all the advantages of DGT. The 16 directions, though not having exactly equal interface, have nearly equal measures, and are identified using a novel scheme of Segment Direction Ratios (SDR). The SDR concept and the associated marking scheme allow the victim to defend against DDoS attacks independent of its ISP and also the generalization to DGT2n, having 2n directions (n>4).
    No preview · Conference Paper · Sep 2010
  • Source
    Karthik S · Kannan.S · V. P. Arunachalam · Ravichandran T · M. L. Valarmathi
    [Show abstract] [Hide abstract]
    ABSTRACT: Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile hosts forming a temporary network without the aid of any stand-alone infrastructure or centralized administration. Mobile Ad-hoc networks are self-organizing and self-configuring multihop wireless networks where, the structure of the network changes dynamically. This is mainly due to the mobility of nodes. The Nodes in the network not only acts as hosts but also as routers that route data to or from other nodes in network. In mobile ad-hoc networks a routing procedure is always needed to find a path so as to forward the packets appropriately between the source and the destination. The main aim of any ad-hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an efficient communication path between any two nodes with minimum routing overhead and bandwidth consumption. The design problem of such a routing protocol is not simple since an ad hoc environment introduces new challenges that are not present in fixed networks. A number of routing protocols have been proposed for this purpose like Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Destination- Sequenced Distance Vector (DSDV). In this paper, we study and compare the performance of the following three routing protocols AODV, DSR and DSDV.
    Preview · Article · Jan 2010
  • S. Karthik · S. Kannan · V.P. Arunachalam · T. Ravichandran · M.L. Valarmathi
    [Show abstract] [Hide abstract]
    ABSTRACT: Denial of Service (DoS) attacks constitutes one of the major threats and among the hardest security problems in today's Internet. Of particular concern are Distributed Denial of Service (DDoS) attacks whose impact can be proportionally severe. With little or no advance warning, a DDoS attack can easily exhaust the computing and communication resources of its victim within a short period of time. Because of the seriousness of the problem many defense mechanisms have been proposed to combat these attacks. This study aims to provide an understanding of the existing attack methods, tools and defense mechanisms, so that a better understanding of DDoS attacks can be achieved. The goal of the study is to simulate an environment by extending NS2, setting attacking topology and traffic which can be used to evaluate and compare the methods of DDoS attacks and tools. Based on the simulation and evaluation results, more efficient and effective algorithms, techniques and procedures to combat these attacks may be developed.
    No preview · Article · Jan 2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: Several IP traceback schemes have been proposed to trace DoS/DDoS attacks that abuse the internet. A mechanism for IP traceback based on the geographic information rather than the traditional IP address information was proposed in [1], for 8 directions is a planar environment. Extension of this two dimensional directed geographical traceback to 2n [n≥ 4] directions is also available [2]. In this paper, the DGT scheme has been generalized to three dimensions, with all routers in a spherical environment in tune with reality. A traceback algorithm, called Direction Ratio Algorithm (DRA) enables IP traceback with robustness and fast convergence.
    No preview · Article · Jan 2010
  • Source
    S.Karthik · V.P.Arunachalam · T.Ravichandran
    [Show abstract] [Hide abstract]
    ABSTRACT: DoS / DDoS(Distributed Denial of Service) attacks denyregular, internet services accessed by legitimate users,either by blocking the services completely, or by disturbingit completely, so as to cause customer baulking. Severaltraceback schemes are available to mitigate these attacks.The simulation approach also can be used to test theperforming effects of different marking schemes in largescaleDDoS attacks. Based on the simulation andevaluation results, more efficient and effective algorithms,techniques and procedures to combat these attacks may bedeveloped. DGT8, directional geographical trackbackscheme, with 8 directions is one of them. Having a limitedset of 8 directions, DGT8 may not work for routers withmore than 8 interfaces. In this paper, we propose M-DGTi.e DGT 16, a 16 directional geographical tracebackscheme having all the advantages of DGT. The 16directions, though not having exactly equal interface, havenearly equal measures, and are identified using a novelscheme of Segment Direction Ratios (SDR). The SDRconcept and the associated marking scheme allow thevictim to defend against DDoS attacks independent of itsISP and also the generalization to DGT2n, having 2ndirections (n>4).
    Preview · Article · Jan 2010
  • Source
    S. Karthik · R.M. Bhavadharini · V.P. Arunachalam
    [Show abstract] [Hide abstract]
    ABSTRACT: Denial of Service (DoS) attacks constitutes one of the major threats and among the hardest security problems in today's Internet. Of particular concern are Distributed Denial of Service (DDoS) attacks, whose impact can be proportionally severe. With little or no advance warning, a DDoS attack can easily exhaust the computing and communication resources of its victim within a short period of time. Because of the seriousness of the problem many defense mechanisms have been proposed to combat these attacks. This paper aims to provide an understanding of the existing attack methods, tools and defense mechanisms, so that a better understanding of DDoS attacks can be achieved. The goal of the paper is to simulate an environment by extending NS2, setting attacking topology and traffic, which can be used to evaluate and compare the methods of DDoS attacks and tools. Based on the simulation and evaluation results, more efficient and effective algorithms, techniques and procedures to combat these attacks may be developed.
    Preview · Conference Paper · Jan 2009