Transitional Behavior of $q$-Composite Random Key Graphs With Applications to Networked Control

  title={Transitional Behavior of \$q\$-Composite Random Key Graphs With Applications to Networked Control},
  author={Jun Zhao},
  journal={IEEE Transactions on Control of Network Systems},
  • Jun Zhao
  • Published 28 August 2017
  • Computer Science
  • IEEE Transactions on Control of Network Systems
Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate <inline-formula><tex-math notation="LaTeX">$q$</tex-math></inline-formula>-composite random key graphs, whose construction on <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula> nodes is as follows: each node independently selects a set… 

Figures from this paper

Probabilistic Key Predistribution in Mobile Networks Resilient to Node-Capture Attacks

  • Jun Zhao
  • Computer Science
    IEEE Transactions on Information Theory
  • 2017
Based on the results of connectivity, unassailability, and unsplittability, a comprehensive analysis on connectivity and resilience of secure sensor networks under the widely studied Composite key predistribution scheme is presented.

Graph-Based Symmetric Crypto-System for Data Confidentiality

A novel graph-based crypto-system is proposed to provide data confidentiality during communication between users and devices that uses a set of graphs of order n along with an operation defined over it to form a group algebraic structure.

Task allocation based on node pair intimacy in wireless sensor networks

Simulation results show that the proposed algorithm, in which tasks are allocated to a pair of collaboratively working sensor nodes based on their intimacy, can improve the task allocation efficiency and can balance the network energy consumption.



Analyzing Connectivity of Heterogeneous Secure Sensor Networks

  • Jun Zhao
  • Computer Science
    IEEE Transactions on Control of Network Systems
  • 2018
The connectivity of a heterogeneous secure sensor network that uses key predistribution to protect communications between sensors is analyzed and useful guidelines for the design of secure sensor networks are provided.

On Connectivity and Robustness in Random Intersection Graphs

This paper establishes sharp asymptotic zero-one laws for connectivity and robustness in a general random intersection graph model and considers two special cases of the general model, abinomialrandom intersection graph and a uniform random intersection graphs, which both have numerous applications as well.

Topological Properties of Secure Wireless Sensor Networks Under the $q$ -Composite Key Predistribution Scheme With Unreliable Links

  • Jun Zhao
  • Computer Science
    IEEE/ACM Transactions on Networking
  • 2017
Topological properties related to node degree in WSNs operating under the Composite scheme with unreliable communication links modeled as independent ON/OFF channels are investigated and derive the asymptotically exact probability for the property of minimum degree being at least.

$k$ -Connectivity in Random Key Graphs With Unreliable Links

These findings improve the previous results by Rybarczyk on k-connectivity of random key graphs (with reliable links), as well as the zero-one laws by Yagan on one-Connectivity ofrandom key graphs with unreliable links.

On k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs

For binomial/uniform random $s-intersection graphs, results related to k-connectivity and minimum vertex degree are presented, which derive the asymptotically exact probabilities and zero-one laws for the following three properties.

Zero–One Laws for Connectivity in Random Key Graphs

A new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large is established for this class of random graphs.

Connectivity of the uniform random intersection graph

Redoubtable Sensor Networks

In the context of wireless sensor networks where random predistribution of keys is employed, this work is the first to provide a mathematically precise proof, with a clear indication of parameter choice, that two crucial properties, connectivity via secure links and resilience against malicious attacks can be obtained simultaneously.

Threshold functions in random s-intersection graphs

  • Jun Zhao
  • Mathematics
    2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2015
These threshold functions for perfect matching containment, Hamilton cycle containment, and k-robustness are established, and it is shown that these threshold functions resemble those of classical Erdös-Rényi graphs, in which any two vertices have an undirected edge in between independently with the same probability.

On the distribution and revocation of cryptographic keys in sensor networks

An overview of key-distribution methods in sensor networks and their salient features are presented to provide context for understanding key and node revocation and define basic properties that distributed sensor-node revocation protocols must satisfy.