A Secure Scheme Based on One-Way Associated Key Management Model in Wireless Sensor Networks

A scheme for WSNs (wireless sensor networks) security is given by dividing sensing tetrahedron into clusters and using the symmetric polynomials in this paper.The sensing tetrahedron is divided into a number of small grids.All those sensor nodes, both ordinary sensor nodes and heterogeneous sensor nodes are distributed in the sensing tetrahedron.In a grid, all ordinary sensor nodes and heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.All the heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.At last, all sensor nodes establish their keys directly or indirectly in the whole sensing tetrahedron.Analysis and comparison demonstrate this scheme enhances the WSN security, has good network connectivity, saves node storage, reduces network computing load, and extends the network lifetime.

Key management is a major challenge to achieve security in wireless sensor networks. Previous research on sensor network security mainly considers homogeneous sensor networks, where all sensor nodes have the same capabilities. The recent research has shown that the survivability of the homogeneous sensor network can be improved if sensor nodes are grouped in clusters in which a powerful cluster head assigned. In this paper, we adopt a Heterogeneous Sensor Network (HSN) model for better performance and security. We proposed a novel key management scheme, which utilizes Elliptic Curve Cryptography and the t-degree trivariate symmetric polynomial in the design of an efficient key management scheme for sensor nodes. In addition, we also design a dynamic key update technique based on one-way hash chain and Time Slice mechanism which significantly reduced the communication overhead in key agreement and update phase. The performance evaluation and security analysis show that the proposed key management scheme can provide perfect resilience against node capture and scalability with significant saving on communication overhead and storage space.

The security of Wireless Sensor Networks (WSNs) has a direct reliance on secure and efficient key management. This leaves key management as a fundamental research topic in the field of WSNs security. Among the proposed key management schemes for WSNs security, LEAP (Localized Encryption and Authentication Protocol) has been regarded as an efficient protocol over the last years. LEAP supports the establishment of four types of keys. The security of these keys is under the assumption that the initial deployment phase is secure and the initial key is erased from sensor nodes after the initialization phase. However, the initial key is used again for node addition after the initialization phase whereas the new node can be compromised before erasing the key. A time-based key management scheme rethought the security of LEAP. We show the deficiency of the time-based key management scheme and proposed a key management scheme for multi-phase WSNs in this paper. The proposed scheme disperses the damage resulting from the disclosure of the initial key. We show it has better resilience and higher key connectivity probability through the analysis.

Security of wireless sensor networks is a major issue to protect sensor nodes from the attacker. Key management or key pre-distribution (KPS) is the preliminary step in the security of a sensor network, where secret keys are loaded into the sensor node’s memory before placement of the node in target positions. Various schemes for KPS have been proposed for location dependent as well as location independent wireless sensor networks. Costas arrays are $$n \times n$$ matrices grid represented where dots are placed for the l’s and leave blanks for the 0’s of the matrix for a positive integer n with the property that the vectors connecting two dots of the grid are all distinct as vectors. Costas arrays have a wide range of application including the construction of sonar signal pattern, cryptography, etc. Due to the Costas arrays property of uniqueness among their elements, it can be used in key pre-distribution of wireless sensor networks, especially in a location-dependent grid-based network. In this paper, we have proposed a Costas array based key pre-distribution scheme. Simulations are done on different network scenarios and the results were analyzed. Comparative performance analysis of the scheme is shown for different grid sized network considering various order of Costas array.

Being one of the main technologies for Internet of Things (IoT), wireless sensor network is absolutely critical and plays an increasingly important role in the development of Internet of Things. Wireless sensor network is mobile network composed of sensor nodes with limited resources, like computation capability, energy, memory storage, and communication capability. Its characteristic results in that the security of wireless sensor network faces a great challenge. Hence, the security of wireless sensor network is an important issue for the development of IoT and shall be focused on. In this paper, a novel authentication scheme is proposed for wireless sensor networks based on theory of quadratic residues. It is making the use of master key to achieve simple symmetric cryptographic primitives and authentication operation and reach the aims of great resistance against the attacks and low energy consumption. Then the proposed scheme is compared with other network-wide key management schemes, obtaining better results in the aspects of security, efficiency, and scalability.

The secured data transmission in Wireless Sensor Network (WSN) relies on effective key generation and secured sharing. The generated key must be random to enhance data confidentiality. The processes associated with the security in WSN must be designed at reduced computing time and communication cost. Our research work aims to design a novel lightweight key-sharing protocol that is needed for ensuring data confidentiality. The protocol must meet the constraints of WSN by being lightweight and consuming less energy. Security breaches in WSNs occur due to insecure keys. This can be overcome by generating shared keys which are generated once using the dynamic features of Sensor Nodes (SNs) when the Cluster Heads (CHs) are selected. In this research work, we have generated the Master Shared Key (MSK) at the transmitter node by forming a Galois Ring (GR) using WSN parameters and derived the Shared Random Key (SRK) using matched positions of exchanged Random Sequences (RSs). It is protected using a Physically Unclonable Function (PUF). The novelty lies in the SRK generation from MSK which is chosen at random from the polynomials generated during the formation of GR. The MSK is securely shared with the receiver node by encrypting using a Preloaded Key (PK). After this exchange, the key for encryption and decryption is derived by the transmitter and the receiver by exchanging RSs. The SRK is then encrypted using a key which is a unique fingerprint of the SN generated using PUF and stored in the SNs and the CHs to prevent node capture attack that occurs in WSN. Our proposed Shared Random Key Agreement Protocol (SRKAP) is comparable to the Localized Encryption and Authentication Protocol (LEAP) and performs better compared to the Elliptic Curve Diffie Hellman (ECDH) algorithm

