An Adaptive Key Predistribution Model for Distributed Sensor Networks

• Main Authors: Chen-Chung Chang, 張振忠
• Other Authors: Chi-Sung Laih
• Format: Others
• Language: en_US
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/85994310854715116409

碩士 === 國立成功大學 === 電腦與通信工程研究所 === 95 === Because of the advancement of VLSI technology in recently years, Distributed Sensor Networks (DSNs) become a new developing type of wireless networks, which bring many novel applications. DSNs have many rigorous restrictions as a result of the application environment and hardware ability. Hence, it is a difficult but significant research topic that how to implement security into DSNs against many known and unknown attacks. In this thesis, we propose a key predistribution model with a novel concept of key pool generation, which is different from most existing schemes. The hidden information is inserted into each key when key pool is generated. Nodes can use the function to obtain the hidden additional information from condition-satisfied keys. The additional information can elevate system performance. Based on above conception, we proposed PTS and POSS schemes, which are based on threshold scheme and OSS signature scheme respectively. We can know that the additional information improved great progress connectivity between nodes by simulated results even if the node deployment is sparse or nonuniform. Beside, the property of high connectivity speeds up the time of secure link establishment in sensor network as well as provides rapid message response. In addition, the high connectivity also decreases the energy consumption of wireless communication between sensor nodes to extend the life of nodes. These properties provide the wireless DSNs designers to adjust the appropriate network performance for different application requirements.