Secured flooding time synchronization protocol with moderator

Abstract

SUMMARYThis work aims to address the security vulnerability of the Flooding Time Synchronization Protocol (FTSP), which is currently one of the most popular approaches for time synchronization in wireless sensor networks. FTSP has advanced features, such as implicitly dynamic topology and high time accuracy, but still has unresolved security issues. In order to defend against attacks from malicious nodes, we propose several technologies to reinforce the structure of FTSP. First, a reference node selecting mechanism is proposed to reduce the effect of multiple reference nodes, and four filters are proposed to defend against seqNum attack, global time attack and node replication attack. Experiment results show that the proposed sequence number blacklist filter and the global time blacklist filter are effective in defending against the aforementioned attacks. Second, a new root selection mechanism is proposed to secure the process of updating the root node. Combining the root selection mechanism with the global time black list filter, the proposed mechanisms successfully defend against traitor attacks on FTSP in our experiment. Copyright © 2013 John Wiley & Sons, Ltd.

Dynamic and adaptive detection method for flooding in wireless sensor networks

“… , . However, several solutions are proposed to secure different aspects of these networks, for example, data aggregation, routing protocols, and time synchronization protocols . In addition, clustering technique is usually used for the design of security mechanisms used in WSNs .…”

“…However, several solutions are proposed to secure different aspects of these networks, for example, data aggregation, 13 routing protocols, 14 and time synchronization protocols. 15 In addition, clustering technique is usually used for the design of security mechanisms used in WSNs. 16,17 In this section, we present some proposed techniques and protocols to secure hierarchical WSNs, particularly those which treated the detection of DoS attacks.…”

Hough Transform-Based Clock Skew Measurement by Dynamically Locating the Region of Offset Majority

“…, then the time complexity is: where a, b and c are constants; an denotes the computation time at lines 6-9, bn log n is the sorting method time, cn is the time required by the for loop at line [11][12][13][14][15][16][17][18][19][20]. c ω may increase when the delay jitter is high, but the value of n can be bounded in a few thousand, which is sufficient for the modified HT-based method to give a stable and precise estimation.…”

An efficient statistical approach for time synchronization in wireless sensor networks

“…The derivative (the rate of variation) of the relative clock offset gives the relative clock skew. Protocols have been proposed for synchronization in more complex network structures [12,13]. Practically speaking, a pair of nodes are synchronized by estimating the relative clock offset and relative clock skew between the nodes.…”

“…Practically speaking, a pair of nodes are synchronized by estimating the relative clock offset and relative clock skew between the nodes. Recent advancements in time synchronization protocol lead to design of different mechanisms to overcome the security issues in FTSP [16]. When a pair of sensor nodes exchange the timing message, a group of neighboring sensors overhear those messages and synchronize themselves accordingly [8].…”