高密度聚乙烯/石墨半导体复合物的压阻特性

研究了聚乙烯/石墨半导体复合物(HDPE/GP) 在轴向压力下的压阻特性。结果表明, 这种复合物的导电性有较显著的压力依赖性。在低压力范围内电阻随压力增加而降低, 在较高压力下则随压力增大而升高, 呈现出所谓的“电阻负压力系数(N PCR ) ”和“正压力系数(PPCR ) ”效应。电阻的压力依赖性, 以及在恒压力作用下表现出来的“电阻蠕变”行为, 被认为与导电粒子网络在应力作用下的破坏与重组有关。      

Secure image transmission through crypto‐OFDM system using Rubik's cube algorithm over an AWGN channel

Confidentiality of information must be maintained when it is required to be transmitted over a communication channel or when it is stored in a computer for further information access. Establishing a highly reliable and secure means of wireless communication for the transfer of digital data (text, images, audio, and video) from source to destination is becoming a prime requirement in present‐day wireless communications. Security can be achieved at the network level as well as at the data level. Data‐level security is made through cryptographic techniques. This paper emphasizes data‐level security aspects in a wireless communication system for the secure transmission of images over an AWGN channel condition. Here, a crypto orthogonal frequency division multiplexing system (crypto‐OFDM system) is designed using Rubik's cube encryption algorithm scheme for secured transmission of images under the MATLAB environment. The quality of the image transmission is analyzed using peak signal to noise ratio (PSNR) and BER at different SNR conditions. The quality of the encryption algorithm was also tested with statistical metrics, which are the histogram, NPCR, UACI, entropy, correlation coefficient analysis, etc. The numerical results reveal that a DCT‐based crypto‐OFDM system with Rubik's cube algorithm show a better performance over earlier cryptosystems and also perform superior to the original/basic OFDM system. The statistical analysis tests prove that Rubik's cube algorithm is one of the most robust algorithms for security point of view and is easy to implement, as Rubik's cube algorithm makes use of natural characteristics of pixel values, which form the basis for designing the secret key .     

An efficient and secure partial image encryption for wireless multimedia sensor networks using discrete wavelet transform,chaotic maps and substitution box

Wireless Sensor Networks (WSN) is widely deployed in monitoring of some physical activity and/or environmental conditions. Data gathered from WSN is transmitted via network to a central location for further processing. Numerous applications of WSN can be found in smart homes, intelligent buildings, health care, energy efficient smart grids and industrial control systems. In recent years, computer scientists has focused towards findings more applications of WSN in multimedia technologies, i.e. audio, video and digital images. Due to bulky nature of multimedia data, WSN process a large volume of multimedia data which significantly increases computational complexity and hence reduces battery time. With respect to battery life constraints, image compression in addition with secure transmission over a wide ranged sensor network is an emerging and challenging task in Wireless Multimedia Sensor Networks. Due to the open nature of the Internet, transmission of data must be secure through a process known as encryption. As a result, there is an intensive demand for such schemes that is energy efficient as well as highly secure since decades. In this paper, discrete wavelet-based partial image encryption scheme using hashing algorithm, chaotic maps and Hussain’s S-Box is reported. The plaintext image is compressed via discrete wavelet transform and then the image is shuffled column-wise and row wise-wise via Piece-wise Linear Chaotic Map (PWLCM) and Nonlinear Chaotic Algorithm, respectively. To get higher security, initial conditions for PWLCM are made dependent on hash function. The permuted image is bitwise XORed with random matrix generated from Intertwining Logistic map. To enhance the security further, final ciphertext is obtained after substituting all elements with Hussain’s substitution box. Experimental and statistical results confirm the strength of the anticipated scheme.