Geetam Singh Tomar

Audio Steganography Using GA

Audio Steganography is a method that ensures secured data transfer between parties normally in internet community. In this paper, we present a novel, principled approach to resolve the remained problems of substitution technique of Audio Steganography. We use most powerful encryption algorithm (RSA) to encrypt message in the first level of security, which is very complex to break. In the second level, we use a more powerful GA (Genetic Algorithm) based LSB (Least Significant Bit) Algorithm to encode the encrypted message into audio data. Here encrypted message bits are embedded into random and higher LSB layers, resulting in increased robustness against noise addition. On the other hand, GA operators are used to reduce the distortion.

Wireless Sensor Networks and Its Routing Protocols: A Comparative Study

Wireless sensor networks with hundreds to thousands of sensor nodes can collect information from an un attendant environment and transmit the collected information to a specific user depending on user end application. These sensor nodes have some constraints due to limited energy, storage capacity and computing power. Data sre routed from one node to another using different routing protocols. There are a number of routing protocols for wireless sensor network. In this review article, we discuss the architecture of the wireless sensor network. Further, we categorize the routing protocols according to some factors and summarize on their mode of operation. At the end, we put up a comparative study on these protocols.

Intercluster Ant Colony Optimization Algorithm for Wireless Sensor Network in Dense Environment

Wireless sensor networks have grown rapidly with the innovation in Information Technology. Sensor nodes are distributed and deployed over the area for gathering requisite information. Sensor nodes possess a negative characteristic of limited energy which pulls back the network from exploiting its peak capabilities. Hence, it is necessary to gather and transfer the information in an optimized way which reduces the energy dissipation. Ant Colony Optimization (ACO) is being widely used in optimizing the network routing protocols. Ant Based Routing can play a significant role in the enhancement of network life time. In this paper, Intercluster Ant Colony Optimization algorithm (IC-ACO) has been proposed that relies upon ACO algorithm for routing of data packets in the network and an attempt has been made to minimize the efforts wasted in transferring the redundant data sent by the sensors which lie in the close proximity of each other in a densely deployed network. The IC-ACO algorithm was studied by simulation for various network scenarios. The results depict the lead of IC-ACO as compared to LEACH protocol by indicating higher energy efficiency, prolonged network lifetime, enhanced stability period, and the elevated amount of data packets in a densely deployed wireless sensor network.

Performance Comparision of AODV, DSR and DSDV under Various Network Conditions: A Survey

Mobile Ad-hoc networks are characterized by constant topology changes, in the absence of fixed infrastructure and lack of any centralized control. Traditional routing algorithms prove to be inefficient in such a changing environment. Ad-hoc routing protocols such as Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks. Extensive research has been done in comparing the different proposed ad-hoc routing protocols under varying network scenarios. Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons. In this survey paper we had analyzed the performance of the routing algorithms under various networks conditions.

Load Balanced Congestion Adaptive Routing for Mobile Ad Hoc Networks

In mobile ad hoc networks the congestion is a major issue, which affects the overall performance of the networks. The load balancing in the network alongside the congestion is another major problem in mobile ad hoc network (MANET) routing due to difference in link cost of the route. Most of the existing routing protocols provide solutions to load balancing or congestion adaptivity separately. In this paper, a congestion adaptive routing along with load balancing, that is, load balanced congestion adaptive routing (LBCAR), has been proposed. Transferring of load from congested nodes to less busy nodes and involvement of other nodes in transmission that can take part in route can improve the overall network life. In the proposed protocol two metrics, traffic load density and link cost associated with a routing path, have been used to determine the congestion status. The route with low traffic load density and maximum life time is selected for packet transmission using this protocol. Performance of the network using LBCAR has been analyzed and compared with congestion adaptive routing protocol (CRP) for packet delivery ratio, average end-to-end delay, and normalized routing overhead.

Performance Comparision of LEACH, SEP and DEEC Protocol in Wireless Sensor Network

Wireless Sensor Network is the network of power-limited sensing devices called sensors. Wireless sensor network is differ from other networks in terms of optimization of amount of energy because when these sensors sense and transmit data to other sensors present in the network, considerable amount of energy is dissipated. Various routing algorithms are proposed to limit the powers used by the wireless sensors. Hierarchical routing protocols with the concept of clustering like LEACH and SEP and DEEC are already best known for maintaining energy efficiency. In this paper, we will compare these three protocols in terms of packet transmission, energy dissipation and number of nodes alive and stability period and we will discuss the advantage and disadvantage of these protocols under various conditions. KeywordsWireless Sensor Networks, Stability period, LEACH protocol, SEP protocol, DEEC protocol

Multiple Energy Detection vs Cyclostationary Feature Detection Spectrum Sensing Technique

Cognitive Radio Networks (CRN) is a future based wireless communication technology which resolves spectrum scarcity problems in an efficient ways. In this paper, we present the comparative analysis between proposed multiple energy detectors (MED) and cyclostationary feature detector based spectrum sensing techniques. Proposed MED is using adaptive double-threshold (ADT) scheme for spectrum sensing. Numerical results show that MED outperforms cyclostationary feature detection by 36.1 % at - 8 dB signal to noise ratio (SNR) in terms of probability of detection alarm (Pd).

Hardware Implementation of Pulse Code Modulation Speech Compression Algorithm

Voice-over Internet Protocol (VoIP) telephony is increasingly becoming a variant telecommunication technology that one day may surpass the old analog and digital telephone systems. The Quality-of-Service (QoS) factor is an important parameter to be considered when measuring the performance of a VoIP system. Many factors may influence the QoS of a given VoIP system. Some of these factors are delay, jitter and packet loss. This paper served to demonstrate that the algorithmic delay (latency) of the Pulse Code Modulation (PCM) speech compression algorithm which has originally been implemented in software can be significantly reduced by implementation in hardware. The PCM speech compression algorithm is first implemented, verified to demonstrate equivalence and then validated by comparing the latency of the hardware-implemented speech compression algorithm with that of an existing software implementation.

Performance Study between Two-Stage Detectors and Estimated SNR Based Detector in Cognitive Radio Networks

In this paper, we present a performance study between two-stage detectors and propose estimated signal to noise ratio (SNR) based detector. The propose sensing technique consists two detectors, energy detector (ED) & ED with ADT detector, out of these two detectors only one will perform sensing operation at a time. Selection of detector depends on condition between estimated SNR value (Se) and threshold (γ). Numerical results show that proposed ESNR ADT scheme outperforms the cyclostationary based sensing method by 30.5 % at -10 dB signal to noise ratio (SNR). It is also shown that the proposed scheme has lesser sensing time than cyclostationary detection in the order of 5.2 ms at -20 dB SNR.

Linear Prediction Analysis and Quantization for the Conjugate-Structure Algebraic-Code-Excited Linear-Prediction Speech Compression Algorithm

Voice-over Internet Protocol (VoIP) telephony which is the transmission of real-time voice over an Internet Protocol (IP) data network, is increasingly becoming a variant telecommunication technology that one day may surpass the old analog and digital telephone systems. The Quality-of-Service (QoS) factor is an important parameter to be considered when measuring the performance of a VoIP system. Algorithmic delay (latency) may influence the QoS of a VoIP system. This paper presents the hardware implementation of the Linear Prediction (LP) Analysis and Quantization component of the Conjugate-Structure Algebraic-Code-Excited Linear-Prediction (CS-ACELP) speech compression algorithms. The LP Analysis and Quantization units were implemented in hardware using Xilinx 11.1 ISE, after which ITU-T test vectors were used to determine whether they were equivalent implementations of the LP Analysis and Quantization. The algorithmic delays of hardware-implementations were obtained via simulation using Modelsim XE 6.4b while the algorithmic delays of the software-implemented speech compression algorithms were obtained by software profiling using the GPROF profiler. After comparison the algorithmic delays of the hardware-implementations of the LP Analysis and Quantization was found to be shorter than the algorithmic delays of their software-implemented and hardware-implemented counterparts.