首页> 美国政府科技报告 >Results on Vertex Degree and K-Connectivity in Uniform S-Intersection Graphs.
【24h】

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

机译:均匀s-交点图中顶点度和K-连通性的结果。

获取原文

摘要

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.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号