Research On Secure Localization Algorithm For Mobile Sensor Networks

As focus of new technology,mobile wireless sensor networks combine sensor technology,signal processing and wireless communication technology,and play an important role in many areas instead of humanity.The accurate positioning is one of the important services provided by wireless sensor network.In many practical applications,location of explicit object or event is required.The study of mobile node localization is matured,and Monte Carlo localization algorithm and a number of derivatives algorithm are most widely used.But in practical application,the positioning process is highly vulnerable to attacks of malicious nodes because of the mobility of mobile sensor nodes and natural factors.There is an urgent need to focus on the study of security issues.This paper focuses on the research of secure localization algorithm for mobile wireless sensor networks.In order to achieve the target that the algorithm can detect malicious nodes and delete malicious nodes,we improve the Monte Carlo localization algorithm.The study includes the following aspects:(1)An overview of mobile node localization technology in wireless sensor network is introduced.It also introduces the classic Monte Carlo localization algorithm in detail including MCL algorithm and MCB algorithm.(2)The multiple forms of attacks including wormhole attack,sybil attack,spoofing attack and relay attack model are studied,and then analyzes the working principles and mechanism as well as the damage to the localization.Several secure localization algorithms which are current widely used for wireless sensor network are studied,and the algorithm of ideas and innovation are introduced,and the reliability of positioning from the different angle of positioning processes is improved.At the same time,the common methods of detecting and defending wormhole attacks are summarized.(3)It deeply studies the process and ideas of Monte Carlo localization algorithm.The wormhole attack in WSN will introduces the wrong anchor node information,which will affect the process of establishing the anchor box in the first phase of the MCB positioning method.To solve this problem,a new Monte Carlo secure algorithm which can defeat wormhole attack is proposed,named DWMCB,which takes advantages of position relation and mobility of nodes to identify and filter out false anchor information.(4)Parameters of simulation are set to verify the reliability of the algorithm in a certain network model and the wormhole attack model.The experiments are done on MATLAB.Respectively,it simulates the MCB algorithm,MCB algorithm which are under wormhole attack and the DWMCB algorithm.And the positioning error values of the three algorithms are compared.Simulations of node speed,anchor node density and node density,whose impact on the localization performance are analyzed.T he results show that the positioning error of DWMCB algorithm is less than MCB algorithm which is under wormhole attacks.The simulation results show that the DWMCB algorithm can identify and eliminate the false anchor node information,and effectively resist the wormhole attack.