Research On Key Technologies For Secure Data Transmission In Wireless Sensor Networks

Along with the growing up of related technology, wireless sensor networks has been deployed in a good many of application domains, and shows its great potential. As a rising research domain in which multiple subjects intercrossed strongly, wireless sensor networks provides itself with grand significance by converging leading theory and advantaged technologies.For the opening to the outside world, shared channel and distributed control, wireless sensor networks faces much more threats than conventional networks, so there are much higher difficulty to realize security technologies.This dissertation focused on secure data transmission, a key and challenging problem in security of wireless sensor networks, and offered many contributions after doing in-depth research on key technologies, which are described as follows.An algorithm using Balanced Incomplete Block Design was presented for key predistribution. The algorithm lets the pair sensor nodes to share more than one keys, and make the key graph to be a complete graph. Using the Complementary set Design, the algorithm reinforced itself to satisfied the demand for consecutive number of nodes, and depressed the loss of key sharing probability commendably. By key slicing, the algorithm enlarged the networks' capacity by linear times and expanded the common key space by permutation count, so improved the ability to resist key analyzing and compromised node attacking.An algorithm using mask on the index vector of key chain was presented for shared-key discovery. Uing the mask on the index vector of key chain for key comparing, the algorithm reduced both computation complexity and storage overhead, and optimized the communication overhead on multi-path. To enhance security, two reinforced algorithms for increasing shared key intensity and for discovering multiple common keys were presented, they realized the randomness of the key selecting on the common key space, produced multiple shared key for pair nodes, and offered the balance of security and performance.An algorithm to implement secret sharing on multi-path with total communications costs optimized was presented. As the perfect secret sharing algorithm can not optimize the total communications costs, the algorithm combined striping and coding to realized a imperfect secret sharing. By stripe the secret into segments and coding the segments each other, the algorithm greatly minished the loss of security when optimizing the total communications costs.An error correction coding algorithm combined single parity check with multiple copies was presented. The algorithm could tolerate multiple routes' lost with low computation complexity, and admit diversified and dynamic data placement, along with trading off on fault-tolerance and data quantity transmitted. To improve workability of the algorithm and deal with error bursts, a data placement based on generalized broken diagonal was presented, which can build the data placement quickly with low computation complexity and storage overhead, and remarkably improved the ability of fault-tolerance especial the ability to tolerate unexpected mass routes' lost.