oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 58 )

2018 ( 332 )

2017 ( 351 )

2016 ( 569 )

Custom range...

Search Results: 1 - 10 of 305201 matches for " V.P. Arunachalam "
All listed articles are free for downloading (OA Articles)
Page 1 /305201
Display every page Item
A Comparitive Study of Various IP Traceback Strategies and Simulation of IP Traceback
S. Karthik,V.P. Arunachalam,T. Ravichandran
Asian Journal of Information Technology , 2012,
Abstract: Distributed Denial of Service (DDoS) is a rapidly growing problem. The multitude and variety of both the attacks and the defense approaches is overwhelming. IP traceback-the ability to trace IP packets from source to destination-is a significant step toward identifying and thus, stopping, attackers. The IP traceback is an important mechanism in defending against Distributed Denial of Service (DDoS) attacks. This study constructs a simulation environment via extending ns2, setting attacking topology and traffic, which can be used to evaluate and compare the effectiveness of different traceback schemes. A comparison among some of the Packet Marking schemes is presented with several metrics, including the received packet number required for reconstructing the attacking path, computation complexity and false positive etc. 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.
Performance Analysis and Comparison of Mobile Ad-Hoc Network Routing Protocols
S. Kannan,S. Karthik,V.P. Arunachalam
Research Journal of Applied Sciences , 2012, DOI: 10.3923/rjasci.2010.424.428
Abstract: Mobile Ad-hoc Networks (MANET) 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 study, we study and compare the performance of the following three routing protocols AODV, DSR and DSDV.
An Enhanced Packet Retransmission Method for Improving TCP-Aware Source Routing in Mobile Ad-Hoc Network
S. Kannan,S. Karthik,V.P. Arunachalam
Asian Journal of Information Technology , 2012, DOI: 10.3923/ajit.2011.20.25
Abstract: Mobile Ad-hoc Networks (MANET) 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. In a MANET, temporary link failures and route changes occur frequently. With the assumption that all packet losses are due to congestion, TCP performs poorly in such an environment. This study proposes a new mechanism called TASR, TCP-aware source routing which can improve TCP performance in wireless Ad-hoc networks. TASR adds a hold state to an existing routing protocol to reduce consecutive timeouts, retransmissions and out-of-ordered packets in TCP. In the simulation study, TASR achieves up to a 60% improvement in performance without requiring any TCP stacks in end systems to be modified.
A New Methodology for Handling Empty Zone Problem over Mobile Ad Hoc Network
S. Kannan,V.P. Arunachalam,S. Karthik
Journal of Engineering and Applied Sciences , 2012, DOI: 10.3923/jeasci.2012.295.299
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.
An Investigation on Performance Analysis and Comparison of Proactive and Reactive Routing Protocols in Mobile Ad-Hoc Network
S. Kannan,S. Karthik,V.P. Arunachalam
International Journal of Soft Computing , 2012, DOI: 10.3923/ijscomp.2010.194.199
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 research, we study and compare the performance of the following three routing protocols AODV, DSR and DSDV.
Reducing End to End Delay in Delay Tolerant Mobile Network Using AODV and Cluster-Based Routing Protocol
S. Kannan,V.P. Arunachalam,S. Karthik
Research Journal of Applied Sciences , 2012, DOI: 10.3923/rjasci.2012.234.239
Abstract: This research investigates distributed clustering scheme and proposes an Ad hoc On demand Distance Vector (AODV) routing protocol for Delay-Tolerant Mobile Networks (DTMNs). The basic idea is to distributively group mobile nodes with similar mobility pattern into a cluster which can then interchangeably share their resources (such as buffer space) for overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. An ad hoc network is self-organizing and adaptive. Networks are formed on the fly, devices can leave and join the network during its lifetime, devices can be mobile within the network, the network as a whole may be mobile and the network can be deformed on the fly. Devices in mobile ad hoc networks should be able to detect the presence of other devices and perform the necessary set-up to facilitate communications and the sharing of data and services. Due to the lack of continuous communications among mobile nodes and possible errors in the estimation of nodal contact probability, convergence and stability become major challenges in distributed clustering in DTMN. Extensive simulations are carried out to evaluate the end to end delay and overhead of the proposed Ad hoc On demand Distance Vector (AODV) routing protocol.
An Enhanced Mechanism for Profiling and Searching the Internet Endpoints by Clustering the Endpoints Using Fuzzy C-Means Algorithm
S. Kannan,T. Kalaikumaran,S. Karthik,V.P. Arunachalam
Journal of Engineering and Applied Sciences , 2012, DOI: 10.3923/jeasci.2011.135.140
Abstract: Understanding and using the internet in worldwide is a challenging problem that is typically addressed by analyzing network traces. However, obtaining such traces presents its own set of challenges owing to either privacy concerns or to other operational difficulties. The key hypothesis of the research here is that most of the information needed to profile, the internet endpoints is already available around us on the web. We implement and deploy a Google-based profiling tool which accurately characterizes endpoint behaviour by collecting and strategically combining information freely available on the web. Unconstrained endpoint profiling approach is used to profile and classify the endpoints. The websites are classified and clustered based on the search hits which contain the hit text and URL. On querying, it matches the domain name and URL if it does not match then it verifies the key words. The key words in the web cache are clustered using Fuzzy C-means algorithm which enhances the speed of the search engine.
A Study of Attacks, Attack Detection and Prevention Methods in Proactive and Reactive Routing Protocols
S. Kannan,T. Maragatham,S. Karthik,V.P. Arunachalam
International Business Management , 2012, DOI: 10.3923/ibm.2011.178.183
Abstract: MANET has no clear line of defense so, it is accessible to both legitimate network users and malicious attackers. In the presence of malicious nodes, one of the main challenges in MANET is to design the robust security solution that can protect MANET from various routing attacks. Different mechanisms have been proposed using various cryptographic techniques to countermeasure the routing attacks against MANET. However, these mechanisms are not suitable for MANET resource constraints, i.e., limited bandwidth and battery power because they introduce heavy traffic load to exchange and verifying keys. In this study, the current security issues in MANET are investigated. Particularly, we have examined different routing attacks such as flooding, black hole, link spoofing attacks and some detection methods like profile-based detection, specification-based detection as well as existing solutions to protect MANET protocols.
Analyzing and Improving Performance of TCP over Mobile Ad-Hoc Networks Using TCP Aware Source Routing
S. Kannan,Ishwarya,S. Karthik,V.P. Arunachalam
Journal of Mobile Communication , 2012, DOI: 10.3923/jmcomm.2010.86.90
Abstract: In a mobile ad-hoc network, temporary link failures and route changes occur frequently. With the assumption that all packet losses are due to congestion, TCP performs poorly in such an environment. This study proposes a new mechanism called TASR, TCP-aware source routing which can improve TCP performance in wireless ad-hoc networks. TASR adds a hold state to an existing routing protocol to reduce consecutive timeouts, retransmissions and out-of-ordered packets in TCP. In the simulation study, TASR achieves up to a 60% improvement in performance without requiring any TCP stacks in end systems to be modified.
Analyzing Interaction Between Denial of Service (DoS) Attacks and Threats
S. Karthik,V.P. Arunachalam,T. Ravichandran
International Journal of Soft Computing , 2012,
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.
Page 1 /305201
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.