Analysis Several Point Problems Existing For Wireless Sensor Networks Security

A wireless sensor network(WSN)is a network constructed through the self-organization of a-large number of sensor nodes.Considering ongoing network security problems,considerable research is focusing on the security of WSNs from different perspectives,with the goal of ensuring that these networks are operating effectively.In terms of security issues,the problems encountered by WSNs and traditional wireless networks can widely differ based on the characteristics of the individual network.Since the resources for sensor nodes are limited,processing power,storage space,energy,and other factors can prevent the direct application of effective security protocols and algorithms to wireless sensor networks,resulting in greater security risks.Given the popular application of wireless sensor networks,the security problems experienced by WSNs are becoming increasingly concerning.Therefore,determining the most effective measures to ensure the safety of wireless sensor networks has become a common concern.In this thesis,several points for wireless sensor network security problems are studied to find new and better methods to improve the safety of these networks,and better promote their development.Our goal achieves better large wireless sensor networks balance and obtains networks such that each has the minimum deviation and energy topology.First,we introduce the thesis architecture,including a literature review,an overview of MSNs,aspects of the problems,our research goal,and thesis outline.Second,the related wireless sensor network technology is summarized,such as the concept of a wireless sensor network,the architecture,protocol stacks,and detailed analysis of the application is provided to lay a theoretical foundation for our research.Third,proposes a security key distribution protocol in clustered wireless sensor networks.Different from genuine TMPJ scheme,which demands full retrieval of the distributed keys,the proposed protocol uses Hran secret sharing,which allows the recovery of the key by only collecting a certain number of distributed keys.The implementation of TMPJ polynomial method is improved by introducing the Lagrange method,which is extensively used in polynomial approximation in numerical integration,to effectively represent a polynomial with the minimum number of discrete points.To increase the number of entities that share the key,this thesis additionally proposes allocating virtual nodes to share the key.The proposal is evaluated with a numerical simulation using a Windows 7 personal computer and then comparing the time to complete the reconstruction of the key in several cluster sizes.Fourth,a new model for a selfish node incentive mechanism is presented with a forward game node for wireless sensor networks.We also discuss the applications of the replicator dynamics mechanism to analyze the evolutionary trend of the trust relationships among the nodes.Our research results indicated that our approach is faster and the best among all recent thesis's in that it added a new condition of cooperation between the nodes of the WSN,that these nodes can be cooperative,then forwards packets efficiently and resist small variation.Our analyses were the first among all recent thesis's to indicate that the performance of the WSNs could be enhanced due to its stability and reliability,and the same case,the deviations of only 0.031,and 0.036 existed in nodes strategy non-cooperation,and nodes strategy condition cooperation,respectively.Thus,the time is very shorter because the deviation is very small.Fifth,the thesis offers an active defense model for wireless sensor networks based on evolutionary game theory.We use evolutionary game theory to analyze the reliability and stability of WSN with malicious nodes.Adding a defense model into the strategy space of the rational nodes,and establishing a preventive mechanism,force the malicious node to abandon the attack and even switch to cooperative strategies.Thus,this thesis argues that the stability and reliability of WSNs can be improved.Numerical experiments were conducted to evaluate the proposed defense model,and these results verified our conclusions based on a theoretical analysis that showed that,compared with the existing algorithms,our approach has lower energy consumption,lower deviation,and a higher probability to quickly switch each node to cooperative strategies.In large wireless sensor networks,the numbers of nodes were 10,000,the average medium values in malicious node cooperation for each case were only 1,and in the attacker nodes,strategies and malicious node non-cooperation were each only zero.The result of that deviation was zero in the attacker nodes strategy,which is a better result given that the deviation value was 0.02.and the lower power consumption,only after malicious nodes cooperation,attacker,and malicious nodes non-cooperation equilibrium state,the defender strategies are close to zero.Finally,the contribution of this thesis is outlined,and the limitations of the research are reviewed,providing some guidance for future work.