scholarly journals An Efficient and Self-Adapting Localization in Static Wireless Sensor Networks

Sensors ◽  
2009 ◽  
Vol 9 (8) ◽  
pp. 6150-6170 ◽  
Author(s):  
Guodong Teng ◽  
Kougen Zheng ◽  
Wei Dong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Static Wireless Sensor Networks

Key Management for Static Wireless Sensor Networks With Node Adding

2014 ◽  
Vol 10 (2) ◽  
pp. 1133-1143 ◽  
Author(s):  
Filippo Gandino ◽  
Bartolomeo Montrucchio ◽  
Maurizio Rebaudengo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Wireless Sensor ◽  
Static Wireless Sensor Networks

scholarly journals A Dynamic ID Assignment Mechanism to Defend Against Node Replication Attack in Static Wireless Sensor Networks

2018 ◽  
Vol 3 (1) ◽  
Author(s):  
Mojtaba Jamshidi ◽  
Abdusalam Abdulla Shaltooki ◽  
Zahra Dagal Zadeh ◽  
Aso Mohammad Darwesh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Tree Architecture ◽  
Wireless Sensor ◽  
Dynamic Id ◽  
Comparison Results ◽  
Exchange Information ◽  
Shared Key ◽  
Static Wireless Sensor Networks ◽  
Novel Algorithm

One of the known dangerous attacks against wireless sensor networks (WSNs) is node replica. In this attack, adversary captures one or more normal nodes of the network, generates copies of them (replicas) and deploy them in the network. These copied nodes are controlled by the adversary which can establish a shared key with other nodes of the network easily and exchange information. In this paper, a novel algorithm is proposed to defend against this attack in static sensor networks. The proposed algorithm employs a multi-tree architecture to assign ID to the nodes dynamically and prevent attachment of the injected replica nodes to the network by the adversary. The efficiency of the proposed algorithm is evaluated in terms of memory, communication, and computation overheads and the results are compared with other existing algorithms. Comparison results indicate the superiority of the proposed algorithm in terms of mentioned measures. In addition, the proposed algorithm is simulated and its efficiency is evaluated in terms of probability of detecting replica nodes. Experiment results show that the proposed algorithm has favorable performance in detection of replica nodes.

scholarly journals Efficient Hybrid Detection of Node Replication Attacks in Mobile Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Ze Wang ◽  
Chang Zhou ◽  
Yiran Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sensor Networks ◽  
Local Area ◽  
Wireless Sensor ◽  
Node Mobility ◽  
Mobile Sensor ◽  
Mobile Nodes ◽  
Hybrid Detection ◽  
Static Wireless Sensor Networks

The node replication attack is one of the notorious attacks that can be easily launched by adversaries in wireless sensor networks. A lot of literatures have studied mitigating the node replication attack in static wireless sensor networks. However, it is more difficult to detect the replicas in mobile sensor networks because of their node mobility. Considering the limitations of centralized detection schemes for static wireless sensor networks, a few distributed solutions have been recently proposed. Some existing schemes identified replicated attacks by sensing mobile nodes with identical ID but different locations. To facilitate the discovery of contradictory conflicts, we propose a hybrid local and global detection method. The local detection is performed in a local area smaller than the whole deployed area to improve the meeting probability of contradictory nodes, while the distant replicated nodes in larger area can also be efficiently detected by the global detection. The complementary two levels of detection achieve quick discovery by searching of the replicas with reasonable overhead.

Sign in / Sign up

Export Citation Format

Share Document