| Wireless sensor network consists of a large number of micro-sensor nodes. It can be used for testing,sensing,collecting and processing information of monitored objects and transferring the processed information back to the users. Hence they are widely applied in many fields such as military operation,country security,environmental monitoring, traffic monitoring, medical treat-men hygiene, manufacturing industry, monitoring of terrorism and disaster and so on. Due to the intrinsic properties of wireless sensor networks (such as large scale, unknown location, low computing power,the restriction of the storage space and battery power, etc), many traditional key distribution schemes, such as Diffie-Hellman protocol, KDC, RSA etc., are not suitable for sensor network. Nowadays, key pre-distribution schemes are used commonly in sensor networks, which are also the main objects of this thesis.Firstly, the characteristic and the research actuality of wireless sensor network are described in this thesis. Secondly, the existing random-based key pre-distribution schemes, such as Eschenauer-Gligor scheme and Chan-Perrig-Song scheme are discussed. Our main focus is to present the deterministic key pre-distribution schemes based on combinational designs, for example, the key pre-distribution scheme based on projective plane and on the generalized quadrangle, Transversal design and so on. Thirdly, we propose a new key pre-distribution scheme of distributed sensor networks based on rational normal curves over finite field, and its algorithm and implement. In the implementation, we focus on communication radius of nodes, the average node density, the length of average sensor path, the number of isolated nodes, and the relationship with the security connectivity probability of the network. As to the different total number of nodes, if we select the appropriate communication radius of nodes, the security connectivity probability of will be very high. |
PDF Full Text Request