Detection and Mitigation of Node Replication with Pulse Delay Attacks in Wireless Sensor Network Sachin Umrao
Deeksha Verma
Arun Kumar Tripathi
Dept. of Computer Applications Krishna Institute of Engineering and Technology, Ghaziabad, India
[email protected]
Dept. of Computer Applications Kanpur Institute of Technology, Kanpur, India
[email protected]
Associate Professor Krishna Institute of Engineering and Technology, Ghaziabad, India
[email protected]
Abstract— Wireless sensor network (WSN) is made up two or more interconnected sensor nodes wirelessly. These nodes may be deployed either in open or closed environment. As these nodes communicates wirelessly and deployed in open environment there are always threat of security of nodes as well as data communicated. In order to making secure communication over WSN there should be some security mechanism. In this paper a common security mechanism is proposed to mitigate pulse delay attack and node replication. This mechanism includes detection and then mitigation.
WSN are not secure as wired connection, because it faces many security issues that are not only usual security threats but also faces major attacks which includes the Active attack, and Passive attack
Index Terms— WSN, mitigation, Ad-hoc, pulse delay attack, intruder, node replication attack, countermeasure.
INTRODUCTION Wireless sensor network [1] is large collection of nodes. As sensor nodes communicate through wireless communication link, the network can be simply hacked and invaded. Wireless sensor network can be formed with the help of three or more sensor nodes and can communicate on-air [2]. Sensor nodes have limited energy, processing and storage capacity. Sometimes if the bandwidth is low then this arises challenge for the security in wireless sensor network. The Wireless sensor networks are self organizing and self configuring in nature[]. In WSN the data flows from one sensor node to another by the applied routing algorithm [3]. WSN can suffer from the attack of intruders. An intruder can read or modify the information. WSN have some special features that make them different from other networks such as wired network. These features are given below WSN are self organizing and self configuring in nature. Topology of WSN is not fixed because number of sensor nodes may vary time to time. Sensor nodes holds very restricted resources, like battery life, memory space and processor’s capability. Wireless sensor nodes are centrally controlled. In WSN data flows from one sensor node to another sensor node by the applied routing algorithm.
c 978-1-4799-1626-9/13/$31.00 2013 IEEE
Fig.1. Types of Security Attacks
Active Attack- when unauthorized user (Intruders or attackers) listen the transmission (Data stream) and modify the information during the transmission is known as active attacks. Active attacks are of following types- Routing Attacks, Node Replication Attack, Message corruption , Denial of Service Attack, Physical Attack, Node Outage, Node Malfunction, Node subversion, False Node, Passive information Gathering. Passive attack- when unauthorized user (Intruders or attackers) listen or monitors the transmission (Data stream) is known as passive attacks. Passive attacks are of following types- Monitor & Eavesdropping, Camouflages Adversaries, and Traffic Analysis. Rest of the paper is organized as follows where second section is for the related work and then third section is for the problem identified and after that proposed work in which the counter part is discussed. At last the conclusion and future work is discussed.
390
RELATED WORKS There are many protocols for Secure Pair Wise Synchronization (SPS) [4] protocol is consider as sender – receiver [5, 6] based protocol and node replication attack. SPS [5, 6] firstly sender gets synchronized with the receiver, if they will get synchronized then only it starts communication and also checks the delay time from sending to receiving response and id delay is less or equal to the assumed delay then only it will start communication otherwise it will terminate the message transmission to avoid the pulse delay attack. Where as in paper ‘Security attacks and their countermeasures in wireless sensor network along with node replication attack’ [8] all types of attacks in wireless sensor network are discussed with their effects. the proposed algorithm[8] is to overcome the node replication attack. This algorithm detects the replicated node and then differentiates among the original node and its replicated copy. After finding the replicated copy it will terminate the communication with replicated copy. PROBLEMS IDENTIFIED It is found that there are many problems in existing security solutions of wireless sensor network, some solutions are fit for node replication attack and some are for pulse delay attack, but there is not a single solution to counter both attacks at a time. In the paper ‘Security attacks and their countermeasures in wireless sensor network along with node replication attack’ [8] the whole discussion is about the attacks specially node replication attack. Here the main focus was only to find the replicated copy (clone) and after finding clone in termination of the communication and removal of that node from the network. There may arise the problem when any intruder or snooper snoops the message transmission between two nodes, it may store the message pulses and then retransmits the message after some modifications. This problem is known as pulse delay attack [9].
message and retransmit message after some modification. This attack is known as node replication attack.
Fig.2. Pulse delay and node replication Attack in WSN
PROPOSED WORK In order to overcome the problem identified one algorithm is proposed which is combined effort to protect WSN from pulse delay and node replication attack. Before applying this algorithm there are some assumption like all the nodes are in same network, all nodes activated at same time i.e. T1 and the replicated copy introduced in network after some time.
On the other hand Time Synchronization protocol in wireless sensor network [9] is used to detect and counter the pulse delay attack .In this paper, the pulse delay attack are uncovered through a comparison of the computed message end-to-end delay (d), with maximum expected message delay (d*). If the calculated delay is greater than the maximum expected delay, it means there is any intruder in the network who is disturbing the communication. But here [9] the main problem was that there may also be the clone or replicated copy of node which may challenge itself as genuine node and can divert the communication to fake node or can steel confidential information. In figure 2 the problem which is to be discussed is shown. In this figure there are five nodes P1 to P5 and a server. There is also a replicated or clone node of node P4, which shows the node replication attack. There is also an intruder I between server and node P4 who snoops the transmission, it stores the
Fig.3. Proposed Algorithm
2013 IEEE International Conference in MOOC, Innovation and Technology in Education (MITE)
391
CONCLUSION AND FUTURE WORK
In the above algorithm Ti and Tj represents clock timing of sensor nodes P. and Np represents nonce bit and d is end to end delay and d* is maximum expected delay. According to this algorithm at first all nodes and server will activate and session layer will record the activation time of all nodes after that server will authenticate every nodes periodically. If there is any entry of new node then it will match its id with all the previous nodes and if it matches then abort connection otherwise it will start authentication process. In authentication process server will send a synchronization message to the node which will contain the id of sender and receiver node (Pi, Pj), nonce bit (Np), synchronization message (sync). After that receiver will send response, which will contain node id of both sender and receiver, sending and receiving time (Tj, T’j), acknowledgement (ack), and an encrypted packet of this information by MAC having the key Kij. Then server will calculate end to end delay (d) and compare it with the maximum expected delay (d*) , if the calculated delay(d) is less or equal to the expected delay(d*) then it will start the communication. This algorithm can be easily understood with the help of the flow chart shown in figure 4.
By using this proposed approach the problem of pulse delay attack and node replication attack or clone attack can be detected and mitigated. This approach will make the wireless communication secure and reliable. This type of efforts can increase security of wireless sensor networks. In future researchers may focus on the implementation of this algorithm in network simulation tools and also try to make it energy efficient, better, secure and cost efficient. REFERENCES [1] Mukherjee, B, Ghoshal, D., Yick, J.: Wireless Sensor network survey. Computer Network 52(12), 22922330(2008) [2] Zhenwei Yu, Jeffrey J.P. Tsai.A Framework of Machine Learning Based Instruction Detection for Wireless Sensor Networks, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing.2008 [3] Kopetz, H., Ochsenreiter, W.: Clock Synchronization in Distributed Real- Time System. IEEE Transactions on Computers 36(8),933-940(1987) [4] Ganeriwal, S., Popper, C., Capkun, S., Srivastava, M.B.: Secure Time Synchronization in Sensor Networks, ACM Transaction on Information and system security, Article No: 23,11(4)(2008) [5] Li, H., Chen, K., Wen, M., Zheng, Y.: A Secure Time Synchronization Protocol for sensor Network. In: Washio., Zhou, Z-H., Huang, J.Z., Hu, X., Li, J., Xie, C., He, J., Zou, D., Li, K-C., Freire, M.M.(eds.) PAKDD 2007. (LNAI), vol. 4819, pp. 515-526. Springer, Heidelberg(2007) [6] Song, H., Zhu, G.C.S.: Attack resilient time synchronization for wireless sensor network In: IEEE International conference on Mobile Adhoc and Sensor System Conference, p. 772(2005) [7] Wang, C., Ning, P., Sun, K.: Secure and resilient clock synchronization in wireless sensor networks. IEEE Journal on Selected Areas in Communications 24(2), 395408(2006). [8] Sachin Umrao and A.K.Tripathi “Security attacks and their countermeasures in wireless sensor network along with node replication attack” in IEEE conference ICANMEET2013, pp.653-658, 2013. [9] Sachin Umrao and A.K.Tripathi “Time synchronization protocol in wireless sensor network based on hash code” International Journal of Computer Applications (IJCA), Vol-68 Number 23, article no. 6, 2012.
Fig.4.flow chart for Proposed Algorithm
392
2013 IEEE International Conference in MOOC, Innovation and Technology in Education (MITE)
