Enhanced image encryption scheme with new mapreduce approach for big size images

Achieving a secured image encryption (IES) scheme for sensitive and confidential data communications, especially in a Hadoop environment is challenging. An accurate and secure cryptosystem for colour images requires the generation of intricate secret keys that protect the images from diverse attacks. To attain such a goal, this work proposed an improved shuffled confusion-diffusion based colour IES using a hyper-chaotic plain image. First, five different sequences of random numbers were generated. Then, two of the sequences were used to shuffle the image pixels and bits, while the remaining three were used to XOR the values of the image pixels. Performance of the developed IES was evaluated in terms of various measures such as key space size, correlation coefficient, entropy, mean squared error (MSE), peak signal to noise ratio (PSNR) and differential analysis. Values of correlation coefficient (0.000732), entropy (7.9997), PSNR (7.61), and MSE (11258) were determined to be better (against various attacks) compared to current existing techniques. The IES developed in this study was found to have outperformed other comparable cryptosystems. It is thus asserted that the developed IES can be advantageous for encrypting big data sets on parallel machines. Additionally, the developed IES was also implemented on a Hadoop environment using MapReduce to evaluate its performance against known attacks. In this process, the given image was first divided and characterized in a key-value format. Next, the Map function was invoked for every key-value pair by implementing a mapper. The Map function was used to process data splits, represented in the form of key-value pairs in parallel modes without any communication between other map processes. The Map function processed a series of key/value pairs and subsequently generated zero or more key/value pairs. Furthermore, the Map function also divided the input image into partitions before generating the secret key and XOR matrix. The secret key and XOR matrix were exploited to encrypt the image. The Reduce function merged the resultant images from the Map tasks in producing the final image. Furthermore, the value of PSNR did not exceed 7.61 when the developed IES was evaluated against known attacks for both the standard dataset and big data size images. As can be seen, the correlation coefficient value of the developed IES did not exceed 0.000732. As the handling of big data size images is different from that of standard data size images, findings of this study suggest that the developed IES could be most beneficial for big data and big size images

Greedy intersection-mode routing strategy protocol for vehicular networks

In the recent years, the development of wireless network technology has been improved and there are so many researches undergoing in Vehicular Ad hoc Network. VANET has reached the greatest attention in the world. In VANET the velocity of carriers in the vehicle is high so it is very efficient to forward data and there are so many researchers are planned to develop routing protocol. The proposed routing algorithm is used to simulate in the distributed environment. The main purposes of this routing strategy are designed and develop the sustainable routing with better efficiency and adaptability. This proposed scheme uses geographic position based routing protocol and in that position based routing we using GpsrJ+ algorithm and it is adopted by VANET technology. Due to development of countries the vehicle travel in non-ordered distribution, so we are using GPSR greedy mode to forward packets and this mode fails often and it needs recovery mode or perimeter mode. This GPSR greedy mode always fails and it is worth for forwarding packets. So the proposed enhanced GpsrJ+ mode overcomes the disadvantage of GPSR and GPCR. This proposed system gives good packet delivery ratio by simple modification of the process. This system uses greedy mode on straight roads and intersection mode on intersection and it works intelligently because it can identify the direction of node and it effectively find the shortest path of the destination to send data packets. Finally GprsJ+ does not need expensive planarization strategy and it reduces hop count effectively. The unnecessary hop count and routing overload are avoided in the enhanced proposed routing protocol