Results on Vertex Degree and K-Connectivity in Uniform S-Intersection Graphs

Abstract

We present results related to the vertex degree in a uniform s-intersection graph which has received much interest recently. Specifically, we derive the probability distribution for the minimum vertex degree, and show that the number of vertices with an arbitrary degree converges to a Poisson distribution. A uniform s-intersection graph models the topology of a secure wireless sensor network employing the widely used s-composite key predistribution scheme. Our theoretical findings is also confirmed by numerical results.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2014
Accession Number
ADA609112

Entities

People

  • Jun Zhao
  • Osman Yagan
  • Virgil Gligor

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Composite Materials
  • Detectors
  • Information Operations
  • Military Research
  • Networks
  • Notation
  • Probability
  • Probability Distributions
  • Secure Communications
  • Sensor Networks
  • Sequences
  • Universities
  • Wireless Sensor Networks

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computer Networking
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Graph Algorithms and Convex Optimization.