Muhammad Altaf Khan

Dr. Muhammad Altaf Khan

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 October 2020 in IEEE Access
Verified
Journal Article
Open access
ZHZohaib Hassan
Zohaib Hassan
AMAmjad Mehmood
Amjad Mehmood
CMCasten Maple
Casten Maple
MKMuhammad Altaf Khan
Muhammad Altaf Khan
AAAbdulaziz Aldegheishem
Abdulaziz Aldegheishem
Detection of Black Hole attacks is one of the most challenging and critical routing security issues in vehicular ad hoc networks (VANETs) and autonomous and connected vehicles (ACVs). Malicious vehicles or nodes may exist in the cyber-physical path on which the data and control packets have to be routed converting a secure and reliable route into a compromised one. However, instead of passing packets to a neighbouring node, malicious nodes bypass them and drop any data packets that could contain emergency alarms. We introduce an intelligent black hole attack detection scheme (IDBA) tailored to ACV. We consider four key parameters in the design of the scheme, namely, Hop Count, Destination Sequence Number, Packet Delivery Ratio (PDR), and End-to-End delay (E2E). We tested the performance of our IDBA against AODV with Black Hole (BAODV), Intrusion Detection System (IdsAODV), and EAODV algorithms. Extensive simulation results show that our IDBA outperforms existing approaches in terms of PDR, E2E, Routing Overhead, Packet Loss Rate, and Throughput.

2 March 2024 in Sensors
Verified
Journal Article
Open access
PDF file
Shafiullah KhanShafiullah Khan
Shafiullah Khan
MKMuhammad Altaf Khan
Muhammad Altaf Khan
NAnoha alnazzawi
noha alnazzawi
Wireless sensor networks (WSNs) are essential in many areas, from healthcare to environmental monitoring. However, WSNs are vulnerable to routing attacks that might jeopardize network performance and data integrity due to their inherent vulnerabilities. This work suggests a unique method for enhancing WSN security through the detection of routing threats using feed-forward artificial neural networks (ANNs). The proposed solution makes use of ANNs’ learning capabilities to model the network’s dynamic behavior and recognize routing attacks like black-hole, gray-hole, and wormhole attacks. CICIDS2017 is a heterogeneous dataset that was used to train and test the proposed system in order to guarantee its robustness and adaptability. The system’s ability to recognize both known and novel attack patterns enhances its efficacy in real-world deployment. Experimental assessments using an NS2 simulator show how well the proposed method works to improve routing protocol security. The proposed system’s performance was assessed using a confusion matrix. The simulation and analysis demonstrated how much better the proposed system performs compared to the existing methods for routing attack detection. With an average detection rate of 99.21% and a high accuracy of 99.49%, the proposed system minimizes the rate of false positives. The study advances secure communication in WSNs and provides a reliable means of protecting sensitive data in resource-constrained settings.

6 January 2022 in Sensors
Verified
Journal Article
Open access
PDF file
MKMuhammad Altaf Khan
Muhammad Altaf Khan
MNMoustafa M. Nasralla
Moustafa M. Nasralla
MUMuhammad Muneer Umar
Muhammad Muneer Umar
GRGhani rehman
Ghani rehman
Shafiullah KhanShafiullah Khan
Shafiullah Khan
Nikumani ChoudhuryNikumani Choudhury
Nikumani Choudhury
Wireless sensor networks (WSNs) are low-cost, special-purpose networks introduced to resolve various daily life domestic, industrial, and strategic problems. These networks are deployed in such places where the repairments, in most cases, become difficult. The nodes in WSNs, due to their vulnerable nature, are always prone to various potential threats. The deployed environment of WSNs is noncentral, unattended, and administrativeless; therefore, malicious attacks such as distributed denial of service (DDoS) attacks can easily be commenced by the attackers. Most of the DDoS detection systems rely on the analysis of the flow of traffic, ultimately with a conclusion that high traffic may be due to the DDoS attack. On the other hand, legitimate users may produce a larger amount of traffic known, as the flash crowd (FC). Both DDOS and FC are considered abnormal traffic in communication networks. The detection of such abnormal traffic and then separation of DDoS attacks from FC is also a focused challenge. This paper introduces a novel mechanism based on a Bayesian model to detect abnormal data traffic and discriminate DDoS attacks from FC in it. The simulation results prove the effectiveness of the proposed mechanism, compared with the existing systems.

