Font Size: a A A

Research Of Based On CL-PKC And ACO Routing Protocol In Wireless Sensor Networks

Posted on:2013-06-11Degree:MasterType:Thesis
Country:ChinaCandidate:H ZhangFull Text:PDF
GTID:2248330371481117Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Wireless Sensor Networks (WSNs) are mostly deployed in the no man’s land of the wild, the network node resources is extremely limited, the dynamic topology of the network structure, self-organizing, network life cycle impact due to the node life cycle, making the routing communication and security in WSNs it is very important, designed to meet the WSNs safe routing is a huge challenge. This paper introduces the WSNs existing system structure of routing protocols, network security architecture and the SPINS security protocols framework, at different levels analyzed security requirements of WSNs and routing requirements, obtained secure routing performance requirements. Combined cenificateless public key cryptography(CL-PKC) and Ant Colony Optimization(ACO) with their respective advantages, under the framework of the SPINS security protocols, and analysis the security routing protocols framework of WSNs.Consider the security routing requirements of WSNs and existing security algorithms and ACO routing algorithm, a WSNs routing algorithm based on the CL-PKC and ACO (B-(CL-PKC)&ACO-R) is proposed in this paper. The algorithm consists of ACO routing main algorithm (DAPAS) and CL-PKC multi-node collaborative security authentication algorithm ((CL-PKC)-MNCSA). DAPAS is responsible for route building process between the Sink node to the destination node under the the Sink node query tasks of query-driven model;(CL-PKC)-MNCSA is responsible for secure authentication and communication security after the routing establishment of the path nodes in the routing. In order to overcome the dull of the pheromone of the ACO algorithm, DAPAS used real-time adaptive pheromone adjustment mechanism that related to the contribution value of the network node data. This algorithm consisted of three sub-algorithms:pheromone adaptive adjustment algorithm (PAA), determined according to the contribution and thresholds of the link data,was responsible for path pheromone self-regulation; pheromone adaptive the volatilization algorithm (PAV), adjust Pheromone volatile factor adaptive according to the query data items and node contribution counts and threshold; pheromone adaptive distributed algorithm (PAD), determine hormone distribution amount according to the node and link quality factors’s contribution to the query task. Numerous and cheap characteristics of WSNs’s nodes require safety certification is not worth relying on the traditional dedicated authentication server, so (CL-PKC)-MNCSA algorithm using neighbor collaborative certification, the certification consists of trusted nodes was divided into arbitration node, monitoring node and authentication node. Among them, authentication nodes—are responsible for node authentication; arbitration nodes—are responsible for resolving the conflict in the certification process, themselves do not participate in the certification of any node, but generate the public parameters of generation system and own strong security maintenance; guardianship nodes—guard the certification of other certification nodes, auxiliary arbitration node arbitration themselves involved in the certification of the nodes to be certified.The experimental results show that the routing of the algorithm is effective, fast convergence and better real-time and network life cycle; the algorithm in terms of the WSNs basic safety requirements, with certain anti-attack features.
Keywords/Search Tags:wireless sensor networks, security routing, certificateless cryptography, antcolony optimization, adaptive
PDF Full Text Request
Related items