A group-based deterministic key pre-distribution scheme for wireless sensor network

In this paper, we discuss the use of combinatorial set systems (combinatorial designs) in the design of key predistribution schemes (KPSs) for sensor networks. We show that the performance of a KPS can be improved by carefully choosing a certain class of set systems as “key ring spaces”. Especially, we analyze KPSs based on a type of combinatorial design known as a <it>transversal design</it>. We employ two types of transversal designs, which are represented by the set of all linear polynomials and the set of quadratic polynomials (over some finite field), respectively. These KPSs turn out to have significant efficiency in a shared-key discovery phase without degrading connectivity and resiliency.

In order to provide security services in wireless sensor networks, a well-known task is to provide cryptographic keys to sensor nodes prior to deployment. It is difficult to assign secret keys for all pairs of sensor node when the number of nodes is large due to the large numbers of keys required and limited memory resources of sensor nodes. One possible solution is to randomly assign a few keys to sensor nodes and have nodes be able to connect to each other with some probability. This scheme has limitations in terms of the tradeoffs between connectivity and memory requirements. Recently, sensor deployment knowledge has been used to improve the level of connectivity while using lesser amounts of memory space. However, deployment based key predistribution schemes may cause a large number of nodes to be cryptographically isolated if nodes move after key pre-distribution. Mobility may be necessitated for reasons depending on applications or scenarios. In this paper, we consider mobility due to spatial retreat of nodes under jamming attacks as an example. Jamming attacks are easy and efficient means for disruption of the connectivity of sensors and thus the operation of a sensor network. One solution for mobile sensor nodes to overcome the impact of jamming is to perform spatial retreats by moving nodes away from jammed regions. Moved nodes may not be able to reconnect to the network because they do not have any shared secret with new neighbors at new locations if strict deployment knowledge based key predistribution is employed. In this paper, we propose a hybrid key predistribution scheme that supports spatial retreat strategies to cope with jamming attacks. Our scheme combines the properties of random and deployment knowledge based key predistribution schemes. In the presence of jamming attacks, our scheme provides high key connectivity (similar to deployment knowledge based schemes) while reducing the number of isolated nodes. We evaluate the performance of our scheme through simulations and analysis.

In a wireless sensor network, the sensing and data transmission for sensors will cause energy depletion, which will lead to the inability to complete the tasks. To solve this problem, wireless rechargeable sensor networks (WRSNs) have been developed to extend the lifetime of the entire network. In WRSNs, a mobile charging robot (MR) is responsible for wireless charging each sensor battery and collecting sensory data from the sensor simultaneously. Thereby, MR needs to traverse along a designed path for all sensors in the WRSNs. In this paper, dual-side charging strategies are proposed for MR traversal planning, which minimize the MR traversal path length, energy consumption, and completion time. Based on MR dual-side charging, neighboring sensors in both sides of a designated path can be wirelessly charged by MR and sensory data sent to MR simultaneously. The constructed path is based on the power diagram according to the remaining power of sensors and distances among sensors in a WRSN. While the power diagram is built, charging strategies with dual-side charging capability are determined accordingly. In addition, a clustering-based approach is proposed to improve minimizing MR moving total distance, saving charging energy and total completion time in a round. Moreover, integrated strategies that apply a clustering-based approach on the dual-side charging strategies are presented in WRSNs. The simulation results show that, no matter with or without clustering, the performances of proposed strategies outperform the baseline strategies in three respects, energy saving, total distance reduced, and completion time reduced for MR in WSRNs.

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper, we propose a novel probabilistic key pre-distribution scheme, for large-scale wireless sensor networks which utilizes location information in order to improve the performance of random key pre-distribution substantially. In order to apply the location information of the nodes in key distribution process, we partition the network into some regions and use graph coloring techniques to efficiently assign the random keys. The proposed scheme has a superior scalability by supporting larger number of nodes and also increasing the probability of existence of a shared exclusive key among the nearby nodes, i.e., the probability of having an isolated node is significantly reduced in comparison with the existing random key pre-distribution schemes. Our simulation results verify these terms.

Key management in sensor networks is the core security protocols for wireless sensor networks (WSNs) in the hostile environment. Due to the resource constraints, pre-distribution secrets keys into sensor nodes before they are deployment are an applicable approach. Several key pre-distribution schemes have been proposed in literature to establish pairwise keys between sensor nodes. However, as the number of compromised nodes increases, the fraction of affected pairwise keys increase quickly. These vulnerabilities are exacerbated when WSNs have to operate unattended in a hostile environment. In such an environment, an adversary may control the network by capturing some sensor nodes.. To address these weaknesses, we present a promising pairwise key establishment scheme in this paper. In the proposed scheme, after pairwise key establishment all attackers can’t get any key information of uncompromised sensor nodes from compromised sensors. The analysis shows that compared with existing approaches, our scheme have better networks resilience against node capture attack.

Chapter 11 - Node Compromise Detection in Wireless Sensor Networks

