Sandeep Joshi

A Review on Localization in Wireless Sensor Networks

Localization is extensively used in Wireless Sensor Networks (WSNs) to identify the current location of the sensor nodes. A WSN consist of thousands of nodes that make the installation of GPS on each sensor node expensive and moreover GPS will not provide exact localization results in an indoor environment. Manually configuring location reference on each sensor node is also not possible in the case of dense network. This gives rise to a problem where the sensor nodes must identify its current location without using any special hardware like GPS and without the help of manual configuration. Localization techniques makes the deployment of WSNs economical. Most of the localization techniques are carried out with the help of anchor node or beacon node, which knows its present location. Based on the location information provided by the anchor node or beacon node, other nodes localize themselves. In this paper we present a succinct survey on the localization techniques used in wireless sensor networks covering its problems and research gap.

Data Security for Software as a Service

Cloud computing is a BUZZ word of modern computing scenario. Cloud computing services are flexible and cost effective with resource utilization. Cloud computing have three service models SaaS (Software as a Service) PaaS (Plateform as a Service) and Iaas (Infrastructure as a Service). SaaS provide on demand application services such as email, ERP and CRM etc. Multi user can access applications and they can interact to each other at same time. All users data can be reside at same place. This flexibility of SaaS service also gives the security breaches. Loop holes of SaaS harder to find and maintain. The authors discuss here security vulnerabilities of SaaS with possible solutions. This study would be helpful to elaborate to understand data security issues and privacy solutions over SaaS.

A Review on Load Balancing of Virtual Machine Resources in Cloud Computing

An effective load balance (LB) management achieves high performance computing (HPC) and green computing. Users can run their jobs on virtual machines (VMs). Virtual machine (VM) has own resources (CPU and memory). VM migrates from host to another host during fail of VM, hot spot and high resource demand. Effective LB management is based on scheduling policy and management Strategies. In this paper it is discussed the available scheduling mechanisms, goals and strategies of load balancing techniques. The aim of this work to elaborate the key analysis of research works on LB.

Dynamic weighted virtual machine live migration mechanism to manages load balancing in cloud computing

Load Balancing is a mechanism of efficient utilization of computing resources (i.e. CPU, Memory and Network). Cloud computing is the best option to reduce CAPEX and OPEX of the organizations. High Quality of Service (QoS) and reduction the Service Level Agreement (SLA) violation depend on efficient management of Load Imbalance problem. Cloud Service efficiency depends on proper management of physical and logical resources. Researchers did lots of work on the effective load management system. Researchers used many approaches (i.e. Ant colony, Honey Bee, Genetic, Static, and Dynamic) but still need improvement. Virtual Machines (VMs) migration system plays the vital role in load management. Our focus in this research is maximizing the utilization of VMs CPU capacity. Proposed research approach is based on Dynamic Weighted Live Migration (DWLM) to manage load imbalance problem. The proposed mechanism results outcomes compared with Migration time, Scalability, Throughput and Availability factor from Equally Spread Current Execution load balancing algorithm (ESCEL) and Push Pull algorithm. This paper also focuses on others load balancing strategies and future research scope in Load management mechanism.

Ambiguity Attacks on SVD Based Watermarking Technique

Fast growing internet coupled with advancements in image processing technology, has resulted in increased incidents of image deception. Digital image watermarking is widely used as a tool to establish ownership and restore the trust in digital images. The paper presents a study of solutions as proposed by Ali and Ahn in [1] to overcome the problem of false positive detection by SVD based technique, specifically the one proposed by Agarwal et al. in [2] The solutions are tested against re-watermarking as another class of ambiguity attacks.

A New Method for Minimizing Unnecessary Handoff in 802.11

In a mobile wireless network, the unnecessary handoff is the main issue that effects the performance of the network. A handoff occurs when the Received Signal Strength (RSS) is less than the threshold RSS and the new RSS (from neighbors Access point) is more than the present RSS. Earlier the handoff decision algorithms consider RSS only which results in an increase in handoff counting or handoff rate but in a wireless communication system, the signal strength varies due to scattering, shadowing and reflection because of obstacles in the network region. This variation in RSS leads to unnecessary handoff. In this paper, a new method for handoff decision is proposed to reduce the unnecessary handoff. With simulation results or mathematical analysis 25% unnecessary handoff reduced.

Removing the Outliers of Diverse Zero-Knowledge Proof Systems using Mahalanobis Distance

The purpose behind zero-knowledge proofs are to deliver a mystification to the verifier, so that the verifier will not comprehend the information sent by the prover. Cryptography and complexity theory have gained a lot of importance because of zero-knowledge proofs. An enigmatic outset was dignified, that lead to the foundation zero-knowledge proof systems. Zero-knowledge proofs are generally used to verify a provers theorem to a verifier, in such a way that the verifier will not be able to discover any supplementary evidence other than the proof given to him. In this paper, we have reviewed different zero-knowledge argument / proof techniques. We have also reviewed the proof system implications in the presence of malicious prover and malicious verifier. We have removed the outliers of the experiment by using Mahalanobis distance. Examples associated to zero-knowledge argument systems are also given.

Resource Management Using Virtual Machine Migrations

Virtualization is a component of cloud computing. Virtualization does the key role on resource (e.g., storage, network, and compute) management and utilized the resource by isolated virtual machines (VMs). A good VMs migration system has an impact on energy efficiency policy. Good resource administration policy monitors the on-demand load management, and also manages the allocation/relocation of the VMs. The key challenges are VMs isolation and migration in heterogeneous physical servers. Threshold mechanism is effective to manage the load among VMs. Previous research shows thrashing is a good option to manage load and migrate the load among VMs during failover and high load. Linear programming (LP), static and dynamic approaches are superior to manage the load through VMs migration. This research proposes threshold-based LP approach to manage load balance and focus on dynamic resource management, load balance goals, and load management challenges.

Digital Image Forensics and Counter Anti-forensics

The use of digital images in journalism and as evidence in the court of law for crime investigation and law enforcement are some application areas where it is extremely important to ensure authenticity of the images being used. Wide availability of sophisticated image processing software has simplified image manipulation. Image forensics deals with the study of the images to reconstruct their history and detect if it has undergone some intentional or unintentional modifications. This paper presents an introductory overview of the digital image forensics and its counterpart aiming to help the beginners understand their alliance so as to develop robust forensic tools against intentional and unintentional attacks on the multimedia. A brief look into counter anti-forensics is also presented in this paper.

Secured MPR node selection in the presence of cheating nodes

In MANETs, exchange of data is carried out with the help neighbouring nodes, and the destination node is identified with the broadcasting schemes. Broadcasting schemes are considered to increase the efficiency, and MPR broadcasting scheme is considered because of its reduced overhead. The message is broadcasted only to the selected MPR nodes, thus reducing flooding in the network. Nodes that are selected to act as the MPR nodes can be any neighbouring nodes, and there are no significant conditions that prove the MPR nodes integrity. In this paper, we have proposed a novel approach in selecting the MPR nodes by adding an additional security feature before MPR node selection. Our security feature does not add any additional communicational overhead or data exchanges. We were also able to reduce the localisation error by using Mahalanobis distance and maximum-likelihood. Localisation techniques were used during simulation to verify the time constraints and efficiency.