Vinay Rishiwal

QoS Based Power Aware Routing in MANETs

—In this paper, QoS based power aware routing protocol (Q-PAR) is proposed and evaluated that selects an energy stable QoS constrained end to end path. The selected route is energy stable and satisfies the bandwidth constraint of the application. The protocol Q-PAR is divided in to two phases. In the first route discovery phase, the bandwidth and energy constraints are built in into the DSR route discovery mechanism. In the event of an impending link failure, the second phase, a repair mechanism is invoked to search for an energy stable alternate path locally. Simulation was performed to determine the network lifetime, throughput and end to end delay experienced by packets and for other parameters. The results indicate that Q-PAR is able to discover the required path with lesser overheads, the network lifetime increased by around 24-29 % for small networks (20-50 nodes), the packet delivery ratio improved and the packet experienced a low average delay. Moreover the local repair mechanism was able to find an alternate path in most of the cases enhanced the network lifetime and delayed the repair and reconstruction of the route.

Stable and Energy Efficient Routing for Mobile Adhoc Networks

Mobile ad hoc networking is a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Although lots of research has been done on supporting QoS in the Internet and other networks, but they are not suitable for mobile Ad hoc networks and still QoS support for such networks remains an open problem. In this paper, a new scheme has been proposed for achieving QoS in terms of packet delivery, multiple connections, better power management and stable routes. It offers quick adaptation to distributed processing, dynamic linking, low processing overhead and loop freedom at all times. The proposed scheme has been incorporated using AODV protocol and by extensive simulation the performance has been studied, and it is clearly shown that the proposed scheme performs very well for different network scenarios.

Power Aware Routing to Support Real Time Traffic in Mobile Adhoc Networks

In order to facilitate communication within a mobile ad hoc network, an efficient routing protocol is required to discover routes between mobile nodes. Power is one of the most important design criteria for adhoc networks as batteries provide limited working capacity to the mobile nodes. Power failure of a mobile node not only affects the node itself but also its ability to forward packets on behalf of others and hence affects the overall network lifetime. Much research efforts have been devoted to develop energy aware routing protocols. In this paper we propose an efficient algorithm, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment. As a case study proposed algorithm has been incorporated along with the route discovery procedure of AODV and by simulation it is observed that proposed algorithmpsilas performance is better as compare to AODV in terms of packet delivery ratio and network lifetime for different network scenarios.

Robust Image Registration Technique for SAR Images

Synthetic aperture radar (SAR) images are difficult to register with other images or maps of the same area because SAR images are corrupted with image speckle. The geo-reference of the image is conventionally realized by manual identification of ground control points (GCPs) and image rectification. There are two main tasks to geo-reference the SAR images. First one is to enhance the quality of images, reducing the noise and detecting the edges of the objects in the images to mark more clear points that are used as GCPs. The GCPs do not change with time and change in climatic conditions. The edges always remain same and can not be changed for a long time. This paper investigates the procedure for geo-referencing temporal images acquired for the same region by automatic identification of GCPs on the image by template matching technique. The procedure to extract high quality edge contours from SAR images and the process of automatic image-to-image and image-to-digitized map registration of SAR images has been presented

Finding Optimal Paths on Terrain Maps using Ant Colony Algorithm

This paper presents the meta-heuristic method of ant colony optimization (ACO) to find optimal paths on terrain map images. The procedure simulates decision-making process of ant colonies as they forage for food. Modifications have been made to the ACO algorithm to solve the optimal path finding problem by optimizing multiple constraints. The number of constraints considered here is two. However, it can effectively be used for more than two constraints.

A Robust Secret Image Sharing Scheme

Secret sharing is an efficient method of transmitting the image securely. This paper discusses an efficient secret sharing scheme. It has been shown through the experimental result that the proposed scheme transmits the image secretly and then efficiently recovers the same at the receiver end. The scheme is general in nature and can be applied on any image size. The scheme comprises of the important algorithms namely share generation algorithm and combination algorithm. The share generation algorithm generates the share of secret image and the combination algorithm combines the secure parts to get the original image within a very short time with a high level of security.

Efficient Storage of Massive Biological Sequences in Compact Form

This paper introduces a novel algorithm for DNA sequence compression that makes use of a transformation and statistical properties within the transformed sequence. The designed compression algorithm is efficient and effective for DNA sequence compression. As a statistical compression method, it is able to search the pattern inside the compressed text which is useful in knowledge discovery. Experiments show that our algorithm is shown to outperform existing compressors on typical DNA sequence datasets.

QoS-Based Pure Adaptive Routing in MANETs

In this paper an efficient on demand QoS based routing protocol is developed which considers end to end application requirement and energy efficiency together with the route discovery mechanism of DSR to set up QoS route. The proposed QoS aware protocol works as per the user request for a route. If a request comes for QoS route, based on some application requirement (available bandwidth, transmission delay etc.) then it considers specifically asked application parameter and finds a QoS path among all available path between a source and a destination pair otherwise it invokes the second phase and considers an optimal energy efficient path. This protocol uses source routing to avoid channel overhead and to improve the scalability. The proposed protocol not only provides a better way to discover a QoS and energy efficient route but it considers an efficient route maintenance scheme. Route maintenance scheme has greatly enhanced the performance of the protocol in terms of network life time and packet delivery ratio. Simulation results show that the performance of the proposed protocol is better than DSR for different network scenarios.

Energy Aware On Demand Routing for MANETs

The dynamic topology of mobile ad hoc networks (MANETs) and limited battery capacity of mobile nodes entail routing schemes to consider these factors in the route discovery and maintenance. On demand protocols like AODV initially choose an optimum path but initiate a route rediscovery with the first link failure. The variants of these protocols strive to overcome the limitations of high route discovery latency and frequent route discovery overhead in the event of failures by routing on multiple paths. These schemes ameliorate the routing to some extent but result in high control overheads which is not desirable in the energy constrained environment. The present work focuses on choosing a stable path based on energy status and distance to avoid frequent route rediscovery. Local repair is done in the event of a node deletion to further extend the lifetime of a route. The scheme has been incorporated in AODV to determine the efficacy of the technique. Extensive simulation has been done to evaluate the performance of the scheme which is compared with the basic AODV and DSR protocols. Simulation results show that the scheme outperforms AODV and DSR for dense network scenarios in terms of packet delivery and end to end delay.

Automatic pothole and speed breaker detection using android system

Recent studies have shown that road surface monitoring is essential for the municipal corporations as well as for travelers for choosing the best road possible. Such schemes provide the comfort and security to the vehicle travelers. This paper presents a vibration based approach for automatic detection of potholes and speed breakers along with their co-ordinates. In this approach, a database is maintained for each road, which is made available to the public with the help of global database or through a portal. Potholes and speed breakers are detected along with their severity using androids built-in accelerometer. The results of the proposed approach are tested over a 4 km flat road and compared to manual inspection of pothole and speed breakers on the same considered road. The accuracy of the proposed approach came out to be 93.75% for detection of potholes and speed breakers. This approach is cost efficient and very effective for road surface monitoring.