Redoubtable sensor networks

ACM Transactions on Information and System Security

Volumn 11, Issue 3, 2008, Pages

  Di Pietro, Roberto ^a   Mancini, Luigi V ^b   Mei, Alessandro ^b   Panconesi, Alessandro ^b   Radhakrishnan, Jaikumar ^c  

^a ROMA TRE UNIVERSITY   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

Connectivity; Probabilistic key sharing; Random graphs; Wireless sensor network

Indexed keywords

COMPUTER CRIME; COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; PARAMETER ESTIMATION; SECURITY OF DATA;

CONNECTIVITY; PROBABILISTIC KEY SHARING; RANDOM GRAPHS;

WIRELESS SENSOR NETWORKS;

EID: 41549165648     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1341731.1341734     Document Type: Article

References (21)

1. AKYILDIZ, I. F., SANKARASUBRAMANIAM, Y., SU, W., AND CAYIRCI, E. 2002. Wireless sensor networks: A survey. Comput. Netw. 38, 393-422.
2. rd ACM International Symposium an Mobile ad hoc Networking and Computing (MobiHoc02). 80-91.
3. BLOM, R. 1985. An optimal class of symmetric key generation systems. In Advances in Cryptology: Proceedings of the 1984 International Conference of the Theory and Applications of Cryptographic Techniques (EUROCRYPT'84), Lecture Notes in Computer Science, vol. 338.
4. BLUNDO, C., SANTIS, A. D., HERZBERG, A., KUTTEN, S., VACCARO, U., AND YUNG, M. 1993. Perfectly-secure key distribution for dynamic conferences. In Advances in Cryptology: Proceedings of the International Cryptology Conference (CRYPTO'92), Lecture Notes in Computer Science, vol. 740.
5. BOLLOBAS, B. 1998. Modern Graph Theory. Springer.
6. CHAN, H., PERRIG, A., AND SONG, D. 2003. Random key predistribution schemes for sensor networks. In Proceedings of the IEEE Symposium on Security and Privacy. Oakland, CA, 197-213.
7. CONTI, M., DI PIETRO, R., AND MANCINI, L. V. 2007. Ecce: Enhanced cooperative channel establishment for secure pairwise communication in wireless sensor networks. Ad Hoc Netw. 5, 1, 49-62.
8. DI PIETRO, R., MANCINI, L. V., AND MEI, A. 2006. Energy efficient node-to-node authentication and communication confidentiality in wireless sensor networks. Wirel. Netw. 12, 6, 709-721.
9. DI PIETRO, R., MANCINI, L. V., MEI, A., PANCONESI, A., AND RADHAKRISHNAN, J. 2004. Connectivity properties of secure wireless sensor networks. In Proceedings of the 2nd ACM Workshop on Security of ad hoc and Sensor Networks. ACM Press, New York, 53-58.
10. DU, W., DENG, J., HAN, Y. S., AND VARSHNEY, P. K. 2003. A pairwise key pre-distribution scheme for wireless sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). ACM Press, New York, 42-51.
11. ERDÖS, P. AND RÉNYI, A. 1960. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5, 17-61.
12. th ACM Conference on Computer and Communications Security (CCS). ACM Press, New York, 41-47.
13. FILL, J. A., SCHENERMAN, E. R., AND SINGER-COHEN, K. B. 2000. Random intersection graphs when m = ω(n): An equivalence theorem relating the evolution of the g(n, m, p) and g(n, p) models. Random Struct. Algor. 16, 156-176.
14. KAROÑSKI, M., SHEINERMAN, E. R., AND SINGER-COHEN, K. B. 1999. On random intersection graphs: The subgraph problem. Combin. Probab. Comput. 8, 131-159.
15. LIU, D. AND NING, P. 2003. Establishing pairwise keys in distributed sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). ACM Press, New York, 52-61.
16. NEWMAN, M. E. J. 2003. The structure and function of complex networks. SIAM Rev. 45, 167-256.
17. PENROSE, M. D. 1999. On k-connectivity for a geometric random graph. Random Struct. Algor. 15, 2, 145-164.
18. PERRIG, A., SZEWCZYK, R., WEN, V., CULLER, D., AND TYGAR, J. 2001. SPINS: Security protocols for sensor networks. In Proceedings of the 1th Annual International Conference on Mobile Computing and Networking (MobiCom'01). ACM Press, New York, 189-199.
19. SINGER-COHEN, K. B. 1995. Random intersection graphs. Ph.D. thesis, Department of Mathematical Sciences, The Johns Hopkins University.
20. STARK, D. 2004. The vertex degree distribution of random intersection. Random Struct. Algor. 24, 249-258.
21. WATTS, D. J., AND STROGATZ, S. H. 1998. Collective dynamics of "small world" networks. Nature 393, 440-442.