Font Size: a A A

Reseach On Routing Authentication And Security Mechanisms For IPv6 Wireless Sensor Network

Posted on:2016-03-20Degree:MasterType:Thesis
Country:ChinaCandidate:W Y QinFull Text:PDF
GTID:2308330473453589Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
With the development of embedded technology and wireless communication technology, wireless sensor networks are widely used in industrial control, environmental monitoring etc. Although wireless sensor networks have broad prospects of application, there are a number of imperative issues to address. Wireless sensor networks are generally deployed in unattended adverse environment,where the nodes are battery powered and it is not easy to replenish once the energy runs out. The sensor nodes are usually designed for simple data processing rather than running complicated security algorithms. These problems become obstacle to the promotion and application of wireless sensor networks in real life.To address security attacks in WSNs, this thesis has conducted some research in the security of wireless sensor networks from the following three aspects.First of all, this thesis proposes a new path-sequence-based routing detection and authentication mechanism(PSRD). This mechanism fulfills routing detection and authentication by verifying the path-sequence of each packet, to ensure the correctness of the routing rules and the authenticity of data. Unlike the traditional means of authentication, our mechanism does not require running any encryption algorithm or hash operation. We replace the complex cryptographic operations with simple searching and matching operation. Through simulation experiments in Contiki, the path-sequence-based scheme for authentication proposed in this thesis significantly reduces computation overhead and power consumption, time delay of the sensor nodes to the greatest possibility.In addition, this thesis proposes a lightweight permutation encryption algorithm G-PEC which applies to WSN. The principle of the algorithm is that it only encrypts the global coding vector part. the global coding vector will hide into plaintext without changing the relative order of plaintext. Then, the algorithm is analysized from the aspects of encryption complexity, the computational cost and the ability against eavesdropping attacks.Finally, a signature scheme against pollution attacks based on linear network coding is improved. We adopt a new homomorphic signature function in which the intermediate node can independently produce signatures for the output message, but not generate the valid signature for the polluted or faked news package. The proposed scheme, which does not need an additional secure channel and provide the source message authentication, can achieve the same performance with GR, ZKM.
Keywords/Search Tags:WSN, Routing authentication, Network coding, Permutation encryption, Homomorphic function
PDF Full Text Request
Related items