Font Size: a A A

Research On Replica Node Attacks Detection Protocal In Wireless Sensor Networks

Posted on:2013-12-07Degree:MasterType:Thesis
Country:ChinaCandidate:L Z LiuFull Text:PDF
GTID:2248330374988779Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
As wireless sensor networks are always placed in environment of Out-Door-Application and nobody care, and it ussualy do not have protective equipment, attacker can capture and compromise part of sensor nodes, crack confidential information by analysising the captured nodes, generates a large number of attacker-controlled replicas that share the compromised node’s ID, and then embed in the network, mobilize various malicious attacks, leading to the paralysis of part or all of the network. So, for the wirless sensor network sensible of security, replica node detect is very important.In this paper, in view of the insufficiency of the replica node attacks detect protols existed, were proposed two replica node detect protols respectively based on the static wireless sensor network and mobile wireless sensor network, which can conclution as follows:1) The existing replica node detect protols based on static wireless sensor network has no good consideration of problem that the nodes near the base station will die advance as they need to forward a large number of data sended by the outside nodes. In this paper, we propose CSRD Algorithm; each node maps its ID to an unique cell by using a one-way hash function. We consider the area within one hop of the base station as hotspots. Proposing that while the network is divided into several cells, it dose not include the hotspots nodes, i.e. do not produce witness node there. While sending the cliam to the destination cell, the node first computes the hops of the cliam node and the destination cell, if they are not at the same hop, it will forward the cliam to next hop neare the hop of the destination cell. Else, if they are at the same hop, it then forwards the claim to the node closer to the destination cell than itself which is at the same hop until the cliam arrives at the destination cell. With detailed anallyse we found that the algorithm has very high security, the probability of detection of clone node theoretically possibly approach100%. It also can be seen that we decrease the data load of nodes in hotspots, and increase the data load of the non-hotspots nodes. Through this way, we effectively balanced the network energy consumption, and then prolonged the network lifetime.2) The replica node detect protols based on static wireless sensor network are basically inapplicability to mobile wireless sensor network. Some papers define that an uncompromised mobile node should never move at speeds in excess of the system-configured maximum speed. In this paper, we propose a new replica node detect protol based on MLE (Maximum Likelihood Estimation). The methods of how to select a node’s destination cell, and the selection of route claim sending to the destination cell, are the same as CSRD Algorithm. The witness node compute the move speed of the cliam node through claims received previously and currently. And with several computed move speeds of the cliam node, the claim can estimate wether the cliam node is a replica using MLE. By analysing and comparing, we conclude that while guarantee the high security of data transmission, our algorithm is very effective for the balance of the network energy consumption, and can greatly improve the network lifetime.With sufficient analyses, and by compared with existing algorithms, we confirmed that the two algorithms, CSRD and MLE-CMRD, while promising the network security, detecting cloning nodes efficiently, improved the advantage of improving network lifetime.
Keywords/Search Tags:wireless sensor networks, replica nodes, communicationcost, security, network lifetime
PDF Full Text Request
Related items