Research On Broadcast Authentication Protocols And Intrusion Detection In Wireless Sensor Networks

Broadcast of information in Wireless Sensor Networks (WSN) is an important operation, forexample, for code updates, queries and membership information[1]. Broadcast authentication inWSN is a fundamental security primitive. Although symmetric key based μTESLA has beenproposed, it suffers from the weakness of low scalability which is resulted from hash chain’sfinite length, authentication in plaintext and base station’s finite communication radius.This paper presents a scalable broadcast authentication scheme named DH-μTESLA whichis the extension and improvement of μTESLA[2]and multilevel μTESLA[3]. It mainly hasfollowing three parts:1) It has proposed the (t, n)-threshold and division tree based self-re-initializable Hash chainscheme (SRHC-TD scheme), which can maintain the infinite lifecycle of Hash chains, lowoverheads, strong tolerance of message loss or fault, and the ability resist chosen plaintext attack.2) It has put forward the d-left counting Bloom filter based authentication scheme (AdlCBFscheme), which can make sure the security authentication with memory efficiency, scaleexpansion and query convenience.3) It has present the parent-tree based clustering routing algorithm (PTCR algorithm), whichcan expand the scalability of sensor networks, and make DH-μTESLA be suitable to large scalesensor networks with high density of sensors.It also presents the experimental results obtained through simulations, which havedemonstrated the advantages of the proposed protocol.In the process of running DH-μTESLA in WSN, the network always needs to execute theproactive defense. Thus, in the latter half of this paper, we also study the intrusion detection inWSNs.Intrusion detection is a signifcant application in sensor networks. Considerable literaturesindicate that adopting the coverage methods, especially the barrier coverage method can increasethe efficiency of detecting intruders. Because of the attributes of the proposed PTCR,(i.e. therotation of cluster heads and the participations of new nodes, and the uneven distribution of nodesafter running several rounds, especially800rounds), the number and density of nodes in the samelocal region is changing all the time. This enlightens us to consider the nodes as the mobiles onesand the stationary WSNs as periodly Mobile ones. It is believed that using mobile sensors can enhance coverage and avoid coverage hole instationary Wireless Sensor Networks (WSNs). However, the moving trajectories of sensors andintruders have not been investigated properly. Besides, the impacts between mobile sensors andthe impacts between a sensor and an intruder have not been discussed thoroughly. In order toaddress these problems, we first discuss the virtual potential field between sensors and intruders.Using motion similarity, we then formulate the sensor mobility by elastic collision model, and theintruder mobility by point charge model. Afterwards, we obtain the relationship between barriercoverage performance and sensor and intruder mobility. Finally, we show that the coverageperformance of Mobile Sensor Networks (MSNs) in virtual potential field can be improvedcompared to those in stationary WSNs and in general MSNs.