Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Mobile Ad-hoc Networks (MANETs) are a combination of various mobile nodes where these mobile nodes are communicate to each other. These mobile nodes are controlled by without any central node. Mobile ad-hoc networks have various set of applications such as- it is diverse, ranging from small, mobility, high bandwidth and highly static \& dynamic networks. A mobile ad-hoc network has some basic needs such as -- a distributed algorithm to establish a structure \& organization of a network, link scheduling between mobile nodes, and packet switching technique. Author proposed a comparison simulation work of different types of routing protocols such as Dynamic state routing(DSR), Fisheye State Routing(FSR) and Hierarchical State Routing(HSR) protocols by a network simulator (NS-2). In this paper, routing protocols (DSR, HSR \& FSR) are discussed and compared in different points such as packets delivery technique, average routing head and throughput.
2
EN
The Lossless data hiding provides the embedding of data in a host image without any loss of data. This research explain a lossless data hiding and image cryptography method based on Choas - Block to image encryption the lossless means if the marked image is considered reliable, the embedding distortion can be totally removed from marked image afterward the embedded data has been extract. This procedure uses features of the pixel difference to embed more data than other randomly partition using Block based Sharpness Index Filtering and refine with single level wavelet decomposition shifting technique to prevent image distortion problems. In this work also manages reversible data hiding based on chaotic technique. In which initially image histogram processes to perceive the pixels which is chosen for hiding each bit of secret data, then by the logistic chaotic map compute an order of hiding each bit stream. Performances differentiate with other exist lossless data hiding plan providing show the superiority of the research. In this proposed research PSNR is found nearly 5.5*103 and existing 4.8*103 at 100 embedding rate which enhance for our existing technique that simulated in MATLAB 2014Ra.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.