隨著VLSI技術的進步,使得無線感測網路在近年來蓬勃發展成為一種新興的無線網路型態,並且擁有許多應用,如環境監控,軍事偵測。但由於硬體上的限制以及應用場景的特性,在執行感測節點偵測的任務之外,並加上安全性的考量,來抵抗惡劣環境以及敵方的攻擊,成為無線感測網路相當重要的研究重點。

本論文研究目的,是在大多數的無線感測網路有關安全性所提出的金鑰預佈機制中,針對使用部署知識下,根據不同的障礙物環境重新分配子金鑰池的共享金鑰比例,亦即針對不同障礙物情況下重新分佈每個子金鑰池中金鑰共享的數目,以達到在障礙物周圍有較強的連結性,並且減少無謂的金鑰浪費,經場景模擬驗證,我們發現的確能有效提高連結性,並維持一定的安全性。

Because of the development and advancement of VLSI technology recently, wireless sensor networks become a new emerging type of wireless networks, and it has many novel kinds of applications such as environment monitoring, military detection. But with the limitation of hardware and characteristic of application scenario, it is a vital important research issue for wireless sensor networks owing to the consideration of security against bad environment and malicious attacks.
The purpose of our thesis is as follows, based on many researches related to key pre-distribution for security issue on wireless sensor networks using deployment knowledge, we redistribute the common ratio of sub-key-pool according to the obstacles circumstances, namely we reallocate the number of common key of each sub-key-pool in order to enhance the communication connectivity around obstacles and reduce unnecessary key assignments. we find out it do improve the connectivity effectively and maintain the security via simulation.

[1] B.C. Neuman and T. Tso, “Kerberos: An authentication service for computer
networks,” IEEE Communication Magazine, vol. 32, no. 9, pp. 33-38, Sept. 1994.
[2] R. L. Rivest, A. Shamir and L. Adleman, “A method of obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, mo. 2, pp.120-126, Feb. 1978.
[3] M.O. Rabin, “Digitalized signatures and public key functions as intractable as
factoring”. Technical Report 212, Laboratory for Computer Science, Cambridge,
Mass., 1979.
[4] L. Eschenauer and V.D. Gligor, “A key-management scheme for distributed sensor networks,” Proceedings of Ninth ACM Conf. Computer and Comm. Security (CCS), pp. 41-47, 2002.
[5] H. Chan, A. Perrig and D. Song, “Random key predistribution schemes for sensor networks,” in IEEE Symposium on Research in Security and Privacy, pp. 197-213, 2003.
[6] W. Du, J. Deng, Y. S. Han and P. K. Varshney, “A key predistribution scheme for sensor networks using deployment knowledge,” IEEE Transactions on Dependable and Secure Computing, vol. 3, no. 1, Jan.-March 2006.
[7] Du, W., Deng, J., Han, Y. S., Chen, S., and Varshney, P. 2004. A key management scheme for wireless sensor networks using deployment knowledge. In Proceedings of IEEE INFOCOM'04.
[8] M. Mauve、J. Widmer and H. Hartenstein, “A survey on position based routing in mobile ad-hoc networks,” IEEE Network Magazine 15(6) (2001) 30–39.
[9] E. M. Royer, C. K. Toh, “A Review of Current Routing Protocols for Ad Hoc
Mobile Wireless Networks,” IEEE Pers. Commun., vol. 6, no. 2, Apr., 1999.
[10] Z.Jiang, J.Ma, Wei Lou, Jie Wu, "An information model for geographiic greedy forwarding in wireless ad-hoc sensor networks", IEEE INFOCOM 2008 proceedings.
[11] Nadeem Ahmed , Salil S. Kanhere , Sanjay Jha, The holes problem in wireless sensor networks: a survey, ACM SIGMOBILE Mobile Computing and Communications Review, v.9 n.2, April 2005 .
[12] Akyildiz, I.F., Weilian Su, Sankarasubramaniam, Y., Cayirci, E.,”A survey on sensor networks”, in proc. of Communications Magazine, IEEE, Volume 40, Issue 8, Aug. 2002 Page(s):102-114
[13] C.S Reghavendra, Krishna M. Sivalinkgan and Taieb Znati, “Wireless Sensor Networks”, Springer 2006.
[14] David Culler, Deborah Estrin, and Mani Srivastava, “Overview of sensor networks,” IEEE Computer, Special Issue In Sensor Networks, vol, 37, Issue 8, pp.41-49,Aug. 2004.
[15] Liu and P. Ning, “Establishing pairwise keys in distributed sensor networks,”
Proceedings of 10th ACM Conf. Computer and Comm. Security (CCS), pp. 52-61,2003.
[16] C. Boyd and A. Mathuria, Key establishment protocols for secure mobile
communications: A selective survey, in: Australasian Conference
on Information Security and Privacy (1998) pp. 344–355.
[17] D. Johnson and D. Maltz, Mobile Computing, Chap. 5-Dynamic Source Routing, Kluwer Academic Publishers, 1996, pp.153-81.
[18] C. Perkins and E. Royer, “Ad-hoc on-demand Distance Vector Routing,” Proc. 2nd IEEE Wksp. Mobile Comp. Sys. App.,Feb. 1999, pp.90-100.