Sink mobility aware energy-efficient network integrated super heterogeneous protocol for WSNs
- Akbar, Mariam, Javaid, Nadeem, Imran, Muhammad, Amjad, Naeem, Khan, Majid, Guizani, Mohsen
- Authors: Akbar, Mariam , Javaid, Nadeem , Imran, Muhammad , Amjad, Naeem , Khan, Majid , Guizani, Mohsen
- Date: 2016
- Type: Text , Journal article
- Relation: Eurasip Journal on Wireless Communications and Networking Vol. 2016, no. 1 (2016), p. 1-19
- Full Text:
- Reviewed:
- Description: In this paper, we propose Balanced Energy-Efficient Network Integrated Super Heterogeneous (BEENISH), improved BEENISH (iBEENISH), Mobile BEENISH (MBEENISH), and improved Mobile BEENISH (iMBEENISH) protocols for heterogeneous wireless sensor networks (WSNs). BEENISH considers four energy levels of nodes and selects cluster heads (CHs) on the base of residual energy levels of nodes and average energy level of the network, whereas iBEENISH dynamically varies the CHs selection probability in an efficient manner leading to increased network lifetime. We also present a mathematical sink mobility model and validate this model by implementing it in BEENISH (resulting in MBEENISH) and iBEENISH (resulting in iMBEENISH). Finally, simulation results show that BEENISH, MBEENISH, iBEENISH, and iMBEENISH protocols outperform contemporary protocols in terms of stability period, network lifetime, and throughput. © 2016, Akbar et al.
- Authors: Akbar, Mariam , Javaid, Nadeem , Imran, Muhammad , Amjad, Naeem , Khan, Majid , Guizani, Mohsen
- Date: 2016
- Type: Text , Journal article
- Relation: Eurasip Journal on Wireless Communications and Networking Vol. 2016, no. 1 (2016), p. 1-19
- Full Text:
- Reviewed:
- Description: In this paper, we propose Balanced Energy-Efficient Network Integrated Super Heterogeneous (BEENISH), improved BEENISH (iBEENISH), Mobile BEENISH (MBEENISH), and improved Mobile BEENISH (iMBEENISH) protocols for heterogeneous wireless sensor networks (WSNs). BEENISH considers four energy levels of nodes and selects cluster heads (CHs) on the base of residual energy levels of nodes and average energy level of the network, whereas iBEENISH dynamically varies the CHs selection probability in an efficient manner leading to increased network lifetime. We also present a mathematical sink mobility model and validate this model by implementing it in BEENISH (resulting in MBEENISH) and iBEENISH (resulting in iMBEENISH). Finally, simulation results show that BEENISH, MBEENISH, iBEENISH, and iMBEENISH protocols outperform contemporary protocols in terms of stability period, network lifetime, and throughput. © 2016, Akbar et al.
A multi-hop angular routing protocol for wireless sensor networks
- Akbar, Mariam, Javaid, Nadeem, Imran, Muhammad, Rao, Areeba, Younis, Muhammad, Niaz, Iftikhar
- Authors: Akbar, Mariam , Javaid, Nadeem , Imran, Muhammad , Rao, Areeba , Younis, Muhammad , Niaz, Iftikhar
- Date: 2016
- Type: Text , Journal article
- Relation: International Journal of Distributed Sensor Networks Vol. 12, no. 9 (2016), p.
- Full Text:
- Reviewed:
- Description: In this article, we propose two new routing protocols for wireless sensor networks. First one is AM-DisCNT (angular multi-hop distance-based clustering network transmission) protocol which uses circular deployment of sensors (nodes) for uniform energy consumption in the network. The protocol operates in such a way that nodes with maximum residual energy are selected as cluster heads for each round. Second one is iAM-DisCNT (improved AM-DisCNT) protocol which exploits both mobile and static base stations for throughput maximization. Besides the proposition of routing protocols, iAM-DisCNT is provided with three mathematical models: two linear-programming-based models for information flow maximization and packet drop rate minimization and one model for calculating energy consumption of nodes. Graphical analysis for linear-programming-based mathematical formulation is also part of this work. Simulation results show that AM-DisCNT has 32% and iAM-DisCNT has 48% improved stability period as compared to LEACH (low-energy adaptive clustering hierarchy) and DEEC (distributed energy-efficient clustering) routing protocols. Similarly, throughput of AM-DisCNT and iAM-DisCNT is improved by 16% and 80%, respectively, in comparison with the counterpart schemes. © The Author(s) 2016.
- Authors: Akbar, Mariam , Javaid, Nadeem , Imran, Muhammad , Rao, Areeba , Younis, Muhammad , Niaz, Iftikhar
- Date: 2016
- Type: Text , Journal article
- Relation: International Journal of Distributed Sensor Networks Vol. 12, no. 9 (2016), p.
- Full Text:
- Reviewed:
- Description: In this article, we propose two new routing protocols for wireless sensor networks. First one is AM-DisCNT (angular multi-hop distance-based clustering network transmission) protocol which uses circular deployment of sensors (nodes) for uniform energy consumption in the network. The protocol operates in such a way that nodes with maximum residual energy are selected as cluster heads for each round. Second one is iAM-DisCNT (improved AM-DisCNT) protocol which exploits both mobile and static base stations for throughput maximization. Besides the proposition of routing protocols, iAM-DisCNT is provided with three mathematical models: two linear-programming-based models for information flow maximization and packet drop rate minimization and one model for calculating energy consumption of nodes. Graphical analysis for linear-programming-based mathematical formulation is also part of this work. Simulation results show that AM-DisCNT has 32% and iAM-DisCNT has 48% improved stability period as compared to LEACH (low-energy adaptive clustering hierarchy) and DEEC (distributed energy-efficient clustering) routing protocols. Similarly, throughput of AM-DisCNT and iAM-DisCNT is improved by 16% and 80%, respectively, in comparison with the counterpart schemes. © The Author(s) 2016.
Efficient data gathering in 3D linear underwater wireless sensor networks using sink mobility
- Akbar, Mariam, Javaid, Nadeem, Khan, Ayesha, Imran, Muhammad, Shoaib, Muhammad, Vasilakos, Athanasios
- Authors: Akbar, Mariam , Javaid, Nadeem , Khan, Ayesha , Imran, Muhammad , Shoaib, Muhammad , Vasilakos, Athanasios
- Date: 2016
- Type: Text , Journal article
- Relation: Sensors (Switzerland) Vol. 16, no. 3 (2016), p.
- Full Text:
- Reviewed:
- Description: Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. © 2016 by the authors; licensee MDPI, Basel, Switzerland.
- Authors: Akbar, Mariam , Javaid, Nadeem , Khan, Ayesha , Imran, Muhammad , Shoaib, Muhammad , Vasilakos, Athanasios
- Date: 2016
- Type: Text , Journal article
- Relation: Sensors (Switzerland) Vol. 16, no. 3 (2016), p.
- Full Text:
- Reviewed:
- Description: Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. © 2016 by the authors; licensee MDPI, Basel, Switzerland.
An effective solution to the optimal power flow problem using meta-heuristic algorithms
- Aurangzeb, Khursheed, Shafiq, Sundas, Alhussein, Musaed, Pamir, Javaid, Nadeem, Imran, Muhammad
- Authors: Aurangzeb, Khursheed , Shafiq, Sundas , Alhussein, Musaed , Pamir , Javaid, Nadeem , Imran, Muhammad
- Date: 2023
- Type: Text , Journal article
- Relation: Frontiers in Energy Research Vol. 11, no. (2023), p.
- Full Text:
- Reviewed:
- Description: Financial loss in power systems is an emerging problem that needs to be resolved. To tackle the mentioned problem, energy generated from various generation sources in the power network needs proper scheduling. In order to determine the best settings for the control variables, this study formulates and solves an optimal power flow (OPF) problem. In the proposed work, the bird swarm algorithm (BSA), JAYA, and a hybrid of both algorithms, termed as HJBSA, are used for obtaining the settings of optimum variables. We perform simulations by considering the constraints of voltage stability and line capacity, and generated reactive and active power. In addition, the used algorithms solve the problem of OPF and minimize carbon emission generated from thermal systems, fuel cost, voltage deviations, and losses in generation of active power. The suggested approach is evaluated by putting it into use on two separate IEEE testing systems, one with 30 buses and the other with 57 buses. The simulation results show that for the 30-bus system, the minimization in cost by HJBSA, JAYA, and BSA is 860.54 $/h, 862.31, $/h and 900.01 $/h, respectively, while for the 57-bus system, it is 5506.9 $/h, 6237.4, $/h and 7245.6 $/h for HJBSA, JAYA, and BSA, respectively. Similarly, for the 30-bus system, the power loss by HJBSA, JAYA, and BSA is 9.542 MW, 10.102 MW, and 11.427 MW, respectively, while for the 57-bus system, the value of power loss is 13.473 MW, 20.552, MW and 18.638 MW for HJBSA, JAYA, and BSA, respectively. Moreover, HJBSA, JAYA, and BSA cause reduction in carbon emissions by 4.394 ton/h, 4.524, ton/h and 4.401 ton/h, respectively, with the 30-bus system. With the 57-bus system, HJBSA, JAYA, and BSA cause reduction in carbon emissions by 26.429 ton/h, 27.014, ton/h and 28.568 ton/h, respectively. The results show the outperformance of HJBSA. Copyright © 2023 Aurangzeb, Shafiq, Alhussein, Pamir, Javaid and Imran.
- Authors: Aurangzeb, Khursheed , Shafiq, Sundas , Alhussein, Musaed , Pamir , Javaid, Nadeem , Imran, Muhammad
- Date: 2023
- Type: Text , Journal article
- Relation: Frontiers in Energy Research Vol. 11, no. (2023), p.
- Full Text:
- Reviewed:
- Description: Financial loss in power systems is an emerging problem that needs to be resolved. To tackle the mentioned problem, energy generated from various generation sources in the power network needs proper scheduling. In order to determine the best settings for the control variables, this study formulates and solves an optimal power flow (OPF) problem. In the proposed work, the bird swarm algorithm (BSA), JAYA, and a hybrid of both algorithms, termed as HJBSA, are used for obtaining the settings of optimum variables. We perform simulations by considering the constraints of voltage stability and line capacity, and generated reactive and active power. In addition, the used algorithms solve the problem of OPF and minimize carbon emission generated from thermal systems, fuel cost, voltage deviations, and losses in generation of active power. The suggested approach is evaluated by putting it into use on two separate IEEE testing systems, one with 30 buses and the other with 57 buses. The simulation results show that for the 30-bus system, the minimization in cost by HJBSA, JAYA, and BSA is 860.54 $/h, 862.31, $/h and 900.01 $/h, respectively, while for the 57-bus system, it is 5506.9 $/h, 6237.4, $/h and 7245.6 $/h for HJBSA, JAYA, and BSA, respectively. Similarly, for the 30-bus system, the power loss by HJBSA, JAYA, and BSA is 9.542 MW, 10.102 MW, and 11.427 MW, respectively, while for the 57-bus system, the value of power loss is 13.473 MW, 20.552, MW and 18.638 MW for HJBSA, JAYA, and BSA, respectively. Moreover, HJBSA, JAYA, and BSA cause reduction in carbon emissions by 4.394 ton/h, 4.524, ton/h and 4.401 ton/h, respectively, with the 30-bus system. With the 57-bus system, HJBSA, JAYA, and BSA cause reduction in carbon emissions by 26.429 ton/h, 27.014, ton/h and 28.568 ton/h, respectively. The results show the outperformance of HJBSA. Copyright © 2023 Aurangzeb, Shafiq, Alhussein, Pamir, Javaid and Imran.
Modeling induction and routing to monitor hospitalized patients in multi-hop mobility-aware body area sensor networks
- Javaid, Nadeem, Ahmad, Ashfaq, Tauqir, Anum, Imran, Muhammad, Guizani, Mohsen, Khan, Zahoor, Qasim, Umar
- Authors: Javaid, Nadeem , Ahmad, Ashfaq , Tauqir, Anum , Imran, Muhammad , Guizani, Mohsen , Khan, Zahoor , Qasim, Umar
- Date: 2016
- Type: Text , Journal article
- Relation: Eurasip Journal on Wireless Communications and Networking Vol. 2016, no. 1 (2016), p.
- Full Text:
- Reviewed:
- Description: In wireless body area sensor networks (WBASNs), energy efficiency is an area of extreme significance. At first, we present a mathematical model for a non-invasive inductive link which is used to recharge the battery of an implanted biomedical device (pacemaker). Afterwards, we propose a distance-aware relaying energy-efficient (DARE) and mutual information-based DARE (MI-DARE) routing protocols for multihop mobility-aware body area sensor networks (MM-BASNs). Both the routing protocols and the non-invasive inductive link model are tested with the consideration of eight patients in a hospital unit under different topologies, where the vital signs of each patient are monitored through seven on-body sensors and an implanted pacemaker. To reduce energy consumption of the network, the sensors communicate with a sink via an on-body relay which is fixed on the chest of each patient. The behavior (static/mobile) and position of the sink are changed in each topology, and the impact of mobility due to postural changes of the patient(s) arms, legs, and head is also investigated. The MI-DARE protocol further prolongs the network lifetime by minimizing the number of transmissions. Simulation results show that the proposed techniques outperform contemporary schemes in terms of the selected performance metrics. © 2016, Javaid et al.
- Authors: Javaid, Nadeem , Ahmad, Ashfaq , Tauqir, Anum , Imran, Muhammad , Guizani, Mohsen , Khan, Zahoor , Qasim, Umar
- Date: 2016
- Type: Text , Journal article
- Relation: Eurasip Journal on Wireless Communications and Networking Vol. 2016, no. 1 (2016), p.
- Full Text:
- Reviewed:
- Description: In wireless body area sensor networks (WBASNs), energy efficiency is an area of extreme significance. At first, we present a mathematical model for a non-invasive inductive link which is used to recharge the battery of an implanted biomedical device (pacemaker). Afterwards, we propose a distance-aware relaying energy-efficient (DARE) and mutual information-based DARE (MI-DARE) routing protocols for multihop mobility-aware body area sensor networks (MM-BASNs). Both the routing protocols and the non-invasive inductive link model are tested with the consideration of eight patients in a hospital unit under different topologies, where the vital signs of each patient are monitored through seven on-body sensors and an implanted pacemaker. To reduce energy consumption of the network, the sensors communicate with a sink via an on-body relay which is fixed on the chest of each patient. The behavior (static/mobile) and position of the sink are changed in each topology, and the impact of mobility due to postural changes of the patient(s) arms, legs, and head is also investigated. The MI-DARE protocol further prolongs the network lifetime by minimizing the number of transmissions. Simulation results show that the proposed techniques outperform contemporary schemes in terms of the selected performance metrics. © 2016, Javaid et al.
A blockchain-based deep-learning-driven architecture for quality routing in wireless sensor networks
- Khan, Zahoor, Amjad, Sana, Ahmed, Farwa, Almasoud, Abdullah, Imran, Muhammad, Javaid, Nadeem
- Authors: Khan, Zahoor , Amjad, Sana , Ahmed, Farwa , Almasoud, Abdullah , Imran, Muhammad , Javaid, Nadeem
- Date: 2023
- Type: Text , Journal article
- Relation: IEEE Access Vol. 11, no. (2023), p. 31036-31051
- Full Text:
- Reviewed:
- Description: Over the past few years, great importance has been given to wireless sensor networks (WSNs) as they play a significant role in facilitating the world with daily life services like healthcare, military, social products, etc. However, heterogeneous nature of WSNs makes them prone to various attacks, which results in low throughput, and high network delay and high energy consumption. In the WSNs, routing is performed using different routing protocols like low-energy adaptive clustering hierarchy (LEACH), heterogeneous gateway-based energy-aware multi-hop routing (HMGEAR), etc. In such protocols, some nodes in the network may perform malicious activities. Therefore, four deep learning (DL) techniques and a real-time message content validation (RMCV) scheme based on blockchain are used in the proposed network for the detection of malicious nodes (MNs). Moreover, to analyse the routing data in the WSN, DL models are trained on a state-of-the-art dataset generated from LEACH, known as WSN-DS 2016. The WSN contains three types of nodes: sensor nodes, cluster heads (CHs) and the base station (BS). The CHs after aggregating the data received from the sensor nodes, send it towards the BS. Furthermore, to overcome the single point of failure issue, a decentralized blockchain is deployed on CHs and BS. Additionally, MNs are removed from the network using RMCV and DL techniques. Moreover, legitimate nodes (LNs) are registered in the blockchain network using proof-of-authority consensus protocol. The protocol outperforms proof-of-work in terms of computational cost. Later, routing is performed between the LNs using different routing protocols and the results are compared with original LEACH and HMGEAR protocols. The results show that the accuracy of GRU is 97%, LSTM is 96%, CNN is 92% and ANN is 90%. Throughput, delay and the death of the first node are computed for LEACH, LEACH with DL, LEACH with RMCV, HMGEAR, HMGEAR with DL and HMGEAR with RMCV. Moreover, Oyente is used to perform the formal security analysis of the designed smart contract. The analysis shows that blockchain network is resilient against vulnerabilities. © 2013 IEEE.
A blockchain-based deep-learning-driven architecture for quality routing in wireless sensor networks
- Authors: Khan, Zahoor , Amjad, Sana , Ahmed, Farwa , Almasoud, Abdullah , Imran, Muhammad , Javaid, Nadeem
- Date: 2023
- Type: Text , Journal article
- Relation: IEEE Access Vol. 11, no. (2023), p. 31036-31051
- Full Text:
- Reviewed:
- Description: Over the past few years, great importance has been given to wireless sensor networks (WSNs) as they play a significant role in facilitating the world with daily life services like healthcare, military, social products, etc. However, heterogeneous nature of WSNs makes them prone to various attacks, which results in low throughput, and high network delay and high energy consumption. In the WSNs, routing is performed using different routing protocols like low-energy adaptive clustering hierarchy (LEACH), heterogeneous gateway-based energy-aware multi-hop routing (HMGEAR), etc. In such protocols, some nodes in the network may perform malicious activities. Therefore, four deep learning (DL) techniques and a real-time message content validation (RMCV) scheme based on blockchain are used in the proposed network for the detection of malicious nodes (MNs). Moreover, to analyse the routing data in the WSN, DL models are trained on a state-of-the-art dataset generated from LEACH, known as WSN-DS 2016. The WSN contains three types of nodes: sensor nodes, cluster heads (CHs) and the base station (BS). The CHs after aggregating the data received from the sensor nodes, send it towards the BS. Furthermore, to overcome the single point of failure issue, a decentralized blockchain is deployed on CHs and BS. Additionally, MNs are removed from the network using RMCV and DL techniques. Moreover, legitimate nodes (LNs) are registered in the blockchain network using proof-of-authority consensus protocol. The protocol outperforms proof-of-work in terms of computational cost. Later, routing is performed between the LNs using different routing protocols and the results are compared with original LEACH and HMGEAR protocols. The results show that the accuracy of GRU is 97%, LSTM is 96%, CNN is 92% and ANN is 90%. Throughput, delay and the death of the first node are computed for LEACH, LEACH with DL, LEACH with RMCV, HMGEAR, HMGEAR with DL and HMGEAR with RMCV. Moreover, Oyente is used to perform the formal security analysis of the designed smart contract. The analysis shows that blockchain network is resilient against vulnerabilities. © 2013 IEEE.
Malicious node detection using machine learning and distributed data storage using blockchain in WSNs
- Nouman, Muhammad, Qasim, Umar, Nasir, Hina, Almasoud, Abdullah, Imran, Muhammad, Javaid, Nadeem
- 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.
- 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.
Electricity theft detection for energy optimization using deep learning models
- Pamir, Javaid, Nadeem, Javed, Muhammad, Houran, Mohamad, Almasoud, Abdullah, Imran, Muhammad
- Authors: Pamir , Javaid, Nadeem , Javed, Muhammad , Houran, Mohamad , Almasoud, Abdullah , Imran, Muhammad
- Date: 2023
- Type: Text , Journal article
- Relation: Energy Science and Engineering Vol. 11, no. 10 (2023), p. 3575-3596
- Full Text:
- Reviewed:
- Description: The rapid increase in nontechnical loss (NTL) has become a principal concern for distribution system operators (DSOs) over the years. Electricity theft makes up a major part of NTL. It causes losses for the DSOs and also deteriorates the quality of electricity. The introduction of advanced metering infrastructure along with the upgradation of the traditional grids to the smart grids (SGs) has helped the electric utilities to collect the electricity consumption (EC) readings of consumers, which further empowers the machine learning (ML) algorithms to be exploited for efficient electricity theft detection (ETD). However, there are still some shortcomings, such as class imbalance, curse of dimensionality, and bypassing the automated tuning of hyperparameters in the existing ML-based theft classification schemes that limit their performances. Therefore, it is essential to develop a novel approach to deal with these problems and efficiently detect electricity theft in SGs. Using the salp swarm algorithm (SSA), gate convolutional autoencoder (GCAE), and cost-sensitive learning and long short-term memory (CSLSTM), an effective ETD model named SSA–GCAE–CSLSTM is proposed in this work. Furthermore, a hybrid GCAE model is developed via the combination of gated recurrent unit and convolutional autoencoder. The proposed model comprises five submodules: (1) data preparation, (2) data balancing, (3) dimensionality reduction, (4) hyperparameters' optimization, and (5) electricity theft classification. The real-time EC data provided by the state grid corporation of China are used for performance evaluations via extensive simulations. The proposed model is compared with two basic models, CSLSTM and GCAE–CSLSTM, along with seven benchmarks, support vector machine, decision tree, extra trees, random forest, adaptive boosting, extreme gradient boosting, and convolutional neural network. The results exhibit that SSA–GCAE–CSLSTM yields 99.45% precision, 95.93% F1 score, 92.25% accuracy, and 71.13% area under the receiver operating characteristic curve score, and surpasses the other models in terms of ETD. © 2023 The Authors. Energy Science & Engineering published by Society of Chemical Industry and John Wiley & Sons Ltd.
- Authors: Pamir , Javaid, Nadeem , Javed, Muhammad , Houran, Mohamad , Almasoud, Abdullah , Imran, Muhammad
- Date: 2023
- Type: Text , Journal article
- Relation: Energy Science and Engineering Vol. 11, no. 10 (2023), p. 3575-3596
- Full Text:
- Reviewed:
- Description: The rapid increase in nontechnical loss (NTL) has become a principal concern for distribution system operators (DSOs) over the years. Electricity theft makes up a major part of NTL. It causes losses for the DSOs and also deteriorates the quality of electricity. The introduction of advanced metering infrastructure along with the upgradation of the traditional grids to the smart grids (SGs) has helped the electric utilities to collect the electricity consumption (EC) readings of consumers, which further empowers the machine learning (ML) algorithms to be exploited for efficient electricity theft detection (ETD). However, there are still some shortcomings, such as class imbalance, curse of dimensionality, and bypassing the automated tuning of hyperparameters in the existing ML-based theft classification schemes that limit their performances. Therefore, it is essential to develop a novel approach to deal with these problems and efficiently detect electricity theft in SGs. Using the salp swarm algorithm (SSA), gate convolutional autoencoder (GCAE), and cost-sensitive learning and long short-term memory (CSLSTM), an effective ETD model named SSA–GCAE–CSLSTM is proposed in this work. Furthermore, a hybrid GCAE model is developed via the combination of gated recurrent unit and convolutional autoencoder. The proposed model comprises five submodules: (1) data preparation, (2) data balancing, (3) dimensionality reduction, (4) hyperparameters' optimization, and (5) electricity theft classification. The real-time EC data provided by the state grid corporation of China are used for performance evaluations via extensive simulations. The proposed model is compared with two basic models, CSLSTM and GCAE–CSLSTM, along with seven benchmarks, support vector machine, decision tree, extra trees, random forest, adaptive boosting, extreme gradient boosting, and convolutional neural network. The results exhibit that SSA–GCAE–CSLSTM yields 99.45% precision, 95.93% F1 score, 92.25% accuracy, and 71.13% area under the receiver operating characteristic curve score, and surpasses the other models in terms of ETD. © 2023 The Authors. Energy Science & Engineering published by Society of Chemical Industry and John Wiley & Sons Ltd.
- «
- ‹
- 1
- ›
- »