30 May 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
MKMuhammad Altaf Khan
Muhammad Altaf Khan
MNMoustafa M. Nasralla
Moustafa M. Nasralla
MUMuhammad Muneer Umar
Muhammad Muneer Umar
ZIZeeshan Iqbal
Zeeshan Iqbal
GRGhani rehman
Ghani rehman
Nikumani ChoudhuryNikumani Choudhury
Nikumani Choudhury
In ad hoc networks, the communication is usually made through multiple hops by establishing an environment of cooperation and coordination among self-operated nodes. Such nodes typically operate with a set of finite and scarce energy, processing, bandwidth, and storage resources. Due to the cooperative environment in such networks, nodes may consume additional resources by giving relaying services to other nodes. This aspect in such networks coined the situation of noncooperative behavior by some or all the nodes. Moreover, nodes sometimes do not cooperate with others due to their social likeness or their mobility. Noncooperative or selfish nodes can last for a longer time by preserving their resources for their own operations. However, such nodes can degrade the network's overall performance in terms of lower data gathering and information exchange rates, unbalanced work distribution, and higher end-to-end delays. This work surveys the main roots for motivating nodes to adapt selfish behavior and the solutions for handling such nodes. Different schemes are introduced to handle selfish nodes in wireless ad hoc networks. Various types of routing techniques have been introduced to target different types of ad hoc networks having support for keeping misbehaving or selfish nodes. The major solutions for such scenarios can be trust-, punishment-, and stimulation-based mechanisms. Some key protocols are simulated and analyzed for getting their performance metrics to compare their effectiveness.

21 February 2022 in Sensors
Verified
Journal Article
Open access
PDF file
WKWooseong Kim
Wooseong Kim
MUMuhammad Muneer Umar
Muhammad Muneer Umar
Shafiullah KhanShafiullah Khan
Shafiullah Khan
MKMuhammad Altaf Khan
Muhammad Altaf Khan
The seamless operation of inter-connected smart devices in Internet of Things (IoT) wireless sensor networks (WSNs) requires consistently available end-to-end routes. However, the sensor nodes that rely on a very limited power source tend to cause disconnection in multi-hop routes due to power shortages in the WSNs, which eventually results in the inefficiency of the overall IoT network. In addition, the density of the available sensor nodes affects the existence of feasible routes and the level of path multiplicity in the WSNs. Therefore, an efficient routing mechanism is expected to extend the lifetime of the WSNs by adaptively selecting the best routes for the data transfer between interconnected IoT devices. In this work, we propose a novel routing mechanism to balance the energy consumption among all the nodes and elongate the WSN lifetime, which introduces a score value assigned to each node along a path as the combination of evaluation metrics. Specifically, the scoring scheme considers the information of the node density at a certain area and the node energy levels in order to represent the importance of individual nodes in the routes. Furthermore, our routing mechanism allows for incorporating non-cooperative nodes. The simulation results show that the proposed work gives comparatively better results than some other experimented protocols.

8 January 2025 in Computers
Verified
Journal Article
Open access
PDF file
MHMunir Hussain
Munir Hussain
AMAmjad Mehmood
Amjad Mehmood
MKMuhammad Altaf Khan
Muhammad Altaf Khan
RKRabia Khan Khan
Rabia Khan Khan
Jaime LloretJaime Lloret
Jaime Lloret
Blockchain technology is an emerging decentralized and distributed technology that can maintain data security. It has the potential to transform many sectors completely. The core component of blockchain networks is the consensus algorithm because its efficiency, security, and scalability depend on it. A consensus problem is a difficult and significant task that must be considered carefully in a blockchain network. It has several practical applications such as distributed computing, load balancing, and blockchain transaction validation. Even though a lot of consensus algorithms have been proposed, the majority of them require many computational and communication resources. Similarly, they also suffer from high latency and low throughput. In this work, we proposed a new consensus algorithm for consortium blockchain for a leader selection using the reputation value of nodes and the voting process to ensure high performance. A security analysis is conducted to demonstrate the security of the proposed algorithm. The outcomes show that the proposed algorithm provides a strong defense against the network nodes’ abnormal behavior. The performance analysis is performed by using Hyperledger Fabric v2.1 and the results show that it performs better in terms of throughput, latency, CPU utilization, and communications costs than its rivals Trust-Varying Algo, FP-BFT, and Scalable and Trust-based algorithms.