In-network data aggregation plays an important role to reduce the transmitting energy and data redundancy in large scale sensor networks. However, the security of wireless sensor networks is a challenging problem in the process of data aggregation. An efficient secure data aggregation is proposed to enhance the data security of wireless sensor networks. Firstly, the secure in-network aggregation tree is introduced, then a judgment method based on trust schema was used to detect whether a sensor node has potential misbehavior. After the detection, a local recovery schema is proposed to reduce the possibility to become isolated nodes, which will increase the security level in data aggregation in wireless sensor networks. The performance analysis shows the efficiency of the schema.

Information attacks and security in wireless sensor networks of industrial SCADA systems

Sensor networks are often deployed in unattended environment, thus leaving those networks vulnerable to false data injection attacks. Attackers often inject false data into the network in order to deceive the base station or deplete the resource and the energy of the relaying nodes. The existing authentication mechanisms cannot prevent this kind of attack after an amount of sensor nodes have been compromised. Pairwise key establishment is a fundamental security in wireless sensor networks, which makes it possible that sensor nodes can communicate securely one another using cryptographic techniques. However, the limited resource and energy of sensor nodes are not feasible to use such traditional key management techniques as public/private cryptography and key distribution center (KDC). In this paper, we present a novel key management and data authentication technique that pass sensing data securely and filter false data out on its way to base station. The framework of our design is to divide sensing area into a number of location cells and a group of local cells consist of a logical cell, where, pairwise key between two sensor nodes is established according to the grid-based bivariate polynomials. The established pairwise key is included in the message authentication code (MAC) and is forwarded several hops down to the base station for data authentication. Our result shows that this location scheme and data authentication method decreases communication overhead, avoids t-tolerance, and filters bogus report in wireless sensor networks

In this paper, wireless sensor network (WSN) security issue in the presence of an eavesdropper is analysed. The sensor-sink as well as sensor-eavesdropper channels are assumed to be subjected to generalized-K fading. According to the physical layer security framework, we employ round-robin, optimal sensor and cumulative distribution function-based scheduling scheme to enhance secure connection between sensor nodes and to attain low probability of intercept. Novel analytical results are given in a form of easy-to-compute analytical expressions for the intercept probability. Additionally, asymptotic closed-form expressions are derived and diversity orders of scheduling schemes are determined. Numerical results demonstrate important impacts of fading and shadowing parameters of main and wiretap links, network size and selected scheme on WSN security. Presented results are validated by independent Monte Carlo simulations.

To increase the security of wireless sensor network, reduce the cost of energies and prolong the lifecycle of the system, a chaos scheme of key predistribution and management was put forward. In this scheme, the chaos over-spread character was used to enlarge the key space and increase the anti-decipher capacity. The chaos initial value sensitivity was used to spend smaller costs while greatly enhanced the security of system. The analyses show that the space of the key can be enlarged and the costs of key distribute is limited.

The security of wireless sensor networks (WSNs) is a big challenge due to their resource-constraint nature. An efficient key management scheme is the pre-requisite to ensure security in WSN. In this paper we present a secured key management scheme adopted on cluster based topology of sensor network. The proposed scheme uses partial key pre-distribution and symmetric cryptography techniques, and shows high resilience to different security attacks. The scheme outperforms other random key pre-distribution protocols in the sense that it requires lower space, lower communication overhead and offers very high session key candidates.

Security in wireless sensor networks is very crucial especially whenever they deployed in military applications. Cryptography is used to protect sensitive information from disclosure. Key management is important component in cryptography. Cryptography is not useful if keys are disclosed to attackers. Designing an efficient key management for WSN is a difficult task because of scarcity of computing, communication, and memory resources. An efficient key distribution approach is proposed by using mobile agent paradigm rather than client–server model. The proposed approach will use good features of both symmetric and asymmetric cryptography. Mobile agents are used to generate public and private key pairs, update keys, and revocation of keys. The proposed scheme in the first level will use mobile agents for key distribution and coordination for asymmetric keys, and in the second level, sensor nodes can involve in constructing symmetric keys for secure communication through mutual authentication and encryption with those keys. The proposed method is implemented using NS2 simulator, and results are compared with existing similar methods in terms of evaluation parameters like communication, computation overhead, memory overhead, and resiliency. The performance of proposed method is improved when it is compared with similar existing methods.

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Wireless sensor networks (WSNs) are usually deployed in hostile or unattended areas, and users need to obtain real-time data from WSNs. The data collected by sensor nodes are usually relatively private and sensitive, so users must pass the identity authentication before obtaining the information perceived by sensor nodes. In order to enhance the security of wireless sensor networks and prevent illegal users from accessing sensor nodes, this paper designs an efficient and secure identity authentication protocol for wireless sensor networks. The proposed protocol makes full use of the advantages of lightweight cryptographic primitives such as physical unclonable function, one-way hash function and bitwise exclusive operation. Moreover, users only need to use biometrics (such as fingerprints, iris) to access the remote systems and do not need to rely on any password, which avoids the trouble of memorizing and losing password. To prove the scheme’s security, the well-known formal security proof with random oracle model and traditional heuristic discussion are given. Additionally, the performance comparison results show that our scheme has less communication overhead and computation complexity, and is effective for the resource constrained sensor devices in WSNs.