Wireless sensor network (WSN) security is an important component for protecting data from an attacker. For improving security, cryptography technologies are divided into two kinds: symmetric and asymmetric. Therefore, the implementation of protocols for generating a secret key takes a long time in comparison to the sensor’s limitations, which decrease network throughput because they are based on an asymmetric method. The asymmetric algorithms are complex and decrease network throughput. In this paper, an encryption symmetric secret key in wireless sensor networks (WSN) is proposed. In this work, 24 experiments are proposed, which are encryption using the AES algorithm in the cases of 1 key, 10 keys, 25 keys, and 50 keys. In each experiment, two chains are combined by using a hash function (SHA-2) to produce secret keys. The Network Simulator Version 2 (NS2) was used to assess the network throughput for the generated key. The randomness of the suggested LWM method has been tested by using the Diehard statistical test and the Entropy test. The results of the tests show that the encryption secret keys have a high level of data randomness.
Wireless Sensor Networks (WSNs) are promoting the spread of the Internet for devices in all areas of
life, which makes it is a promising technology in the future. In the coming days, as attack technologies become
more improved, security will have an important role in WSN. Currently, quantum computers pose a significant
risk to current encryption technologies that work in tandem with intrusion detection systems because it is
difficult to implement quantum properties on sensors due to the resource limitations. In this paper, quantum
computing is used to develop a future-proof, robust, lightweight and resource-conscious approach to sensor
networks. Great emphasis is placed on the concepts of using the BB8
In every system of security, to keep important data confidential, we need a high degree of protection. Steganography can be defined as a way of sending confidential texts through a secure medium of communications as well as protecting the information during the process of transmission. Steganography is a technology that is used to protect users' security and privacy. Communication is majorly achieved using a network through SMS, e-mail, and so on. The presented work suggested a technology of text hiding for protecting secret texts with Unicode characters. The similarities of glyphs provided invisibility and increased the hiding capacity. In conclusion, the proposed method succeeded in securing confidential data and achieving high p
... Show MoreThis work presents a symmetric cryptography coupled with Chaotic NN , the encryption algorithm process the data as a blocks and it consists of multilevel( coding of character, generates array of keys (weights),coding of text and chaotic NN ) , also the decryption process consists of multilevel (generates array of keys (weights),chaotic NN, decoding of text and decoding of character).Chaotic neural network is used as a part of the proposed system with modifying on it ,the keys that are used in chaotic sequence are formed by proposed key generation algorithm .The proposed algorithm appears efficiency during the execution time where it can encryption and decryption long messages by short time and small memory (chaotic NN offer capacity of m
... Show MoreThe limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall
... Show MoreHuman posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can pre
... Show MoreIn this paper, a Modified Weighted Low Energy Adaptive Clustering Hierarchy (MW-LEACH) protocol is implemented to improve the Quality of Service (QoS) in Wireless Sensor Network (WSN) with mobile sink node. The Quality of Service is measured in terms of Throughput Ratio (TR), Packet Loss Ratio (PLR) and Energy Consumption (EC). The protocol is implemented based on Python simulation. Simulation Results showed that the proposed protocol provides better Quality of Service in comparison with Weighted Low Energy Cluster Hierarchy (W-LEACH) protocol by 63%.
The important device in the Wireless Sensor Network (WSN) is the Sink Node (SN). That is used to store, collect and analyze data from every sensor node in the network. Thus the main role of SN in WSN makes it a big target for traffic analysis attack. Therefore, securing the SN position is a substantial issue. This study presents Security for Mobile Sink Node location using Dynamic Routing Protocol called (SMSNDRP), in order to increase complexity for adversary trying to discover mobile SN location. In addition to that, it minimizes network energy consumption. The proposed protocol which is applied on WSN framework consists of 50 nodes with static and mobile SN. The results havw shown in each round a dynamic change in the route to reach mobi
... Show MoreWith the development of information technology and means for information transfer it has become necessary to protect sensitive information. The current research presents a method to protect secret colored images which includes three phases: The first phase calculates hash value using one of hash functions to ensure that no tampering with or updating the contents of the secret image. The second phase is encrypting image and embedding it randomly into appropriate cover image using Random Least Significant Bit (RLSB) technique. Random hiding provides protection of information embedded inside cover image for inability to predict the hiding positions, as well as the difficult of determining the concealment positions through the analysis of im
... Show MoreData centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le
... Show MoreHomomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security. We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly. We make an effort to prove
... Show More