Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal JOIV : International Journal on Informatics Visualization
Aso Mohammad Darwesh
University of Human Development, Sulaimani, Iraq
Computer Science & IT

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
A Dynamic ID Assignment Mechanism to Defend Against Node Replication Attack in Static Wireless Sensor Networks Mojtaba Jamshidi; Abdusalam Abdulla Shaltooki; Zahra Dagal Zadeh; Aso Mohammad Darwesh
JOIV : International Journal on Informatics Visualization Vol 3, No 1 (2019)
Publisher : Politeknik Negeri Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (749.183 KB) | DOI: 10.30630/joiv.3.1.161

Abstract

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.
A Hybrid Key Pre-Distribution Scheme for Securing Communications in Wireless Sensor Networks Mojtaba Jamshidi; Hamid Bazargan; Abdusalam Abdulla Shaltooki; Aso Mohammad Darwesh
JOIV : International Journal on Informatics Visualization Vol 3, No 1 (2019)
Publisher : Society of Visual Informatics

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (823.154 KB) | DOI: 10.30630/joiv.3.1.203

Abstract

Wireless Sensor Network (WSN) is a type of ad hoc networks which consist of hundreds to thousands of sensor nodes. These sensor nodes collaborate to surveillance environment. WSNs have a variety of applications in military, industrial and other fields and they are fit to study environments that presence of human being is costly or dangerous. Sensor nodes have memory, energy and processing limitations. According to sensors' limitations and also increasing use of these networks in military fields, establishing a secure WSN is very important and challenging. Applying Key Predistribution Schemes (KPSs) is one of the effective and useful mechanisms to provide security in WSN. In this paper, a hybrid KPS is proposed that support three various keys, primary pairwise, polynomial, and ordinary. The proposed scheme has been implemented using J-SIM simulator and its performance has been evaluated in terms of maximum supportable network sizes and resiliency against node capture attack, by performing some experiments. Simulation results have been compared with Basic, q-Composite, RS, Cluster-Based, QS, and Double-Key Hash schemes. The compared results showed that the proposed scheme has a better resiliency against links disclosing via enemies.
Co-Authors Abdusalam Abdulla Shaltooki Hamid Bazargan Mojtaba Jamshidi Zahra Dagal Zadeh