Loading...
![Thumbnail Image](assets/images/Collection.png)
Theses
Browse
19 results
Search Results
ThesisItem Open Access An energy efficient mechanism for data collection in wireless sensor network(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2013-07) Tayal, Pranavi; Mandoria, H.L.A sensor network is composed of vast number of tiny sensor in a limited area. Each sensor is defined with some energy parameters and the energy based constraints. According to these constraints, as the communication is performed, each participating node loses some amount of energy. Multicast and Broadcast communication are the basic communication requirements of a sensor network. But such kind of communication increases the network traffic extensively as well as gives large amount of energy loss. Data collection provides the solution to this problem by combining the multiple communications in single communication path. Data collection is one of the major communication approach in which multiple sources are sending data to single sink. In this present work, an agent based approach is defined to generate the effective aggregative path so that the network life and communication will be improved. The presented approach is divided in two main stages and both stages are controlled by multiple agents distributed over the network. In the very first stage, the agent will perform the analysis over the network and assign the weightage to each node based under the different parameters. Once the weights are assigned to each node the next work of agent is to generate the aggregative path. This path generation is based on multiple parameters. The parameters considered in this work to generate the effective path are loss rate, response time and the communication delay. The presented research work is about to generate an effective communication path so that the effective communication will be performed. The path generation process is divided in two main stages, first phase is to identify frequency (load) of each node and second to generate path so that load balancing will be improved. Most frequent node here represents the heavy load node over the network. The next work is to calculate the path from source to destination by comparing loads of neighboring nodes and here the current node select that neighbor node which is having low load among list of neighboring nodes and then perform the communication over that node. The presented work is implemented in NS2 environment and obtained results shows that the presented work has improved the network throughput extensively and reduced the network delay and the data loss.ThesisItem Open Access An additive noise suppression in noisy signal using spectral subtraction(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2017-07) Malik, Medha; Negi, Chetan SinghThesisItem Open Access Fetching of texture from image using enhanced morphological component analysis(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2017-08) Giri, Kapil; Pandey, Binay KumarThe Morphological Component Analysis (MCA) is a method which allows us to separate features contained in an image when these features present different morphological aspects. MCA can be used for image inpainting and image separation task. MCA can be very useful for decomposing images into texture and piecewise smooth (cartoon) parts. MCA followed by TV regularization scheme described by J-L Starck, M.Elad, D. L. Donoho is a very efficient method for separating image into its piecewise smooth content and its texture. Due to the use of curvelet dictionary in MCA piecewise smooth content part suffers from ringing artifact . TV regularization scheme was used to remove ringing artifact from the piecewise smooth part. In this work we aim at improving the MCA algorithm so that it can separate the piece wise smooth part and texture part more efficiently. The TV regularization scheme is approximated with Daubechies wavelet. Daubechies wavelet transform is applied over the cartoon part of the image then soft thresholding of the coefficient is done and then again the image is reconstructed by taking inverse Daubechies wavelet transform. Simulation result has shown that proposed method is giving better performance than the previous method in terms of various qualities metric such as Peak Signal to Noise Ratio (PSNR), Structural Similarity (SSIM).ThesisItem Open Access Analysis of fraudulent in graph database for identification and prevention(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2017-08) Rawat, Deepak Singh; Singh, Rajesh ShyamBecause of the amazing addition of extortion which results in incredible loss of billions of cash far and wide consistently, a couple of current systems in perceiving distortion are reliably made and associated with various business fields. Extortion revelation incorporates watching the direction of customers with a particular ultimate objective to assess, distinguish, or counteract undesirable lead. Undesirable direct is a wide term including wrongdoing, deception, intrusion, and record defaulting. This examination displays a graph-based technique executed with graph database itself used protection from fraudulent. The purpose of this investigation is to perceive and maintain a strategic distance from deception if there ought to be an event of on the web and disconnected keeping money from the net transaction with a record using graph database. Meanwhile, we have endeavored to ensure that real exchanges are not dismissed by adjusting them to past example of fraudulent. These case studies are also providing information by matching pattern of fraudulent case with database entry. Banks are looking to minimize big data through misrepresentation identification and prevention frameworks. A wide range of cutting edge fraud innovations are being connected to fraudulent Internet banking transactions recognition and protection. In any case, they have no successful identification instrument to distinguish honest to goodness clients and follow their unlawful exercises. We consider a prototype to vanquish each one of these difficulties using the graph database.ThesisItem Open Access Analysis of scheduling algorithms in cloud computing(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2017-08) Yadav, Ashwani Kumar; Mandoria, H.L.Cloud computing is a rapidly growing paradigm, which has gained tremendous interest in researchers at the industrial level and at the academic level. As a result, many researchers have been enthusiastically involved in research projects related to cloud computing. Researcher's major challenge in cloud computing is to provide a solution to the scheduling problem. We have analyzed various scheduling algorithms for user’s performance criteria. We have proposed an enhanced conductance based scheduling algorithm, which has been implemented to bind the cloudlets on cloud resources minimizing the overall execution time and resource utilization and to increase system’s QoS. The purpose of our proposed research is to analyze the scheduling algorithm in cloud computing, keeping in view VM’s MIPS and length of tasks. Using the CloudSim simulation toolkit, we have evaluated the performance of existing algorithms like FCFS. We have analyzed scheduling algorithms for the time shared environment in cloudlet provisioning policies. The results of our simulation proved the efficiency of the new proposed approach in reducing the overall execution time and in the makespan. With our extensive study of cloudsim library we have analyzed these algorithms by extending the datacenter broker class of CloudSim.ThesisItem Open Access Fast retrieval of images in secured content based image retrieval system(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2017-07) Pareek, Shreela; Mandoria, H.L.Content Based Image Retrieval is referred to a technique for retrieving images from database similar to query image. Retrieval is based on automated matching of features of query image with that of image database through some similarity evaluation. Due to the increment in advancement of technologies data has been increased to huge amount, hence securing these data is an important concern and to retrieve data from these large dataset in less amount of time is one of the challenging task for Content Based Image Retrieval System. Here we have implemented a method of image retrieval to overcome these challenges. Thus this research work focuses on analyzing the performance of CBIR based on GPU and using Daubechies Wavelet Transform and Arnold’s Cat Map. Analysis is performed in four phases, first phase compares different image feature descriptors. Second phase compares some members of Wavelet Family, then in third phase comparison of CBIR process using GPU CUDA and without using GPU CUDA is performed, final phase compares and analyze the performance of CBIR after applying GPU CUDA, Daubechies Wavelet-db35 for feature extraction and securing images using Arnold’s Cat Map algorithm. Results are evaluated based on the performance matrices i.e precision and recall and time consumed to retrieve images, encryption algorithm is tested on the basis on PSNR and MSE. This research work has been simulated in MATLAB.ThesisItem Open Access Simulation of color and textural based method for image encryption in image processing(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2017-07) Singh, Samridhi; Mandoria, H.L.These days secured data storage and transmission have become an important issue in this digital world due to the increased use of Internet for communication purpose. Information security is becoming more importance as the amount of sensitive data being exchanged on the Internet increases. The service like confidentiality and data integrity are required to protect data against unauthorized usage and modification. In these years several image encryption methods are introduced by various researchers to secure multimedia information while transmit via public networks. A novel Image encryption method based on color and textural feature is suggested in this research work. In color feature image is divided into RGB component and each component is encrypted by shuffling pixels and this shuffling is decided by three different keys to encrypt each component. To transmit data whole image is divided into blocks then confusion and diffusion means shuffling of pixels according to the pattern and pattern is decided on the basis of key which is generated after extracting feature of the image through GLCM and feature is selected through PCA in texture feature. The results confirm that the proposed method resists the statistical analysis. Also attains acceptable entropy value and has a robust performance against attacks. The simulation of the above algorithm is done on Matlab.ThesisItem Open Access Study and analyze detection and isolation of Sybil attack in vehicular Ad-Hoc network(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2017-07) Chauhan, Prachi; Mandoria, H.L.Vehicular ad-hoc network (VANET) have been impartially a hot research area over the recent years. Due to increase in vehicle crashes and fatalities, Vanet fascinate so much attention of both academia and industry. Vehicular ad-hoc networks (VANETs) are the dynamic subcategory of mobile ad-hoc network (MANET) in which mobile node presents set of smart vehicles on road. The vehicular ad-hoc network is the self-configuration and decentralized type of network with no central controller. In the recent times, various techniques have been examined for the detection of malicious nodes in the network. Path establishment from source to destination is the major issue in the network due to the high mobility of vehicle nodes and many security prevailing in Vanet for both safety and navigational purposes of vehicles on the road. The proposed technique is signal strength and monitor mode based technique. The simulation has been performed on Network Simulator version2 (NS2). The comparison between existing and proposed technique have been done with the help of several parameters such as throughput, end to end delay, packet loss and routing overhead. The results display that the preferred technique demonstrated expressive results as compare to existing technique.ThesisItem Open Access Evaluation and implementation of RSA and Diffie-Hellman algorithm for image watermarking(G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand), 2017-07) Hemani; Mandoria, H.L.Image Watermarking always plays a vital role as far as security of copyright protection is concern. It's getting popularity because of its trending application and tremendous benefits to the society. High level of embedding capacity is a must for image watermarking. And creating a secure channel is just sound like conceptual thing. This thesis is basically divided into three major parts firstly, we will generated a watermarked image using DCT-DWT-SVD technique, at next stage we will encrypt the watermarked image using the public key of Diffie-Hellman and RSA algorithm and at last but not the least we will decrypt the watermarked image using secret key of Diffie-Hellman and RSA algorithm and then, extract the watermark using the inverse procedure. Using the hybrid method in proposed scheme gives the advantage of its robustness against most common attacks. Experimental results and analysis show higher performance in comparison with RSA Algorithm. We have used MATLAB tools for our execution part.
- «
- 1 (current)
- 2
- 3
- »