Muhammad Ismail
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
Muhammad Ismail has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
Abdul Baseer Qazi
Department of Software Engineering, Bahria University, Islamabad, Pakistan
3 shared publications- Aftab Aslam Parwaz Khan
Center of Excellence for Advanced Materials Research, King Abdulaziz University, Jeddah 21589, Saudi Arabia
2 shared publications Ibrar Ahmad
Department of Computer Systems Engineering, University of Engineering and Technology Peshawar, Peshawar 25000, Pakistan
2 shared publicationsMazhar Islam
School of Electronics and Information Technology, Sun Yat-sen University, Guangzhou, China
2 shared publicationsZahid Wadud
Department of Computer System Engineering, University of Engineering & Technology Peshawar, Peshawar, Pakistan
2 shared publicationsAbc
1 shared publication
Latest Publications
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. PP (3) , 1-15
Collaborative Offloading and Resource Allocation for Efficient Inference of Deep Neural Networks in Wireless Networks
Integrating Deep Neural Networks (DNNs) into wireless networks of Internet of Things (IoT) devices or Unmanned Aerial Vehicles (UAVs) can enable numerous smart applications, but the computational complexity of DNN inference often causes intolerable delays unless effectively managed. In this paper, we formulate the joint offloading of DNN layers and resource allocation in UAV-based wireless systems as an optimization problem to minimize total inference latency under constraints on wireless connectivity, computational resources, and UAV processing quotas. We propose an optimization-based algorithm, LARA, which uses alternating optimization to iteratively solve the formulated problem. For potential decentralized implementation, we design GAME-MIND, a matching game-based algorithm that efficiently allocates DNN layers to UAVs while balancing computational load. Numerical results show that GAME-MIND achieves favorable delay performance compared to centralized LARA, which itself is close to the near-optimal solution, and significantly outperforms other baselines, including two heuristic methods that offload layers to nearest UAVs, which incur at least twice the delay under high-load conditions. We also demonstrate GAME-MIND's convergence and analyze its communication, computation, and total inference latency under various network settings.
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. PP (3) , 1-15
Collaborative Offloading and Resource Allocation for Efficient Inference of Deep Neural Networks in Wireless Networks
Integrating Deep Neural Networks (DNNs) into wireless networks of Internet of Things (IoT) devices or Unmanned Aerial Vehicles (UAVs) can enable numerous smart applications, but the computational complexity of DNN inference often causes intolerable delays unless effectively managed. In this paper, we formulate the joint offloading of DNN layers and resource allocation in UAV-based wireless systems as an optimization problem to minimize total inference latency under constraints on wireless connectivity, computational resources, and UAV processing quotas. We propose an optimization-based algorithm, LARA, which uses alternating optimization to iteratively solve the formulated problem. For potential decentralized implementation, we design GAME-MIND, a matching game-based algorithm that efficiently allocates DNN layers to UAVs while balancing computational load. Numerical results show that GAME-MIND achieves favorable delay performance compared to centralized LARA, which itself is close to the near-optimal solution, and significantly outperforms other baselines, including two heuristic methods that offload layers to nearest UAVs, which incur at least twice the delay under high-load conditions. We also demonstrate GAME-MIND's convergence and analyze its communication, computation, and total inference latency under various network settings.
- Open Access
- 18 September 2020
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 16 (9)
Adaptive hop-by-hop cone vector-based forwarding protocol for underwater wireless sensor networks
In the recent past, a significant increase has been observed in the use of underwater wireless sensor networks for aquatic applications. However, underwater wireless sensor networks face several challenges including large propagation delays, high mobility, limited bandwidth, three-dimensional deployments, expensive manufacturing, and energy constraints. It is crucial for underwater wireless sensor networks to mitigate all these limitations primarily caused by the harsh underwater environment. To address some of the pertinent challenges, adaptive hop-by-hop cone vector-based forwarding routing protocol is proposed in this article which is based on the adaptive hop-by-hop vector-based forwarding. The novelty of adaptive hop-by-hop cone vector-based forwarding includes increasing the transmission reliability in sparse sensor regions by changing the base angle of the cone according to the network structure. The number of duplicate packets and end-to-end delay is also reduced because of the reduced base angle and a smart selection criterion for the potential forwarder node. The proposed routing protocol adaptively tunes the height and opening of the cone based on the network structure to effectively improve the performance of the network. Conclusively, this approach significantly reduces energy tax, end-to-end delay, and packet delivery ratio.
- 18 September 2020
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 16 (9)
Open AccessAdaptive hop-by-hop cone vector-based forwarding protocol for underwater wireless sensor networks
In the recent past, a significant increase has been observed in the use of underwater wireless sensor networks for aquatic applications. However, underwater wireless sensor networks face several challenges including large propagation delays, high mobility, limited bandwidth, three-dimensional deployments, expensive manufacturing, and energy constraints. It is crucial for underwater wireless sensor networks to mitigate all these limitations primarily caused by the harsh underwater environment. To address some of the pertinent challenges, adaptive hop-by-hop cone vector-based forwarding routing protocol is proposed in this article which is based on the adaptive hop-by-hop vector-based forwarding. The novelty of adaptive hop-by-hop cone vector-based forwarding includes increasing the transmission reliability in sparse sensor regions by changing the base angle of the cone according to the network structure. The number of duplicate packets and end-to-end delay is also reduced because of the reduced base angle and a smart selection criterion for the potential forwarder node. The proposed routing protocol adaptively tunes the height and opening of the cone based on the network structure to effectively improve the performance of the network. Conclusively, this approach significantly reduces energy tax, end-to-end delay, and packet delivery ratio.
- Open Access
- 6 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 100346-100364
Reliable Path Selection and Opportunistic Routing Protocol for Underwater Wireless Sensor Networks
The increased need to gather scientific data and the renewed drive to explore underwater natural resources has led more and more researchers to study the underwater environment. This has resulted in enormous attention being given to Underwater Wireless Sensor Networks (UWSNs) all over the world. However, UWSNs are faced with some major challenges including harsh environment, higher propagation delay and limited battery power of the sensor nodes. To address these challenges, several routing schemes have been proposed. In this paper, we propose a routing strategy, called Reliable Path Selection and Opportunistic Routing (RPSOR) protocol for UWSNs, which is a significantly improved version of Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR). RPSOR is based on three main factors: Advancement factor (ADVf), which depends on the depth of current as well as next hop forwarding node; Reliability index (RELi), which depends on the energy of the current forwarder as well as average energy in the next expected forwarding region; and Shortest Path Index (SPi), which is calculated on the basis of number of hops to the sink and average depth of neighbors in the next expected hop. To deal with the void hole problem and improve the Packet Delivery Ratio (PDR), we follow the more reliable path towards the sink by calculating RELi for a node. At the end, we perform extensive simulations and compare our proposed scheme with WDFAD-DBR, the results of which prove that RPSOR shows better performance in terms of PDR and energy tax in comparison to WDFAD-DBR. However, the proposed work compromises end-to-end delay in sparse networks.
- 6 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 100346-100364
Open AccessReliable Path Selection and Opportunistic Routing Protocol for Underwater Wireless Sensor Networks
The increased need to gather scientific data and the renewed drive to explore underwater natural resources has led more and more researchers to study the underwater environment. This has resulted in enormous attention being given to Underwater Wireless Sensor Networks (UWSNs) all over the world. However, UWSNs are faced with some major challenges including harsh environment, higher propagation delay and limited battery power of the sensor nodes. To address these challenges, several routing schemes have been proposed. In this paper, we propose a routing strategy, called Reliable Path Selection and Opportunistic Routing (RPSOR) protocol for UWSNs, which is a significantly improved version of Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR). RPSOR is based on three main factors: Advancement factor (ADVf), which depends on the depth of current as well as next hop forwarding node; Reliability index (RELi), which depends on the energy of the current forwarder as well as average energy in the next expected forwarding region; and Shortest Path Index (SPi), which is calculated on the basis of number of hops to the sink and average depth of neighbors in the next expected hop. To deal with the void hole problem and improve the Packet Delivery Ratio (PDR), we follow the more reliable path towards the sink by calculating RELi for a node. At the end, we perform extensive simulations and compare our proposed scheme with WDFAD-DBR, the results of which prove that RPSOR shows better performance in terms of PDR and energy tax in comparison to WDFAD-DBR. However, the proposed work compromises end-to-end delay in sparse networks.
- Open Access
- 22 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 175980-175999
An Energy Balanced Efficient and Reliable Routing Protocol for Underwater Wireless Sensor Networks
Underwater Wireless Sensor Networks (UWSNs) face numerous challenges due to small bandwidth, longer propagation delay, limited energy resources and high deployment cost. Development of efficient routing strategies is therefore incumbent and has remained the focus of researchers. Many routing protocols have been proposed to address these challenges and to further improve the performance of state of the art protocols. In Weighting Depth and Forwarding Area Division-Depth Based Routing (WDFAD-DBR), forwarding is decided on the basis of weighting depth difference, which is not an efficient way for void hole avoidance. In this paper we propose a depth based routing mechanism called Energy Balanced Efficient and Reliable Routing (EBER2) protocol for UWSNs. First and foremost, energy balancing among the neighbours and reliability is achieved by considering residual energy and the number of Potential Forwarding Nodes (PFNs) of the forwarder node respectively. Secondly, energy efficiency is enhanced by dividing transmission range into power levels and the forwarders are allowed to adaptively adjust their transmission power according to the farthest node in their neighbour list. Thirdly, duplicate packets are reduced by comparing depth, residual energy and PFNs among the neighbours. Moreover, network latency is decreased by deploying two sinks at those areas of the network which have high traffic density. Simulation results show that EBER2 has higher Packet Delivery Ratio (PDR), lower energy tax, and less duplicate packets than the competing routing protocol WDFAD-DBR.
- 22 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 175980-175999
Open AccessAn Energy Balanced Efficient and Reliable Routing Protocol for Underwater Wireless Sensor Networks
Underwater Wireless Sensor Networks (UWSNs) face numerous challenges due to small bandwidth, longer propagation delay, limited energy resources and high deployment cost. Development of efficient routing strategies is therefore incumbent and has remained the focus of researchers. Many routing protocols have been proposed to address these challenges and to further improve the performance of state of the art protocols. In Weighting Depth and Forwarding Area Division-Depth Based Routing (WDFAD-DBR), forwarding is decided on the basis of weighting depth difference, which is not an efficient way for void hole avoidance. In this paper we propose a depth based routing mechanism called Energy Balanced Efficient and Reliable Routing (EBER2) protocol for UWSNs. First and foremost, energy balancing among the neighbours and reliability is achieved by considering residual energy and the number of Potential Forwarding Nodes (PFNs) of the forwarder node respectively. Secondly, energy efficiency is enhanced by dividing transmission range into power levels and the forwarders are allowed to adaptively adjust their transmission power according to the farthest node in their neighbour list. Thirdly, duplicate packets are reduced by comparing depth, residual energy and PFNs among the neighbours. Moreover, network latency is decreased by deploying two sinks at those areas of the network which have high traffic density. Simulation results show that EBER2 has higher Packet Delivery Ratio (PDR), lower energy tax, and less duplicate packets than the competing routing protocol WDFAD-DBR.