Malicious node detection using machine learning and distributed data storage using blockchain in WSNs
- Authors: Nouman, Muhammad , Qasim, Umar , Nasir, Hina , Almasoud, Abdullah , Imran, Muhammad , Javaid, Nadeem
- Date: 2023
- Type: Text , Journal article
- Relation: IEEE Access Vol. 11, no. (2023), p. 6106-6121
- Full Text:
- Reviewed:
- Description: In the proposed work, blockchain is implemented on the Base Stations (BSs) and Cluster Heads (CHs) to register the nodes using their credentials and also to tackle various security issues. Moreover, a Machine Learning (ML) classifier, termed as Histogram Gradient Boost (HGB), is employed on the BSs to classify the nodes as malicious or legitimate. In case, the node is found to be malicious, its registration is revoked from the network. Whereas, if a node is found to be legitimate, then its data is stored in an Interplanetary File System (IPFS). IPFS stores the data in the form of chunks and generates hash for the data, which is then stored in blockchain. In addition, Verifiable Byzantine Fault Tolerance (VBFT) is used instead of Proof of Work (PoW) to perform consensus and validate transactions. Also, extensive simulations are performed using the Wireless Sensor Network (WSN) dataset, referred as WSN-DS. The proposed model is evaluated both on the original dataset and the balanced dataset. Furthermore, HGB is compared with other existing classifiers, Adaptive Boost (AdaBoost), Gradient Boost (GB), Linear Discriminant Analysis (LDA), Extreme Gradient Boost (XGB) and ridge, using different performance metrics like accuracy, precision, recall, micro-F1 score and macro-F1 score. The performance evaluation of HGB shows that it outperforms GB, AdaBoost, LDA, XGB and Ridge by 2-4%, 8-10%, 12-14%, 3-5% and 14-16%, respectively. Moreover, the results with balanced dataset are better than those with original dataset. Also, VBFT performs 20-30% better than PoW. Overall, the proposed model performs efficiently in terms of malicious node detection and secure data storage. © 2013 IEEE.
Buffer occupancy based DF and AF relaying in Nakagami-m fading channels
- Authors: Raza, Waseem , Javaid, Nadeem , Nasir, Hina , Imran, Muhammad , Naseer, Nidal
- Date: 2019
- Type: Text , Conference paper
- Relation: 2019 IEEE International Conference on Communications, ICC 2019, Shanghai, 20 to 24 May 2019 Vol. 2019-May
- Full Text: false
- Reviewed:
- Description: Despite significant performance gains, buffer-aided cooperative communication incurs an increased latency. It is handled by prioritizing relay-to-destination links. The contribution of this paper is two-fold, firstly, we studied buffer threshold based decode-and-forward (DF) relaying for Rayleigh fading channels in Nakagami-m fading channels. Secondly, we present the outage analysis of buffer occupancy based amplify and forward (AF) relaying by introducing a modified threshold in terms of signal to noise ratio at relay and destination, which enables the conventional Markov chain (MC) based analysis of DF relaying to work for AF relaying with slight modifications. Using this approach, we evaluate the system using MC-based analysis for outage probability, latency and throughput. The results depict that the buffer threshold based relaying can significantly decrease the latency and increase the average throughput by negotiating the outage probability. Furthermore, extensive Monte-Carlo simulations are carried out to prove the theoretical outcomes. © 2019 IEEE.
A new insight towards buffer-aided relaying in cooperative wireless networks
- Authors: Nasir, Hina , Javaid, Nadeem , Raza, Waseem , Imran, Muhammad , Shoaib, Muhammad
- Date: 2018
- Type: Text , Conference paper
- Relation: 14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018, Limassol, 25-29 June 2018 p. 839-844
- Full Text: false
- Reviewed:
- Description: This piece of work presents a novel design for buffer-aided relaying to increase the diversity gain. In this design, we used random buffer access method and associate each buffer location with its own antenna resource. Thus, each buffer location acts as an independent entity known as the virtual relay. The relay selection is based on the instantaneous strength of wireless link and the status of buffers. Markov chain is used to illustrate the growth of buffer status and to derive the closed-form expressions for the outage probability and diversity gain. The proposed design achieves the diversity gain of KL as compared to current buffer-aided max-link and max-max schemes having the diversity gain of 2K and K, respectively. Moreover, the proposed design achieves less delay at low SNR and 1+KL at high SNR. Analytical results are validated via simulation results. © 2018 IEEE.
Buffer occupancy based link prioritization for cooperative wireless networks
- Authors: Raza, Waseem , Javaid, Nadeem , Nasir, Hina , Imran, Muhammad , Yasar, Ansar
- Date: 2018
- Type: Text , Conference paper
- Relation: 14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018, Limassol, Cyprus p. 850-855
- Full Text: false
- Reviewed:
- Description: This paper presents a decisive threshold termed as the buffer-threshold to control the selection probability of source-relay (SR) or relay-destination (RD) links for the buffer aided cooperative wireless networks. The weights of the links are reassigned using buffer-threshold and a link with the maximum weight is activated. The proposed scheme is termed as Buffer-Threshold based relay selection scheme (BTRS). The relations of the outage probability (OP) and the average delay are calculated by the Markov Modelling of the buffers. Theoretical results are analyzed for different cases of the buffer-threshold and validated by the Monte-carlo simulations. For the performance evaluation BTRS is compared with the max link relay selection (MLRS) scheme and the max weight relay selection (MWRS) scheme and outperforms its counterparts in terms of the average delay. © 2018 IEEE.
Simultaneous wireless information and power transfer for buffer-aided cooperative relaying systems
- Authors: Nasir, Hina , Javaid, Nadeem , Imran, Muhammad , Shoaib, Muhammad , Anwar, Mehmoon
- Date: 2018
- Type: Text , Conference paper
- Relation: 14th International Wireless Communications and Mobile Computing Conference, IWCMC 2018, Limassol, 25-28 June 2018 p. 845-849
- Full Text: false
- Reviewed:
- Description: This paper explored cooperative relaying in the presence of energy constrained relays with data storage facility. The relays depend only on the source signal to harvest energy and forward signal to the destination. The relay is selected according to the instantaneous strength of the wireless link. The strongest link among all links on both sides i.e., source-relay and relaydestination links is selected for relay to receive or transmit data, respectively. Two protocols are used for energy harvesting and information transfer namely: 'power splitting based relaying' and 'time switching based relaying'. We evaluate the outage probability performance of the presented scheme using Monte Carlo simulations. The results show that TSR performs better than PSR protocol. © 2018 IEEE.