Analysis of multi-path random key pre-distribution for wireless sensor networks

Chun Wei Tsai, Wei Shuo Li, Min Chen, Wen Shyong Hsieh, Chu-Sing Yang

研究成果: Conference contribution

1 引文 斯高帕斯(Scopus)

摘要

Most wireless sensor networks require that every large enough node contain certain properties. By using the Szemeredi's regularity lemma, one can approximate a complex network by a much simpler object in such a way that the approximation is "regular" for most pairs of partitions of this network. After obtaining a more traceable network, we establish bounds for the probability of the property that a random key pre-distribution sub graph satisfies that each node has a path of length ℓ to its ℓth- hop neighbors. The end result is a sharp threshold p ≥ Cn -(ℓ-1)/ℓ that satisfies this property and that can be considered as an application of the sparse Szemerédi's regularity lemma.

原文English
主出版物標題Proceedings - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011
頁面497-502
頁數6
DOIs
出版狀態Published - 2011 九月 8
事件2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011 - Seoul, Korea, Republic of
持續時間: 2011 六月 302011 七月 2

出版系列

名字Proceedings - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011

Other

Other2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011
國家Korea, Republic of
城市Seoul
期間11-06-3011-07-02

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

指紋 深入研究「Analysis of multi-path random key pre-distribution for wireless sensor networks」主題。共同形成了獨特的指紋。

引用此