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.P. Arunachalam
Total Records ( 15 ) for V.P. Arunachalam
  S. Kannan , S. Karthik and V.P. Arunachalam
  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.
  R. Bharathiraja , S. Karthik and V.P. Arunachalam
  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.
  S. Kannan , T. Maragatham , S. Karthik and V.P. Arunachalam
  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.
  S. Kannan , S. Karthik and V.P. Arunachalam
  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.
  S. Kannan , T. Kalaikumaran , S. Karthik and V.P. Arunachalam
  A mobile ad-hoc network is a self configuring network connected by wireless links. No infrastructure or central administration is needed for these type of networks. Therefore, they are suitable only for temporary communication links. An important issue in computer network is to design the network in such a way to cope up with the speed required today. The task of routing the packets from a source to the particular destination in ad-hoc networks is hard because the network elements are mobile and there is no central control over the network elements. In any network, the data packets have to be routed to the destination with minimum loss, minimum delay and maximum packet delivery ratio. Therefore, there must be an efficient routing algorithm which satisfies all these quality of service requirements and it must also be robust and adaptive. The algorithm Multi Agent Ant Based Routing Algorithm is designed from the ACO framework, inspired by the behavior of biological ants. The algorithm consists of both reactive and proactive components. This technique increases node connectivity and decreases average end to end delay and increase packet delivery ratio. Since node connectivity increases, packet loss is reduced. The simulations are carried out by NS-2 and the results prove that Multi Agent Ant Based Routing Algorithm outperforms AntHocNet, AODV and DSR in terms of average end to end delay and packet delivery ratio.
  S. Karthik , V.P. Arunachalam and T. Ravichandran
  Problem Statement: Denial of Service/Distributed Denial of Service (DoS/DDoS) attacks deny regular, internet services from being accessed by legitimate users, either by blocking the services completely, or by disturbing it completely, so as to cause customer baulking. Approach: Several traceback schemes were available to mitigate these attacks. Directional geographical traceback8 (DGT8), directional geographical trackback scheme, with 8 directions was one of them. Having a limited set of 8 directions, DGT8 may not work for routers with more than 8 interfaces. In this study, we had proposed Multi-DGT (DGT-16), a 16 directional geographical traceback scheme having all the advantages of DGT. The 16 directions, though not having exactly equal interface, had nearly equal measures and were identified using a novel scheme of Segment Direction Ratios (SDR). Results: The scheme of DGT16 SDR in directions D1-D16 in quadrant I-IV and DGT32 SDR in directions D1-D9 in quadrant I were examined. Conclusion: The implementation of DGT16, when a packet arrives at the victim, the geographical location of the attack router can be obtained from the data in the SDR subfields, regardless of the source IP address which may be incorrect or compromised.
  S. Karthik , S. Kannan , V.P. Arunachalam , T. Ravichandran and M.L. Valarmathi
  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.
  S. Kannan , T. Kalaikumaran , S. Karthik and V.P. Arunachalam
  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.
  S. Kannan , V.P. Arunachalam and S. Karthik
  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.
  S. Kannan , Ishwarya , S. Karthik and V.P. Arunachalam
  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.
  S. Kannan , T. Kalaikumaran , S. Karthik and V.P. Arunachalam
  Routing problems in mobile ad-hoc networks have been receiving attention in the last few years. Most of the proposed routing protocols concentrate on finding and maintaining routes in the face of changing topology caused by mobility or other environmental changes. The power aware routing protocols and the topology control algorithms have been developed to address the issue of limited energy reserve of the nodes in ad-hoc networks. In this study, an algorithm has been designed and it has been enhanced with the AODV protocol for transmitting high density data over the ad-hoc network. This enhanced protocol is named as EL-AODV protocol. Enabling the high density data over, ad-hoc networks is more exigent as the links are highly error-prone and go down frequently. The challenge in data transmission over ad-hoc networks is due to the nomadic nature of the host and identifying a dynamic routing protocol that efficiently finds a stable route between mobile nodes. The simulation results show that the pro-posed scheme shows better performance when compared with existing protocol.
  S. Kannan , V.P. Arunachalam and S. Karthik
  In the context of wireless sensor networks, nodes have limited energy and forward messages of different importance. An algorithmic technique called band-based directional broadcast is used to control the direction of broadcasts that originate from the sensor nodes. A key challenge is how to gather the sensor data in a manner that is energy efficient with respect to the sensor nodes that serve as sources of the sensor data. In the research, an optimal selective forwarding scheme is introduced in order to save energy in wireless sensor networks. The goal is to direct each broadcast of sensor data toward the mobile sink, thus reducing costly forwarding of sensor data packets. The technique is studied by simulations that consider energy consumption and data deliverability.
  S. Kannan , T. Kalaikumaran , S. Karthik and V.P. Arunachalam
  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, the researchers 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.
  S. Kannan , S. Karthik and V.P. Arunachalam
  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.
  S. Kannan , V.P. Arunachalam and S. Karthik
  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.
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility