Minimum node degree and K-connectivity for key predistribution schemes and distributed sensor networks

WiSec'08: Proceedings of the 1st ACM Conference on Wireless Network Security

Volumn , Issue , 2008, Pages 119-124

  Wu, Jiang ^a   Stinson, Douglas R ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

K connectivity; Key predistribution; Sensor networks

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY; INTERNET; METROPOLITAN AREA NETWORKS; NETWORK SECURITY; RANDOM PROCESSES; SENSOR NETWORKS; SENSORS; WIRELESS SENSOR NETWORKS;

DISTRIBUTED SENSOR NETWORKS; K-CONNECTIVITY; KEY PREDISTRIBUTION; KEY PREDISTRIBUTION SCHEMES; NODE DEGREES; RANDOM GRAPH MODELS;

WIRELESS NETWORKS;

EID: 56749181020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1352533.1352552     Document Type: Conference Paper

References (25)

1. C. Bettstetter. On the minimum node degree and connectivity of a wireless multihop network. In MobiHoc '02: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pages 80-91, New York, NY, USA, 2002. ACM Press.
2. B. Bollobás. Random Graphs. Cambridge University Press, second edition, 2001.
3. S. Çamtepe and B. Yener. Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE/ACM Trans. Netw., 15(2):346-358, 2007.
4. D. Chakrabarti, S. Maitra, and B. Roy. A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design. Int. J. Inf. Secur., 5(2):105-114, 2006.
5. H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor setworks. In SP '03: Proceedings of the 2003 IEEE Symposium on Security and Privacy, page 197, Washington, DC, USA, 2003. IEEE Computer Society.
6. H. David. Order Statistics. John Wiley & Sons, Inc., second edition, 1981.
7. R. Di Pietro, L. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan. Connectivity properties of secure wireless sensor networks. In SASN '04: Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks, pages 53-58, New York, NY, USA, 2004. ACM Press.
8. R. Di Pietro, L. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan. How to design connected censor networks that are provably secure. In Proceedings of SecureComm 2006, the 2nd IEEE/Create Net International Conference on Security and Privacy in Communication Networks, 2006.
9. W. Du, J. Deng, Y. Han, P. Varshney, J. Katz, and A. Khalili. A pairwise key pre-distribution scheme for wireless sensornetworks. The ACM Transactions on Information and System Security (TISSEC), 8(2):228-258, May 2005.
10. P. Erdos and A. Rényi. On the evolution of random graphs. In Publ. Math. Inst. Hungar. Acad. Sci., volume 3, pages 17-61.
11. L. Eschenauer and V. D. Gligor. A key-management scheme for distributed sensor networks. In CCS '02: Proceedings of the 9th A CM Conference on Computer and Communications Security, pages 41-47, New York, NY, USA, 2002. ACM Press.
12. J. Fill, E. Scheinerman, and K. Singer-Cohen. Random intersection graphs when m= w(n): an equivalence theorem relating the evolution of the g(n, m, p) and g(n, p) models. Random Struct. Algorithms, 16(2):156-176, 2000.
13. E. Godehardt, J. Jaworski, and K. Rybarczyk. Random intersection graphs and classification. In Advances in Data Analysis, pages 67-74. Springer Berlin Heidelberg, 2007.
14. D. Hare and W. McCuaig. The connectivity of the block-intersection graphs of designs. Des. Codes Cryptography, 3(1):5-8, 1993.
15. J. Hwang and Y. Kim. Revisiting random key pre-distribution schemes for wireless sensor networks. In SASN '04: Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks, pages 43-52, New York, NY, USA, 2004. ACM Press.
16. J. Lee and D. Stinson. On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs. The ACM Transactions on Information and System Security (TISSEC). To appear.
17. J. Lee and D. Stinson. A combinatorial approach to key predistribution for distributed sensor networks. In IEEE Wireless Communications and Networking Conference, volume 2, pages 1200-1205, Mar. 2005.
18. D. Liu, P. Ning, and R. Li. Establishing pairwise keys in distributed sensor networks. ACM Trans. Inf. Syst. Secur., 8(1):41-77, 2005.
19. E. Palmer. Graphical Evolution. John Wiley & Sons, Inc., 1985.
20. M. Penrose. Random, Geometric Graphs. Oxford University Press, 2003.
21. K. Singer. Random intersection graphs. PhD thesis, The Johns Hopkins University, 1996.
22. D. Stinson. Combinatorial Designs. Springer-Velag, 2003.
23. P. Tague and R. Poovendran. A canonical seed assignment model for key predistribution in wireless sensor networks. ACM Trans. Sen. Netw., 3(4):19, 2007.
24. R. Wei and J. Wu. Product construction of key distributionschemes for sensor networks. In Lecture Notes in Computer Science, volume 3357, pages 280-293. Springer Berlin / Heidelberg, 2004.
25. H. Whitney. Congruent graphs and the connectivity of graphs. American Journal of Mathematics, 54(1):150-168, 1932.