Sharada Valiveti

Comparative study of Distributed Intrusion Detection in Ad-hoc Networks

In recent years ad hoc networks are widely used because of mobility and open architecture nature. But new technology always comes with its own set of problems. Security of ad hoc network is an area of widespread research in recent years. Some unique characteristics of ad hoc network itself are an immense dilemma in the way of security. In this paper we have presented study about characteristics of ad hoc network, how they are problematic in ad hoc network security, attacks in ad hoc network and brief description of some existing intrusion detection system. We have also justified why distributed intrusion detection is better for ad hoc network with comparative study of existing intrusion detections in ad hoc network.

Non-repudiation in Ad Hoc Networks

With the phenomenal growth of the Internet and open networks in general, security services, such as non-repudiation, become crucial to many applications. In conventional network non-repudiation is achieved using protocols involving TTP. Non-repudiation in conventional network is achieved using different protocols, but in ad hoc networks due to mobility problem we can’t use trusted third party (TTP). There is a scope to implement a non-repudiation protocol, which satisfies non-repudiation requirements emerged by the application in a peer-to-peer network.

Trust Based Routing in Ad Hoc Network

Ad Hoc network often termed as an infrastructure-less, self- organized or spontaneous network.The execution and survival of an ad-hoc network is solely dependent upon the cooperative and trusting nature of its nodes. However, this naive dependency on intermediate nodes makes the ad-hoc network vulnerable to passive and active attacks by malicious nodes and cause inflict severe damage. A number of protocols have been developed to secure ad-hoc networks using cryptographic schemes, but all rely on the presence of trust authority. Due to mobility of nodes and limitation of resources in wireless network one interesting research area in MANET is routing. This paper offers various trust models and trust based routing protocols to improve the trustworthiness of the neighborhood.Thus it helps in selecting the most secure and trustworthy route from the available ones for the data transfer.

Optimization of clustering process for WSN with hybrid harmony search and K-means algorithm

As it is the fact that sensors deployed in the field are not accessible after deployment hence lifetime of the network is directly dependent on residual energy the sensors have. Conservation and efficient utilization of energy are very crucial in a sensor network. Clustering is one of the best-accepted strategies to efficiently utilize energy. Various approaches are proposed in the literature for clustering but meta-heuristic methods present promising results. When a hybrid version of two methods is derived to use best features of both, better results are anticipated. Two methods called Harmony search and K-means gives satisfactory results independently when applied to clustering process and we have made a hybrid version of these two methods to optimize the clustering process in this paper. Simulation is done with the NS-2 simulator for the above mentioned hybrid approach.

Mobility aware routing strategy in MANET using cross layer design approach

Mobile Ad Hoc networks belong to the class of networks where every activity is an area of interest and provides scope of optimization. Here, we study the Cross Layer Design (CLD) approach in which we use the Physical layer Characteristics at Network layer. We have proposed a techinique, which would use the concept of Doppler Effect in Routing and eliminates the noisy signals received at physical layer by comparing the Signal to Interference Noise Ratio (SINR) with the Threshold Signal to Interference Noise Ratio (SINRT). As per the strategy used, the nodes which move closer to each other would be used in Routing than the nodes moving away from each other. Hence we are trying to contract the sub network involved in a particular communication.

Routing in Ad Hoc Network Using Ant Colony Optimization

The ad hoc networks have dynamic topology and are infrastructure less. So it is required to implement a new network protocol for providing efficient end to end communication based on TCP/IP structure. There is a need to re-define or modify the functions of each layer of TCP/IP model to provide end to end communication between nodes. The mobility of the nodes and the limited resources are the main reason for this change. The main challenge in ad hoc networks is routing. Due to the mobility of the nodes in the ad hoc networks, routing becomes very difficult. Ant based algorithms are suitable for routing in ad hoc networks due to its dynamic nature and adaptive behavior. There are number of routing algorithms based on the concept of ant colony optimizations. It is quite difficult to determine the best ant based algorithm for routing as these algorithms perform differently under various circumstances such as the traffic distribution and network topology. In this paper, the overview of such routing algorithms is given.

Open Issues in Named Data Networking – A Survey

Internet is now being used as content distribution network also. Internet users are interested in specific contents rather than host machines where the content is located. Named Data Networking (NDN) is a step towards future Internet architecture that would be based on named data rather than numerically identified hosts. Many projects are in progress to architect the structure of the future Internet. It is envisaged that NDN would provide functional efficiency with named content applied as the core concept. NDN offers lot of research opportunities to contribute for design of future Internet architecture. In this paper we analyze the modern Internet Protocol (IP) based host- centric architecture and explore the newer scalable and more efficient architecture, based on content-centric approach. Open research issues in various area of NDN are also addressed in the paper.

Natural Language Interface for Multilingual Database

India, a country where unity in diversity is practiced through several cultural, social, linguistic and religious adaptations in every facet of life. Here, communication between different states requires common platform or language of interpretation. Language happens to be a barrier in handling many societal issues including security of a state. The inter-state border activities reduce the efficiency of security deployments as the common goal of handling the miscreant is not available after he crosses the state border. So there is a need of natural language interface which can support different Indian languages. Any application catering to inter-state domain has a backend to process the information. Such databases use regional language to store and retrieve information. These regional languages are not user friendly for non-native users. Our goal is to design Natural Language Database Interface for the conversion of one of the Indian Languages i.e. Gujarati to English.

Parallel generation of RSA keys — A review

Being one of the most widely used asymmetric or public key cryptographic algorithms, the RSA (Rivest Shamir Adleman) algorithm does require substantial amount of study, improvement and improvisation so as to get the best possible efficiency in terms of execution time and memory utilization. While faster encryption will help in implementation in real time applications, faster decryption by active adversaries can prove to be dangerous. Hence the security aspect of RSA should not be neglected either. Less memory utilization too would help in RSA being implemented in smart-cards and portable devices. This paper explores the work published in the process of improving efficiency of RSA algorithm.

Optimization of clustering process in WSN with meta-heuristic techniques - a survey

In a wireless sensor network deployed in remote area, because of no rechargeable energy source available, the network lifetime is critically dependent on how efficiently the energy resources are used. Clustering is powerful technique to use energy efficiently. Meta-heuristic methods can be applied for clustering. In this paper, different meta-heuristic methods are analyzed such as PSO, ACO, GA, HS, SA, and its pros and cons are discussed. Also, how those cons are removed in further enhanced versions and combinations of these methods are described with its performance comparison.