Mohammed Gharib
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mohammed Gharib has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Ali Movaghar
Sharif University of Technology
6 shared publications - Shahbaz Rezaei
University of California Davis CA USA
3 shared publications - Fatemeh Afghah
Clemson University
2 shared publications - Reza Entezari-Maleki
School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
2 shared publications Ali Owfi
Electrical and Computer Engineering Department, Clemson University, Clemson, SC, USA
1 shared publication- Bahram Mohammadi
Funda- mental Sciences Computer Engineering Department Computer Engineering Department Institute for Research Sharif University of Technology Iran University of Science and Technology
1 shared publication
Latest Publications
- 14 August 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 2356-2382
Secure cloud storage with anonymous deduplication using ID-based key management
- 14 August 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 2356-2382
Secure cloud storage with anonymous deduplication using ID-based key management
- 5 May 2022
- Published by Elsevier in Ad Hoc Networks
- Vol. 132
LB-OPAR: Load balanced optimized predictive and adaptive routing for cooperative UAV networks
- 5 May 2022
- Published by Elsevier in Ad Hoc Networks
- Vol. 132
LB-OPAR: Load balanced optimized predictive and adaptive routing for cooperative UAV networks
- 23 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (5) , 3851-3863
BlocKP: Key-Predistribution-Based Secure Data Transfer
Key pre-distribution schemes are promising lightweight solutions to be placed as the cornerstone of key management systems in multi-hop wireless networks. The intermediate decryption-encryption problem, however, is considered as the security threat of such schemes. Multi-path algorithms have been proposed to face such a shortcoming. Alas, these solutions are vulnerable against the node capture attack, where the attacker compromises a fraction of network nodes. In this paper, we propose BlocKP, a Blockchain-based solution to increase the resistance of the network against the node capture attack. BlocKP utilizes disjoint key-paths for a key exchange process, where the keying materials form a block at the source-side. Each key-path step generates the next block of the Blockchain until the keying materials reach the destination. BlocKP is a general framework applicable to any key pre-distribution schemes. We propose BlocKP in two versions BlocKP-I and BlocKP-II, where the latter enhance the resistance of BlocKP-I using erasure codes at the cost of negligible control traffic. We analytically show that BlocKP improves the resistance of the network against the node capture attack to almost perfect resistance, using just a small number of paths. We evaluate our solution by performing extensive simulations, considering three baseline key pre-distribution schemes, including probabilistic asymmetric key pre-distribution (PAKP), strong Steiner trade (SST), and unital key pre-distribution (UKP). We equipped these schemes with a compatible multi-path algorithm to offer end-to-end security. Results show that BlocKP improves the throughput up to 5% and decreases the flow completion time into 20% compared to baseline schemes. It has comparable routing traffic, latency, and throughput with augmented solutions but up to 60% improvement in the resistance against the node capture attack.
- 23 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (5) , 3851-3863
BlocKP: Key-Predistribution-Based Secure Data Transfer
Key pre-distribution schemes are promising lightweight solutions to be placed as the cornerstone of key management systems in multi-hop wireless networks. The intermediate decryption-encryption problem, however, is considered as the security threat of such schemes. Multi-path algorithms have been proposed to face such a shortcoming. Alas, these solutions are vulnerable against the node capture attack, where the attacker compromises a fraction of network nodes. In this paper, we propose BlocKP, a Blockchain-based solution to increase the resistance of the network against the node capture attack. BlocKP utilizes disjoint key-paths for a key exchange process, where the keying materials form a block at the source-side. Each key-path step generates the next block of the Blockchain until the keying materials reach the destination. BlocKP is a general framework applicable to any key pre-distribution schemes. We propose BlocKP in two versions BlocKP-I and BlocKP-II, where the latter enhance the resistance of BlocKP-I using erasure codes at the cost of negligible control traffic. We analytically show that BlocKP improves the resistance of the network against the node capture attack to almost perfect resistance, using just a small number of paths. We evaluate our solution by performing extensive simulations, considering three baseline key pre-distribution schemes, including probabilistic asymmetric key pre-distribution (PAKP), strong Steiner trade (SST), and unital key pre-distribution (UKP). We equipped these schemes with a compatible multi-path algorithm to offer end-to-end security. Results show that BlocKP improves the throughput up to 5% and decreases the flow completion time into 20% compared to baseline schemes. It has comparable routing traffic, latency, and throughput with augmented solutions but up to 60% improvement in the resistance against the node capture attack.
- 29 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 8 (1) , 662-679
Modeling and Evaluation of Multi-Hop Wireless Networks Using SRNs
As multi-hop wireless networks are attracting more attention, the need to evaluate their performance becomes essential. In order to evaluate the performance metrics of multi-hop wireless networks, including sending and receiving rates of a node as well as the collision probability, a model based on Stochastic Reward Nets (SRNs) is proposed. The proposed SRN models a typical node in such networks, considered as a general template to be applied to any wireless node. The SRN model of a single node is designed to take transmission effects of all neighboring nodes into account, while ignoring the ones whose transmission has no effect on the node under-study. Applying the proposed SRN to each node in a multi-hop wireless network, we can model any arbitrary topology and evaluate the mean queue size, collision probability, sending and receiving rates of the nodes. Common issues related to Medium Access Control and physical layer of wireless networks, e.g. hidden and exposed node problems, collision, transmission, interference and carrier sense ranges, are considered in the proposed SRN. The results obtained by the proposed model are validated with the results obtained from the discrete-event simulation conducted in ns-2 to show the applicability and accuracy of the proposed model.
- 29 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 8 (1) , 662-679
Modeling and Evaluation of Multi-Hop Wireless Networks Using SRNs
As multi-hop wireless networks are attracting more attention, the need to evaluate their performance becomes essential. In order to evaluate the performance metrics of multi-hop wireless networks, including sending and receiving rates of a node as well as the collision probability, a model based on Stochastic Reward Nets (SRNs) is proposed. The proposed SRN models a typical node in such networks, considered as a general template to be applied to any wireless node. The SRN model of a single node is designed to take transmission effects of all neighboring nodes into account, while ignoring the ones whose transmission has no effect on the node under-study. Applying the proposed SRN to each node in a multi-hop wireless network, we can model any arbitrary topology and evaluate the mean queue size, collision probability, sending and receiving rates of the nodes. Common issues related to Medium Access Control and physical layer of wireless networks, e.g. hidden and exposed node problems, collision, transmission, interference and carrier sense ranges, are considered in the proposed SRN. The results obtained by the proposed model are validated with the results obtained from the discrete-event simulation conducted in ns-2 to show the applicability and accuracy of the proposed model.
- Open Access
AutoIDS: Auto-encoder Based Method for Intrusion Detection System
Intrusion Detection System (IDS) is one of the most effective solutions for providing primary security services. IDSs are generally working based on attack signatures or by detecting anomalies. In this paper, we have presented AutoIDS, a novel yet efficient solution for IDS, based on a semi-supervised machine learning technique. AutoIDS can distinguish abnormal packet flows from normal ones by taking advantage of cascading two efficient detectors. These detectors are two encoder-decoder neural networks that are forced to provide a compressed and a sparse representation from the normal flows. In the test phase, failing these neural networks on providing compressed or sparse representation from an incoming packet flow, means such flow does not comply with the normal traffic and thus it is considered as an intrusion. For lowering the computational cost along with preserving the accuracy, a large number of flows are just processed by the first detector. In fact, the second detector is only used for difficult samples which the first detector is not confident about them. We have evaluated AutoIDS on the NSL-KDD benchmark as a widely-used and well-known dataset. The accuracy of AutoIDS is 90.17\% showing its superiority compared to the other state-of-the-art methods.
Open AccessAutoIDS: Auto-encoder Based Method for Intrusion Detection System
Intrusion Detection System (IDS) is one of the most effective solutions for providing primary security services. IDSs are generally working based on attack signatures or by detecting anomalies. In this paper, we have presented AutoIDS, a novel yet efficient solution for IDS, based on a semi-supervised machine learning technique. AutoIDS can distinguish abnormal packet flows from normal ones by taking advantage of cascading two efficient detectors. These detectors are two encoder-decoder neural networks that are forced to provide a compressed and a sparse representation from the normal flows. In the test phase, failing these neural networks on providing compressed or sparse representation from an incoming packet flow, means such flow does not comply with the normal traffic and thus it is considered as an intrusion. For lowering the computational cost along with preserving the accuracy, a large number of flows are just processed by the first detector. In fact, the second detector is only used for difficult samples which the first detector is not confident about them. We have evaluated AutoIDS on the NSL-KDD benchmark as a widely-used and well-known dataset. The accuracy of AutoIDS is 90.17\% showing its superiority compared to the other state-of-the-art methods.
- Open Access
- 2 October 2018
- Published by MDPI AG in Algorithms
- Vol. 11 (10) , 150
SLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems
Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P cloud system. However, considering this problem could enhance the overall network performance by shortening the response time and decreasing the overall network traffic. In this paper, we propose a novel, efficient, and general solution for locality problem in P2P cloud systems considering the round-trip-time (RTT). Furthermore, we suggest a flexible topology as the overlay graph to address the locality problem more effectively. Comprehensive simulation experiments are conducted to demonstrate the applicability of the proposed algorithm in most of the well-known P2P overlay networks while not introducing any serious overhead.
- 2 October 2018
- Published by MDPI AG in Algorithms
- Vol. 11 (10) , 150
Open AccessSLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems
Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P cloud system. However, considering this problem could enhance the overall network performance by shortening the response time and decreasing the overall network traffic. In this paper, we propose a novel, efficient, and general solution for locality problem in P2P cloud systems considering the round-trip-time (RTT). Furthermore, we suggest a flexible topology as the overlay graph to address the locality problem more effectively. Comprehensive simulation experiments are conducted to demonstrate the applicability of the proposed algorithm in most of the well-known P2P overlay networks while not introducing any serious overhead.
- 19 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (11) , 5430-5443
Throughput Analysis of IEEE 802.11 Multi-Hop Wireless Networks With Routing Consideration: A General Framework
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput, but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, MAC protocol properties, routing policy and nodes’ distribution. There have been many studies on analytical modeling of end-to-end throughput but none of them has taken routing policy and nodes’ distribution as well as MAC layer altogether into account. In this paper, the end-to-end throughput with perfect MAC layer is obtained based on routing policy and nodes’ distribution in one and two dimensional networks. Then, imperfections of IEEE 802.11 protocol is added to the model to obtain precise value. An exhaustive simulation is also made to validate the proposed models using ns-2 simulator. Results show that if the distribution to the next hop for a particular routing policy is known, our methodology can obtain the maximum end-to-end throughput precisely.
- 19 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (11) , 5430-5443
Throughput Analysis of IEEE 802.11 Multi-Hop Wireless Networks With Routing Consideration: A General Framework
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput, but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, MAC protocol properties, routing policy and nodes’ distribution. There have been many studies on analytical modeling of end-to-end throughput but none of them has taken routing policy and nodes’ distribution as well as MAC layer altogether into account. In this paper, the end-to-end throughput with perfect MAC layer is obtained based on routing policy and nodes’ distribution in one and two dimensional networks. Then, imperfections of IEEE 802.11 protocol is added to the model to obtain precise value. An exhaustive simulation is also made to validate the proposed models using ns-2 simulator. Results show that if the distribution to the next hop for a particular routing policy is known, our methodology can obtain the maximum end-to-end throughput precisely.
- Open Access
Throughput Analysis of IEEE 802.11 Multi-hop Wireless Networks with Routing Consideration: A General Framework
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput, but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, MAC protocol properties, routing policy and nodes distribution. There have been many studies on analytical modeling of end-to-end throughput but none of them has taken routing policy and nodes distribution as well as MAC layer altogether into account. In this paper, the end-to-end throughput with perfect MAC layer is obtained based on routing policy and nodes distribution in one and two dimensional networks. Then, imperfections of IEEE 802:11 protocol is added to the model to obtain precise value. An exhaustive simulation is also made to validate the proposed models using NS2 simulator. Results show that if the distribution to the next hop for a particular routing policy is known, our methodology can obtain the maximum end-to-end throughput precisely.
Open AccessThroughput Analysis of IEEE 802.11 Multi-hop Wireless Networks with Routing Consideration: A General Framework
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput, but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, MAC protocol properties, routing policy and nodes distribution. There have been many studies on analytical modeling of end-to-end throughput but none of them has taken routing policy and nodes distribution as well as MAC layer altogether into account. In this paper, the end-to-end throughput with perfect MAC layer is obtained based on routing policy and nodes distribution in one and two dimensional networks. Then, imperfections of IEEE 802:11 protocol is added to the model to obtain precise value. An exhaustive simulation is also made to validate the proposed models using NS2 simulator. Results show that if the distribution to the next hop for a particular routing policy is known, our methodology can obtain the maximum end-to-end throughput precisely.
- 28 May 2015
- Published by Springer Nature
- p. 421-430
Decentralized Social Networking Using Named-Data
- Open Access
- 1 January 2015
- Published by Inderscience Publishers in International Journal of Ad Hoc and Ubiquitous Computing
- Vol. 1 (1) , 171-186
IDS Modeling and Evaluation in WANETs against Black/Gray-hole Attacks using Stochastic Models
International publishers of academic, scientific and professional journals since 1979.
- 1 January 2015
- Published by Inderscience Publishers in International Journal of Ad Hoc and Ubiquitous Computing
- Vol. 1 (1) , 171-186
Open AccessIDS Modeling and Evaluation in WANETs against Black/Gray-hole Attacks using Stochastic Models
International publishers of academic, scientific and professional journals since 1979.