簡易檢索 / 詳目顯示
| 研究生： |
廖俊傑 Jun-jie Liao |
|---|---|
| 論文名稱： |
無線感測網路中互斥金鑰池之金鑰預先分發機制設計 Disjoint Pools Key Pre-distribution Scheme for Wireless Sensor Networks |
| 指導教授： |
陳省隆
Hsing-lung Chen |
| 口試委員: |
莊博任
Po-jen Chuang 陳郁堂 Yie-tarng Chen 阮聖彰 Shanq-jang Ruan 陳維美 Wei-mei Chen |
| 學位類別： |
碩士 Master |
| 系所名稱： |
電資學院 - 電子工程系 Department of Electronic and Computer Engineering |
| 論文出版年： | 2007 |
| 畢業學年度： | 95 |
| 語文別： | 中文 |
| 論文頁數： | 32 |
| 中文關鍵詞： | 無線感測網路 、安全性 、金鑰預先分發 、互斥金鑰池 |
| 外文關鍵詞： | Wireless sensor network, security, key pre-distribution, disjoint key pool |
| 相關次數： | 點閱：248 下載：1 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
無線感測網路是由一群低成本、低耗電的感測節點所組成的網路結構，每個感測節點收集資訊後，將其傳送給基地台，為了避免資訊在傳送的過程中被敵人竊取，必須將資料加密後再傳送出去。由於節點的能源有限，計算複雜的非對稱式加密系統並不適用於無線感測網路，而近年來的研究多使用金鑰預先分發機制。
本論文提出了一種隨機金鑰預先分發機制，稱為互斥金鑰池預先分發機制，此機制利用數個一樣大小且互斥的金鑰池，每個節點從這數個金鑰池中隨機挑選兩個金鑰池，並從這兩個金鑰池中隨機挑選金鑰。在效能評估上，我們提出數學公式說明本機制對於被入侵節點有較佳的抗性，且能夠提供較佳的支援節點數。
A Wireless sensor network（WSN）is a network consisting of a set of low-cost and power-constrained sensor nodes. Each sensor node gathers data and transmits them to the base station. To avoid adversary’s eavesdropping, data have to be encrypted. Due to resource constrained, the public-key schemes are not suitable for wireless sensor networks. Recent researches tend to focus on key pre-distribution.
In this paper, we propose a new random key pre-distribution scheme, named Disjoint Pools Key Pre-distribution. Each sensor node randomly selects two key pools from several disjoint key pools, and chooses keys from these two key pools. The simulation results and the analysis show that our scheme improves the resilience against node capture, and support good maximum network size.
[1] I. F. Akyildiz, W. Su, Y. Sankarasubranmaniam, and E. Cayirci, “A survey on sensor networks,” IEEE Communications Magazine, vol. 40, pp. 102-114, Aug. 2002.
[2] MICA Motes, http://www.xbow.com/Products/Product_pdf_files/Wireless_pdf/MICA.pdf.
[3] Tina OS, http://www.tinyos.net/.
[4] B. C. Neuman and T. Tso, “Kerberos: An authentication service for computer networks,” IEEE Communications Magazine, vol. 32, pp. 33-38, Sep. 1994.
[5] W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, pp. 644-654, Nov. 1976.
[6] R. L. Rivest, A. Shamir, and L. M. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, pp. 120-126, Feb. 1978.
[7] L. Eschenauer and V. D. Gligor, “A keymanagement scheme for distributed sensor networks,” Proceedings of the 9th ACM Conference on Computer and Communication Security, pages 41-47, Nov 2002.
[8] H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks,” Proceedings of the 2003 IEEE Symposium on Security and Privacy, 2003.
[9] M.G. Sadi, Dong Seong Kim, and Jong Sou Park, “GBR: grid based random key predistribution for wireless sensor network,” Proceedings of 11th International Conference on Parallel and Distributed Systems, vol. 2, pp. 310-314, 2005.
[10] W. Du, J. Deng, Y. S. Han, and P. K. Varshney, “Sensor networks: A pairwise key pre-distribution scheme for wireless sensor networks,” Proceedings of the 10th ACM conference on Computer and communications security, Oct.. 2003.
[11] R. Blom, “An optimal class of symmetric key generation systems,” Advances in Cryptology: Proceedings of EUROCRYPT 84 (Thomas Beth, Norbert Cot, and Ingemar Ingemarsson, eds.), Lecture Notes in Computer Science, Springer-Verlag, 209:335–338, 1985.
[12] M. Eltoweissy, M. Moharrum, and R. Mukkamala, “Dynamic key management in sensor networks,” IEEE Communications Magazine, vol. 44, pp. 122-130, Apr. 2006.
[13] D. Liu, and P. Ning, “Establishing pairwise keys in distributed sensor networks,” ACM Transactions on Information and System Security, vol. 8, pp. 68-78, Feb. 2005.