Despite much research on probabilistic key predistribution schemes for wireless sensor networks over the past decade, few formal analyses exist that define schemes' resilience to node-capture attacks precisely and under realistic conditions. In this paper, we analyze the resilience of the q-composite key predistribution scheme, which mitigates the node capture vulnerability of the Eschenauer-Gligor scheme in the neighbor discovery phase. We also show that this scheme can be easily enhanced to achieve the same "perfect resilience" property as in the random pairwise key pre-distribution for attacks launched after neighbor discovery. Despite considerable attention to this scheme, much prior work explicitly or implicitly uses an incorrect computation for the probability of link compromise under node-capture attacks. Based on our rigorous results, we provide guidelines on the design of secure sensor networks for resilience against node capture.

Key establishment is a fundamental security issue in wireless sensor networks (WSN). It is the basis to establish the secure communication using cryptographic technologies between sensor nodes. Due to the current resource constraints on sensors, it is infeasible to use traditional key management techniques such as public key cryptography or key distribution center based protocols. So the key predistribution schemes are paid most attention in key management of WSN. To establish pairwise keys securely and meanwhile prevent a number of compromised colluding nodes from breaking the pairwise key shared by any two innocent nodes, we propose an enhanced polynomial-based key establishment scheme (EPKES) for WSN. In EPKMS, we introduce an auxiliary set to improve the security level compared to previous schemes. The results of performance evaluations show that our proposed scheme has a good key connectivity, scalability, direct key establishment, resilience to nodes capture and storage consumption.

In this paper, we have proposed a hybrid adaptive coding and decoding scheme for multi-hop wireless sensor networks (WSNs). Energy consumption and transmission reliability are used as performance metrics for multi-hop communications in WSNs. The presented scheme takes into account distance, channel conditions and correction codes performance to decide coding and decoding procedure, and considers Reed Solomon code and Low Density Parity Check code to provide error protection on the transmitted data. The proposed approach aims to reduce the decoding power consumption and to prolong the lifetime of the network as well as improve the reliability of the transmission. Simulation results show that our performed scheme enhances both energy efficiency and communication reliability of multi-hop sensor networks.

Most wireless sensor networks are driven with a battery. Lifetime maximization is thus very important when designing such networks. Clustering a network is an effective topology control scheme to enhance energy efficiency and scalability of large-scale wireless sensor networks. However, when using a wireless sensor network after a disaster, if sensor nodes cannot join any clusters, the detection area of the wireless sensor network is narrowed. Maximizing lifetime and minimizing the number of sensor nodes, that cannot join clusters is very important. In this work, we propose a lightweight clustering scheme for wireless sensor networks used in disaster relief. Simulation results show that the proposed clustering scheme is efficient and effective for maximizing the lifetime of a network and the number of communicable sensor nodes compared with other traditional clustering schemes.KeywordsWireless sensor networksClusteringLifetimeDisaster relief

A deterministic key pre-distribution scheme is proposed in the paper. The distribution of keys to the nodes precedes a virtual arrangement of the nodes into a non-uniform rectangular grid structure. Distribution of keys is based on projective planes and pairwise connectivity. With small memory requirements, the nodes induce a network which offers a trade-off between connectivity and resilience. The impact of resilience and connectivity can be controlled by choosing the number of rows and columns suitably. Another significant aspect of the proposed scheme is that the path between any two nodes is not unique, which leads to a well-connected network.

Finding an optimal key assignment (subject to given constraints) for a key predistribution scheme in wireless sensor networks is a difficult task. Hence, most of the practical schemes are based on probabilistic key assignment, which leads to sub-optimal schemes requiring key storage linear in the total number of nodes. A graph theoretic framework is introduced to study the fundamental tradeoffs between key storage, average key path length (directly related to the battery consumption) and resilience (to compromised nodes) of key predistribution schemes for wireless sensor networks. Based on the proposed framework, a lower bound on key storage is derived for a given average key path length. An upper bound on the compromising probability is also given. This framework also leads to the design of key assignment schemes with a storage complexity of the same order as the lower bound.

A novel key predistribution scheme for wireless sensor networks based on hexagon deployment model

Deterministic estimator learning automata-based neighbor discovery schemes for D2D networks with directional antennas

software-defined vehicles (SDVs) employ zonal architectures whose zones exchange periodic real-time traffic over a high-speed Time-Sensitive Ethernet (IEEE 802.1Q) backbone. Existing research has produced many deterministic routing schemes for such backbone Ethernet networks, yet has largely ignored the complementary problem of payload-level frame minimization: multiplexing dozens of small zonal messages—whether CAN, LIN, or any other in-zone protocol—into the fewest possible Ethernet frames so that bandwidth, switch buffers and latency budgets are not squandered. This letter concentrates on that neglected frame-minimization facet and presents an optimization flow dedicated to reducing the number of Ethernet frames. We first formulate an exact Satisfiability Modulo Theories (SMTs) model that finds the minimal set of multiplexed frames required across an entire hyper-period. Because SMT becomes intractable on large vehicle topologies, we then introduce a matrix-based heuristic aggregation (MaHA) algorithm that reproduces the SMT’s frame-minimization decisions to within a few percent while executing in milliseconds. Experiments on synthetic SDV workloads show that naive one zonal message per Ethernet frame policies waste significant available payload capacity; our SMT eliminates this waste completely, and the heuristic achieves closely similar savings with up to three orders of magnitude less run-time, making it a practical drop-in solution for next-generation SDV networks.