No abstract

Researchers have put forward many variations of schemes for secret image sharing on grounds of visual cryptography and polynomials. The authors of this paper put forward a novel scheme for sharing multiple secret images with perfect reconstruction and authentication for cheating prevention. The perfect reconstruction of all shared secret images is obtained by applying polynomial-based encryption and decryption, and one-time authentication is done for all shared secret images by stacking the intelligible shares created by using extended visual cryptography. Properties' analysis, experimental results and comparisons are given to exhibit the potency of the scheme. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

Secret sharing is an efficient method of transmitting the image securely. This paper discusses an efficient secret sharing scheme for multiple secret images. It has been shown through the experimental result that the proposed scheme transmits the images secretly and then efficiently recovers the same at the receiver end. This scheme is general in nature and can be applied on any image size. The scheme comprises of the important algorithms namely share generation algorithm and combination algorithm. The share generation algorithm generates the shares of secret multiple images and the combination algorithm combines the specified shares to get the secret images within a very short time and provide high level of security.

No abstract

Heterogeneous Mobile Ad-hoc Networks (H-MANET) contain different configuration nodes, each of which communicates over a wireless channel and is capable of movement. Heterogeneous wireless networking has attracted lot of interest from consumers in the previous few years for its applications in mobile and personal communications. One of the main constraints in MANET is the high probability of failure due to energy-exhausted nodes. So if the path selected for communication has low battery life then the path breaks prematurely and the re-discovery phase starts, which costs more overhead in the network. Therefore, there is unequal consumption of node energy, which must be prevented. The energy expenditure of the nodes should be balanced in order to minimize path breakage. This can be done by finding the communication path that is the most energy-efficient among alternative disjoint paths. This approach reduces path breakage and routing overhead caused by nodes with low battery life dying in the communication path, thus increasing the network's lifetime.