Showing papers by "Mayank Dave published in 2008"

Implementing a Speech Recognition System Interface for Indian Languages

Abstract: Human computer interaction through Natural Language Conversational Interfaces plays a very important role in improving the usage of computers for the common man. It is the need of time to bring human computer interaction as close to human-human interaction as possible. There are two main challenges that are to be faced in implementing such an interface that enables interaction in a way similar to human-human interaction. These are Speech to Text conversion i.e. Speech Recognition & Text To Speech (TTS) conversion. In this paper the implementation of one issue Speech Recognition for Indian Languages is presented.

DNA cryptography: a novel paradigm for secure routing in Mobile Ad hoc Networks (MANETs)

Abstract: Ad hoc networks do not necessarily rely on fixed infrastructure for the communication amongst its various nodes and this poses new challenges for the necessary architecture they apply. In addition, ad hoc networks are often designed for specific environments and may have to operate with full availability in difficult situations making them vulnerable as compared to traditional networks. In this paper, we propose a novel secure ad hoc routing protocol that uses pseudo DNA cryptography. The presented work deals with the assumptions, length analysis and evaluation of pseudo DNA algorithm, which can be implemented for securing Ad hoc Networks.

Ant colony based rule generation for reusable software component retrieval

Abstract: Storage and representation of reusable software components in software repositories to facilitate convenient identification and retrieval has been always a concern for software reuse researchers. This paper discusses and demonstrated an ant colony algorithm based technique that generates rules to store and then identify the component from software repository for possible reuse. Proposed technique helps user in organization and storage of components in repository and later can help in identifying most appropriate component for given context. In first stage while searching it makes use of keywords, their synonyms and their inter-relationships. Then it makes use of ant colony optimization; initial pheromone of one is assigned to all domain representative terms of components. By updating pheromone for participating terms and non-participating terms iteratively and by calculating the quality of each rule generated, it leads to quality rules to represent and retrieve the reusable components

Real Time Approach for Data Placement in Wireless Sensor Networks

Abstract: The issue of real-time and reliable report delivery is extremely important for taking effective decision in a real world mission critical Wireless Sensor Network (WSN) based application. The sensor data behaves differently in many ways from the data in traditional databases. WSNs need a mechanism to register, process queries, and disseminate data. In this paper we propose an architectural framework for data placement and management. We propose a reliable and real time approach for data placement and achieving data integrity using self organized sensor clusters. Instead of storing information in individual cluster heads as suggested in some protocols, in our architecture we suggest storing of information of all clusters within a cell in the corresponding base station. For data dissemination and action in the wireless sensor network we propose to use Action and Relay Stations (ARS). To reduce average energy dissipation of sensor nodes, the data is sent to the nearest ARS rather than base station. We have designed our architecture in such a way so as to achieve greater energy savings, enhanced availability and reliability. Keywords—Cluster Head (CH), Data Reliability, Real Time Communication, Wireless Sensor Networks (WSN).

Weighted load balanced routing protocol for MANET

Abstract: AODV is a prominent routing protocol for MANET that uses hop count as a path selection metric. However, AODV has no means to convey traffic load on current route. In this paper we propose a weight-based load balanced routing (WLBR) protocol for MANETs. The routing strategy projected in this paper focuses on distributing the traffic on the routes consisting of nodes with comparatively longer life and have less traffic to pass through. In this paper we also introduce a new metric, Aggregate Interface Queue Length (AIQL), to deal with traffic issue. The weight of a route is decided by three factors: the aggregate interface queue length, the route energy and the hop count. The route with highest weight value is selected for further data transmission. Performance evaluation through simulation shows that the proposed protocol (WLBR) performs better than AODV protocol.

Design and Development of a Reusable Software Components Repository

Abstract: ...................................................................................... ii Acknowledgements ......................................................................... iv