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 T. Kalaikumaran
Total Records ( 4 ) for T. Kalaikumaran
  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. 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 , 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 , 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.
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility