Deepak Chaudhary

Performance Analysis of AODV, CBRP, AOMDV, DSR MANET Routing Protocol using NS2 Simulation

Mobile ad hoc network is a self-directed structure of mobile nodes connected by wireless links. All nodes operate not only as an end system, but also as work as a router to forward the packets. Ad hoc wireless networks are characterized by multihop wireless connectivity, infrastructure less and habitually changing topology. It may be necessary for one mobile node to schedule other hosts for forwarding a packet from source to destination node due to the constrained transmission range of wireless network interfaces. Therefore a self-motivated routing protocol is required for these networks to work properly. A number of Routing protocols have been created to achieve this task. In this paper, a comparative analysis of four reactive routing protocols namely AODV, AOMDV, DSR and CBRP is done. Here CBRP is also a hierarchical routing protocol. This paper is aimed to analyze the adequacy of considered routing protocols in an energy constrained environment under varying mobility and pause time. These protocols have been analyzed extensively for various performance parameters (energy consumption, delay, throughput, Packet Delivery Ratio etc.) over different network scenarios. Simulation results show that none of the protocol surpasses other for all considered scenarios. However, CBRP has produced better results in terms of throughput, normalized routing load and delay while AOMDV is a better choice for energy related parameters. Simulation results of the paper are very helpful for the wise selection of the energy efficient base routing approach to scale MANETs.

Comparison of Cache Page Replacement Techniques to Enhance Cache Memory Performance

Caching is a very important technique for improving the computer system performance, it employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. In modern computer architectures a page miss cause the several hundred CPU cycles [1, 15]. In a memory hierarchy, a cache performs faster than auxiliary storage, but is more expensive. Some important page replacement policies such as FIFO, LRU, RANDOM and SECOND CHANCE are used in cache memory to replace the page whenever it is needed. So page replacement policy severely affects the performance of cache memory. So here our purpose is to simulate FIFO, LRU, RANDOM and SECOND CHANCE policies and to compare the results for various applications such as bzip, swim and gcc traces (taken from SPEC2000 benchmark for simulation) etc. using MS-Excel [3, 10, 12] . General terms Computer Architecture, Operating system, cache memory, main memory and Performance evaluation of system

A Novel Approach to use ZnO Thin Film as a Switching in Dynamic Random Access Memory (DRAM) Cell

Resistance switching random access memory (RRAM) has drawn considerable attention for the application in non- volatile memory element in semiconductor memory devices. A ZnO thin film now assumed to be useful for dynamic random access memory (DRAM) cell. In this paper we provide a framework to its use as a switching ON or OFF in DRAM cell. In this type of memory cell the ZnO thin film has a lot of importance instead of a transistor. Inside the DRAM cell, we are suggested to use the ZnO thin film due to its reliable and repeated switching of the resistance. Thus after the replacement of ZnO thin film as a switching element instead of a transistor, the DRAM cell has a strong resistance switching capability.

Digital Video Watermarking Scheme using wavelets with MATLAB

With the extensive use of Internet, transfer or sharing of digital data online is enormous. This leads to easy accessibility and vulnerability to attacks of copyrighted content on large scale. Digital multimedia in the form of videos, audios, text, images or digital documents can easily be manipulated, forged and redistributed for profits. To overcome this problem and protect copyrighted content, Digital Watermarking emerged as a useful solution. The project work is based on two main viewpoints. The first viewpoint describes about the different watermarking techniques and showcases the comparative description of superiority of one technique over the other. It is seen that frequency domain is more suitable domain for watermarking schemes as it yields robust results as compared to other domains such as spatial domain.

Novel Technique for Number Plate Detection and Recognition

In this work, it is been concluded that various techniques of car number plate recognization is reviewed. The Automatic number plate recognition (ANPR) is a mass reconnaissance strategy that utilizations optical character recognition on images to peruse the license plates on vehicles. They can utilize existing shut circuit television or street principle authorization cameras, or ones particularly designed for the errand. They are utilized by different police powers and as a strategy for electronic toll gathering on pay-per-use streets and observing movement action, for example, red light adherence in a convergence. ANPR can be utilized to store the images caught by the cameras and additionally the content from the license plate, with some configurable to store a photo of the driver. Among various proposed techniques morphological scanning technique is efficient technique to scan the whole image and extract number plate portion. The second efficient technique is split-and-merge segmentation to segment whole detected number plate. The segmented number plate is recognized using the neural networks. The discussed technique provides 91 % accuracy of character reorganization.

An Efficient Algorithm based on Fibonacci Pattern Hound Packets for Detection of Wormhole Attack in DSR for Mobile Ad Hoc Networks

networks are playing very important role in the present world. Mobile Ad hoc Networks (MANET) are the extension of the wireless networks. These networks are playing crucial role in the each and every field of the human life. They are used in those places where a simple wireless network cannot use. They play a significant role in real tile applications such as military applications, home applications wireless sensor applications etc. Due to their adaptive nature they are threatened by number of attacks such as Modification, Black Hole attack, Wormhole attack etc. Wormhole attack is one of the dangerous active attacks in the mobile Ad hoc Networks (MANET). In this paper a secure and efficient approach for the detection of the wormhole attack in the Mobile Ad Hoc Networks (MANET) is described. The algorithm is implemented in a very popular on demand routing protocol, called DSR (Dynamic Source Routing) protocol. In this approach the solution is provided by sending the Hound Packet in the order of Fibonacci series and also modifies the table entries in terms of storing them in sorted order, so that the processing of Route Discovery becomes faster.

Three Novel Theorems for Applied Cryptography

advancements in computing capabilities public key cryptosystems are going to be more complex yet vulnerable over the modern days computer networks and associated security mechanism, especially those based on novel approaches of applied mathematics. This paper explores three novel theorems derived while studying and implementing RSA algorithm, one of the strongest public key cryptosystem. The proposed Theorems are best suited and adequate for RSA algorithm yet being applicable to some of other existing algorithms and theorems of applied mathematics. The first theorem deals with concept of ambiguity while calculating multiplicative inverse of encryption key which in some of instances returns undesirable negative numbers not useful as decryption key . Second theorem deals with unconcealed multiplicative inverses, unconcealed are values which remain unchanged after any mathematical transformations. Concept of unconcealed multiplicative inverses is useful in key generation for RSA cryptosystem. Third theorem deals with the concept of unconcealed exponentiation modulo quite useful in finding unconcealed signature and messages to form UM Matrix for RSA.