Volume 09 Issue 05, Sepember 2021

A Review of Enhanced Reversible Data Hiding on Encrypted Images Using Selective Pixel Flipping Method

Sunil Kumar, Prof. Manish Rai

Page no:01-04

Abstract

Reversible data hiding on encrypted images is a vigorous area of research within the field of data security, which involves the technique of carrying knowledge during a suitable multimedia carrier for secure communication. Data hiding techniques provide secret communication and authentication but can cause a loss of the carrier. These techniques are used for copyright protection, media registration, integrity authentication. Applications like medical imagery, military and forensics degradation don't allow distortion of the original cover. So, it needs secure data hiding techniques. To overcome this disadvantage of extracting the carrier with distortion was removed by reversible data hiding methods. RDH techniques recover the first carrier exactly after the extraction of the encrypted key data. Reversible Data Hiding Techniques are classified supported the strategy of implementation. During this paper, a survey on the various techniques applicable supported difference expansion, histogram shifting and compression embedding for reversible data hiding are discussed. In this paper, they revisit the reversible data hiding scheme proposed by Xinpeng Zhang in 2011. The present scheme(selective pixel flipping method) uses a block histogram shifting process to ensure the exact image recovery at the receiver side. They also observed that the present scheme is susceptible to fail while recovering a picture block that contains highly correlated pixel values (very low smooth region). This manuscript proposes an existing scheme that can help reduce the block size without more error rate. The experimental study of the present scheme is carried on an image dataset; therefore, the results show that the proposed scheme outperforms the present scheme.

A Review on Received-Signal-Strength-Based Localization in Wireless Sensor Networks

Dheeraj Mehra, Balwant Singh Raghuvanshi

Page no:05-09

Abstract

Wireless sensor networks are energy-constrained networks. Energy consumption in these networks can be reduced by processing the raw data at individual nodes through the application of suitable aggregation technique so that there is a minimum amount of data that need to be transmitted towards the sink, and today, wireless sensor networks (WSNs) emerge as a revolution in all aspects of our life. WSNs have unique specifications of themselves that describe them different from other networks. Fault tolerance is one of the most significant challenges in these networks. Minimizing the energy consumption of a wireless sensor network application is crucial for the effective realization of the intended application in terms of cost, lifetime, and functionality. However, minimizing the task is impossible as no overall energy cost function is available for optimization. The need for energy-efficient infrastructures for sensor networks is becoming increasingly important. Wireless sensor networks consist of many sensor nodes that communicate over wireless media. A sensor node is equipped with a sensor module, a processor, a radio module and a battery. Since the battery limits the lifetime of the sensor nodes, it also limits the lifetime of the sensor network. Thus, energy efficiency is a significant issue for sensor networks. The proposed algorithm reduces error and energy saving to search out all possible nodes’ locations in WSN. Evaluation of permanence using mat lab tool estimated position error of all nodes and best solution.