Secure k-connectivity properties of wireless sensor networks

2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS

Volumn , Issue , 2007, Pages

  Yee, Wei Law ^a   Yen, Li Hsing ^b   Di Pietro, Roberto ^c   Palaniswami, Marimuthu ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b NATIONAL UNIVERSITY OF KAOHSIUNG   (Taiwan)

^c ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; HYBRID SENSORS; PROBABILITY DISTRIBUTIONS; QUALITY ASSURANCE; RANDOM PROCESSES; RELIABILITY; ROUTING PROTOCOLS; SENSOR NETWORKS; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

K-CONNECTED; K-CONNECTIVITY; KEY PRE-DISTRIBUTION; KEY PREDISTRIBUTION SCHEMES; MATHEMATICAL FORMULAS; NODE-DISJOINT PATHS; RANDOM GRAPH MODELS; RING SIZES; SENSOR SYSTEMS; SIMULATION RESULTS; WIRELESS SENSOR NETWORK (WSN);

WIRELESS SENSOR NETWORKS;

EID: 50249150855     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MOBHOC.2007.4428764     Document Type: Conference Paper

References (15)

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. ACM Press, 2002.
2. B. Bollobás. Random Graphs. Academic Press Inc., 1985.
3. M. Capinski and P. E. Kopp. Measure, Integral and Probability. Springer-Verlag, 2nd edition, 2004.
4. R. Di Pietro, L. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan. Connectivity properties of secure wireless sensor networks. In 2nd ACM workshop on Security of ad hoc and sensor networks, pages 53-58. ACM Press, 2004.
5. R. Di Pietro, L. V. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan. How to design connected sensor networks that are provably secure. In Proceedings of the 2nd IEEE International Conference on Security and Privacy for Emerging Areas in Communication Networks (SecureComm 2006). IEEE Press, 2006.
6. P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar Acad. Sci., 5:17-61, 1960.
7. L. Eschenauer and V. Gligor. A key-management scheme for distributed sensor networks. In Proc. 9th ACM conference on Computer and communications security, pages 41-47. ACM Press, 2002.
8. D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. Highly resilient, energy efficient multipath routing in wireless sensor networks. Mobile Computing and Communications Review (MC2R), 1(2), 2002.
9. M. Huson and A. Sen. Broadcast scheduling algorithms for radio networks. In Military Communications Conference (MILCOM '95), volume 2, pages 647-651. IEEE, 1995.
10. Y. Law, J. Doumen, and P. Hartel. Survey and benchmark of block ciphers for wireless sensor networks. ACM Transactions on Sensor Networks, 2(1):65-93, Feb. 2006.
11. T. Łuczak. Size and connectivity of the k-core of a random graph. Discrete Math., pages 61-68, 1991.
12. M. Penrose. Random Geometric Graphs. Oxford University Press, 2003.
13. M. D. Penrose. The longest edge of the random minimal spanning tree. The Annals of Applied Probability, 7(2):340-361, May 1997.
14. M. D. Penrose. On k-connectivity for a geometric random graph. Random Struct. Algorithms, 15(2):145-164, 1999.
15. F. Sun and M. Shayman. On the average pairwise connectographs, tivity of wireless multihop networks. In Global Telecommunications Conference (GLOBECOM '05), volume 3, pages 1762-1766. IEEE, 2005.