Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015, Article ID 982094, 9 pages
http://dx.doi.org/10.1155/2015/982094
Research Article

Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs

College of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, China

Received 24 June 2015; Revised 11 October 2015; Accepted 18 October 2015

Academic Editor: Filippo Cacace

Copyright © 2015 Y. Tang and Q. L. Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Eschenauer and V. D. Gligor, “A key-management scheme for distributed sensor networks,” in Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41–47, ACM, November 2002. View at Scopus
  2. I. F. Akyildiz, T. Melodia, and K. R. Chowdury, “Wireless multimedia sensor networks: a survey,” IEEE Wireless Communications, vol. 14, no. 6, pp. 32–39, 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. S. R. Blackburn and S. Gerke, “Connectivity of the uniform random intersection graph,” Discrete Mathematics, vol. 309, no. 16, pp. 5130–5140, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. E. Godehardt, J. Jaworski, and K. Rybarczyk, “Random intersection graphs and classification,” in Advances in Data Analysis, Studies in Classification, Data Analysis, and Knowledge Organization, pp. 67–74, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  5. O. Yagăn and A. M. Makowski, “Zero-one laws for connectivity in random key graphs,” IEEE Transactions on Information Theory, vol. 58, no. 5, pp. 2983–2999, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. K. Rybarczyk, “Diameter, connectivity, and phase transition of the uniform random intersection graph,” Discrete Mathematics, vol. 311, no. 17, pp. 1998–2019, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. M. D. Penrose, “On k-connectivity for a geometric random graph,” Random Structure and Algorithms, vol. 15, no. 2, pp. 145–164, 1999. View at Google Scholar
  8. G. Mao and B. D. O. Anderson, “Towards a better understanding of large-scale network models,” IEEE/ACM Transactions on Networking, vol. 20, no. 2, pp. 408–421, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. C.-W. Yi, P.-J. Wan, X.-Y. Li, and O. Frieder, “Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with bernoulli nodes,” IEEE Transactions on Communications, vol. 54, no. 3, pp. 510–517, 2006. View at Publisher · View at Google Scholar · View at Scopus
  10. O. Yagăn, “Performance of the Eschenauer-Gligor key distribution scheme under an ON/OFF channel,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3821–3835, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. R. D. Pietro, L. V. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan, “Connectivity properties of secure wireless sensor networks,” in Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks Association for Computing Machinery (SASN '04), pp. 53–58, Washington, DC, USA, October 2004.
  12. K. Krzywdziński and K. Rybarczyk, “Geometric graphs with randomly deleted edges-connectivity and routing protocols,” in Mathematical Foundations of Computer Science 2011, pp. 544–555, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. B. S. Krishnan, A. Ganesh, and D. Manjunath, “On connectivity thresholds in superposition of random key graphs on random geometric graphs,” in Proceedings of the IEEE International Symposium on Information Theory Proceedings (ISIT '13), pp. 2389–2393, IEEE, Istanbul, Turkey, July 2013. View at Publisher · View at Google Scholar
  14. S. Janson, T. Łuczak, and A. Ruciński, Random Graphs, Wiley, New York, NY, USA, 2000. View at Publisher · View at Google Scholar
  15. M. D. Penrose, Random Geometric Graphs, Oxford University Press, Oxford, UK, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  16. J. Zhao, O. Yagăn, and V. Gligor, “Connectivity in secure wireless sensor networks under transmission constraints,” in Proceedings of the 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1294–1301, Monticello, Va, USA, September 2014. View at Publisher · View at Google Scholar