Ahsan Habib
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
Ahsan Habib has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Sajeeb Saha
Jagannath University
7 shared publications Abdur Razzaque
Green Networking Research Group, University of Dhaka, Bangladesh
4 shared publications- Abdur Razzaque
Department of Computer Science and Engineering, University of Dhaka, Dhaka, Bangladesh
4 shared publications Fernaz Narin Nur
Green Networking Research (GNR) Group, University of Dhaka, Bangladesh
3 shared publications- Kawsar Ahmed
Department of Electrical and Computer Engineering, University of Saskatchewan, 57 Campus Drive, Saskatoon, SK, S7N 5A9, Canada; Health Informatics Research Lab, Department of Computer Science and Engineering, Daffodil International University, Daffodil Smart City, Birulia, Dhaka, 1216, Bangladesh
3 shared publications Mamun- Or- Rashid
Green Networking Research Group, University of Dhaka, Bangladesh
3 shared publications
Latest Publications
- Open Access
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 50996-51011
Q-DMAC: Quality-Aware Distributed Channel Selection MAC Protocol for Enhancing Multi-Channel Communication in Directional Sensor Networks
The performance of wireless networks has continuously improved using Directional Wireless Sensor Networks (DSNs). DSN achieves this by enhancing data sensing accuracy, maximizing spectrum use, decreasing interference and collisions, and lengthening the network’s operating lifetime.Within the domain of Directional Sensor Networks (DSNs), the primary difficulties are coordinating transmission and reception possibilities for a variety of sender-receiver pairs and offering traffic priority-aware channel access. To improve the quality and efficiency of multi-channel communication in DSNs, this research presents a quality-aware Directional MAC, Q-DMAC a novel medium access control protocol. The novelty of our protocol lies in its ability to leverage multi-channel resources effectively, enabling reuse through nodes equipped with directional antennas while ensuring the Quality of Service (QoS). Proposed Q-DMAC assigns a higher number of slots inside a data window to nodes carrying more packets waiting to be sent and prioritizes medium access to nodes carrying a significant amount of data packets. Also by employing regret matching of game theory Q-DMAC selects channels resulting in reduced channel switching cost as well as computation cost. Simulation results demonstrate that Q-DMAC outperforms existing protocols such as CAR MAC, 2D-CMDMAC, and DCDS-MAC, achieving up to 20% higher throughput, 15% lower latency, 12% better packet delivery ratio, 25% longer network lifetime, and 15% reduced overhead.
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 50996-51011
Open AccessQ-DMAC: Quality-Aware Distributed Channel Selection MAC Protocol for Enhancing Multi-Channel Communication in Directional Sensor Networks
The performance of wireless networks has continuously improved using Directional Wireless Sensor Networks (DSNs). DSN achieves this by enhancing data sensing accuracy, maximizing spectrum use, decreasing interference and collisions, and lengthening the network’s operating lifetime.Within the domain of Directional Sensor Networks (DSNs), the primary difficulties are coordinating transmission and reception possibilities for a variety of sender-receiver pairs and offering traffic priority-aware channel access. To improve the quality and efficiency of multi-channel communication in DSNs, this research presents a quality-aware Directional MAC, Q-DMAC a novel medium access control protocol. The novelty of our protocol lies in its ability to leverage multi-channel resources effectively, enabling reuse through nodes equipped with directional antennas while ensuring the Quality of Service (QoS). Proposed Q-DMAC assigns a higher number of slots inside a data window to nodes carrying more packets waiting to be sent and prioritizes medium access to nodes carrying a significant amount of data packets. Also by employing regret matching of game theory Q-DMAC selects channels resulting in reduced channel switching cost as well as computation cost. Simulation results demonstrate that Q-DMAC outperforms existing protocols such as CAR MAC, 2D-CMDMAC, and DCDS-MAC, achieving up to 20% higher throughput, 15% lower latency, 12% better packet delivery ratio, 25% longer network lifetime, and 15% reduced overhead.
- Open Access
- 17 May 2022
- Published by Bangladesh Academy of Sciences in Bangladesh Medical Research Council Bulletin
- Vol. 47 (1) , 78-81
Changes in Serum Electrolytes Following Permanent or Temporary Ileostomy
Background: Patients with ileostomies are well known to be susceptible to extracellular fluid volume depletion as a result of fluid and solute losses that are greater than intake. However, electrolyte disorders accompanying these episodes of volume depletion are not well delineated. Objective: To find out serum electrolytes changes observed in patients undergone permanent or temporary ileostomy. Method: This prospective observational study was carried out in the Department of Colorectal Surgery, BSMMU, Dhaka, from January 2018 to December 2018. Fifty patients underwent permanent or temporary ileostomy and postoperatively treated with intravenous fluid and electrolytes at least up to 3rd POD along with gradual resumption of oral intake or ileostomy feeding and managed at least for 5 days were included in this study. Electrolyte was measured preoperatively and 3rd and 5th POD and observed the changes. Result: Males were predominant than females (1.17:1). Most of the patients were in age group 31 – 40 years. Mean age was 42.4±12.5 years. Serum sodium (Na) and serum potassium (K) were reduced at POD 3 and at POD 5 compared to pre-operative level. Serum sodium concentration was 136.6±3.75 mmol/L pre operatively and reduced to 135.1 ±2.98 mmol/L at 3rd POD and 134.8±3.04 mmol/L at 5th POD. Similarly, serum potassium concentration was 4.0±0.49 mmol/L pre operatively and reduced to 3.8±0.70 mmol/L at 3rd POD and 3.8±0.50 mmol/L at 5th POD. Both serum Na and serum K level reduced significantly in POD 3 and in POD 5 in comparison to pre-operative values (p0.05). Conclusion: Serum sodium and potassium concentration reduced statistically significantly after permanent ileostomy. Bangladesh Med Res Counc Bull 2021; 47(1): 78-81
- 17 May 2022
- Published by Bangladesh Academy of Sciences in Bangladesh Medical Research Council Bulletin
- Vol. 47 (1) , 78-81
Open AccessChanges in Serum Electrolytes Following Permanent or Temporary Ileostomy
Background: Patients with ileostomies are well known to be susceptible to extracellular fluid volume depletion as a result of fluid and solute losses that are greater than intake. However, electrolyte disorders accompanying these episodes of volume depletion are not well delineated. Objective: To find out serum electrolytes changes observed in patients undergone permanent or temporary ileostomy. Method: This prospective observational study was carried out in the Department of Colorectal Surgery, BSMMU, Dhaka, from January 2018 to December 2018. Fifty patients underwent permanent or temporary ileostomy and postoperatively treated with intravenous fluid and electrolytes at least up to 3rd POD along with gradual resumption of oral intake or ileostomy feeding and managed at least for 5 days were included in this study. Electrolyte was measured preoperatively and 3rd and 5th POD and observed the changes. Result: Males were predominant than females (1.17:1). Most of the patients were in age group 31 – 40 years. Mean age was 42.4±12.5 years. Serum sodium (Na) and serum potassium (K) were reduced at POD 3 and at POD 5 compared to pre-operative level. Serum sodium concentration was 136.6±3.75 mmol/L pre operatively and reduced to 135.1 ±2.98 mmol/L at 3rd POD and 134.8±3.04 mmol/L at 5th POD. Similarly, serum potassium concentration was 4.0±0.49 mmol/L pre operatively and reduced to 3.8±0.70 mmol/L at 3rd POD and 3.8±0.50 mmol/L at 5th POD. Both serum Na and serum K level reduced significantly in POD 3 and in POD 5 in comparison to pre-operative values (p0.05). Conclusion: Serum sodium and potassium concentration reduced statistically significantly after permanent ileostomy. Bangladesh Med Res Counc Bull 2021; 47(1): 78-81
- Open Access
- 23 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 95162-95179
Quality-of-Experience-Aware Incentive Mechanism for Workers in Mobile Device Cloud
Mobile device cloud (MDC) is a collaborative cloud computing platform over which neighboring smart devices form an alliance of shared resources to mitigate resource-scarcity of an individual user device for running compute-intensive applications. A major challenge of such a platform is maximizing user quality-of-experience (QoE) at minimum cost while providing attractive incentives to workers’ mobile devices. In state-of-the-art works, either a voluntary task execution or merely resource-cost driven mechanism has been applied to minimize the task execution time while overlooking payment of any additional incentive to the worker devices for their quality services. In this paper, we develop a computational framework for MDC where the afore-mentioned challenging problem is formulated as a multi-objective linear programming (MOLP) optimization function that exploits reverse-auction bidding policy. Due to the NP-hardness of MOLP, we offer two greedy worker selection algorithms for maximizing user QoE or minimizing execution cost. In both algorithms, the amount of incentive awarded to a worker is determined following the QoE offered to a user. Theoretical proofs of desirable properties of the proposed incentive mechanisms are presented. Simulation results illustrate the effectiveness of our incentive algorithms compared to the state-of-the-art approaches.
- 23 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 95162-95179
Open AccessQuality-of-Experience-Aware Incentive Mechanism for Workers in Mobile Device Cloud
Mobile device cloud (MDC) is a collaborative cloud computing platform over which neighboring smart devices form an alliance of shared resources to mitigate resource-scarcity of an individual user device for running compute-intensive applications. A major challenge of such a platform is maximizing user quality-of-experience (QoE) at minimum cost while providing attractive incentives to workers’ mobile devices. In state-of-the-art works, either a voluntary task execution or merely resource-cost driven mechanism has been applied to minimize the task execution time while overlooking payment of any additional incentive to the worker devices for their quality services. In this paper, we develop a computational framework for MDC where the afore-mentioned challenging problem is formulated as a multi-objective linear programming (MOLP) optimization function that exploits reverse-auction bidding policy. Due to the NP-hardness of MOLP, we offer two greedy worker selection algorithms for maximizing user QoE or minimizing execution cost. In both algorithms, the amount of incentive awarded to a worker is determined following the QoE offered to a user. Theoretical proofs of desirable properties of the proposed incentive mechanisms are presented. Simulation results illustrate the effectiveness of our incentive algorithms compared to the state-of-the-art approaches.
- Open Access
- 4 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 163878-163893
Lifetime Maximization of Sensor Networks Through Optimal Data Collection Scheduling of Mobile Sink
The problem of maximizing lifetime of a sensor network is still challenging mainly due to the stringent delay-deadline of real-time applications and heterogeneity of sensor devices. The problem is further complicated when the network contains many obstacles. In maximizing network lifetime, existing literature works either merely address issues of application delay-deadline and presence of obstacles, or analyze primitive data collection approaches for such an environment. In this paper, we formulate optimal data collection schedule of a mobile sink in an obstructed sensor network as a mixed-integer linear programming (MILP) problem. The proposed data collection scheduling finds an optimal set of rendezvous nodes over a preformed Starfish routing backbone, and corresponding sojourn duration so as to maximize the network lifetime while maintaining delay-deadline constraint in an obstructed network. The proposed Starfish-scheduling ensures a loop-free traveling path for a mobile sink across the network. The results of performance evaluation, performed in network simulator-2, depict the suitability of Starfish scheduling as it outperforms state-of-the-art-works in terms of extending network lifetime and data delivery throughput as well as reducing average end-to-end delay.
- 4 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 163878-163893
Open AccessLifetime Maximization of Sensor Networks Through Optimal Data Collection Scheduling of Mobile Sink
The problem of maximizing lifetime of a sensor network is still challenging mainly due to the stringent delay-deadline of real-time applications and heterogeneity of sensor devices. The problem is further complicated when the network contains many obstacles. In maximizing network lifetime, existing literature works either merely address issues of application delay-deadline and presence of obstacles, or analyze primitive data collection approaches for such an environment. In this paper, we formulate optimal data collection schedule of a mobile sink in an obstructed sensor network as a mixed-integer linear programming (MILP) problem. The proposed data collection scheduling finds an optimal set of rendezvous nodes over a preformed Starfish routing backbone, and corresponding sojourn duration so as to maximize the network lifetime while maintaining delay-deadline constraint in an obstructed network. The proposed Starfish-scheduling ensures a loop-free traveling path for a mobile sink across the network. The results of performance evaluation, performed in network simulator-2, depict the suitability of Starfish scheduling as it outperforms state-of-the-art-works in terms of extending network lifetime and data delivery throughput as well as reducing average end-to-end delay.
- 30 July 2020
- Published by Springer Nature
- p. 529-538
Analysis of Software Defined Wireless Network with IP Mobility in Multiple Controllers Domain
- 30 July 2020
- Published by Springer Nature
- p. 529-538
Analysis of Software Defined Wireless Network with IP Mobility in Multiple Controllers Domain
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 40-44
Heptagonal Photonic Crystal Fiber Based Chemical Sensor in THz Regime
In this article, here is developed a novel TOPAS based heptagonal photonic crystal fiber (H-PCF) for the identification of various chemical substances in the terahertz frequency territory. The full-vector finite element method (FV-FEM) is used for the numerical investigation about the competence of the proposed PCF. Simulation results show the maximum relative sensitivity as well as less connement loss for various chemicals. Numerically processed outcomes apparent that the proposed sensor shows 63.24 %, 61.05 % and 60.03 % detecting reactions for focused analytes benzene, ethanol and water individually at 1 THz frequency. Major purposes is to use H-PCF as the application of chemical sensor in commercial sector to detect harmful chemicals.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 40-44
Heptagonal Photonic Crystal Fiber Based Chemical Sensor in THz Regime
In this article, here is developed a novel TOPAS based heptagonal photonic crystal fiber (H-PCF) for the identification of various chemical substances in the terahertz frequency territory. The full-vector finite element method (FV-FEM) is used for the numerical investigation about the competence of the proposed PCF. Simulation results show the maximum relative sensitivity as well as less connement loss for various chemicals. Numerically processed outcomes apparent that the proposed sensor shows 63.24 %, 61.05 % and 60.03 % detecting reactions for focused analytes benzene, ethanol and water individually at 1 THz frequency. Major purposes is to use H-PCF as the application of chemical sensor in commercial sector to detect harmful chemicals.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 291-296
Generalized Construction of Compression Function to Build a Cryptographic Hash
A Cryptographic hash is called one way function where it receives and returns data in an arbitrary and fixed size respectively. It has certain applications like digital signatures, message authentication-code, and password verification. Primarily, block-cipher-based compression function is used to build a cryptographic hash. Typically, three variants of block-cipher are available under the double block-length compression function (DBL), namely $(n, n),\ (n, 2n)$ and lightweight-cipher. Interestingly, many schemes have been proposed independently based on the above types of block-cipher types. However, these constructions are suitable case to case such as short message, long message, and variable message. Secondly, the communication networks are complex and depend on various types of resource constrained devices which are useful under IoT, cloud, and grid networks. These devices have certain limitations such as limited processing, and storage capabilities. Therefore, security solution for these devices should be platform independent and generalized. However, there is a lack of general construction of compression function (based on block-cipher) to build a cryptographic hash. Therefore, we propose a generalized construction of compression function that supports all types of block-cipher and can run under a single platform. Moreover, the proposed scheme outperforms state-of-the-art works in terms of security and efficiency rate.- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 291-296
Generalized Construction of Compression Function to Build a Cryptographic Hash
A Cryptographic hash is called one way function where it receives and returns data in an arbitrary and fixed size respectively. It has certain applications like digital signatures, message authentication-code, and password verification. Primarily, block-cipher-based compression function is used to build a cryptographic hash. Typically, three variants of block-cipher are available under the double block-length compression function (DBL), namely $(n, n),\ (n, 2n)$ and lightweight-cipher. Interestingly, many schemes have been proposed independently based on the above types of block-cipher types. However, these constructions are suitable case to case such as short message, long message, and variable message. Secondly, the communication networks are complex and depend on various types of resource constrained devices which are useful under IoT, cloud, and grid networks. These devices have certain limitations such as limited processing, and storage capabilities. Therefore, security solution for these devices should be platform independent and generalized. However, there is a lack of general construction of compression function (based on block-cipher) to build a cryptographic hash. Therefore, we propose a generalized construction of compression function that supports all types of block-cipher and can run under a single platform. Moreover, the proposed scheme outperforms state-of-the-art works in terms of security and efficiency rate.- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 173-177
Popularity Prediction of Online News Item Based on Social Media Response
The objective of the research study is to predict the popularity of printed as well as online news articles that are publicized on the online social network. Keywords are extracted from the collected data sets and compared with trained data sets. The popularity of any news contents are calculated through the proposed prediction model according to training data sets and lifetime of that news. 100 newly published news items have collected and analyzed them. We have found an accuracy of 70% which is more than prior studies. Our proposed system will make a significant way for the user to explore the news articles.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 173-177
Popularity Prediction of Online News Item Based on Social Media Response
The objective of the research study is to predict the popularity of printed as well as online news articles that are publicized on the online social network. Keywords are extracted from the collected data sets and compared with trained data sets. The popularity of any news contents are calculated through the proposed prediction model according to training data sets and lifetime of that news. 100 newly published news items have collected and analyzed them. We have found an accuracy of 70% which is more than prior studies. Our proposed system will make a significant way for the user to explore the news articles.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 62-66
On the Optimal Size of Ring-canal in Starfish Routing
Backbone based routing strategies for Mobile Wireless Sensor Networks (MWSNs) are becoming very popular for minimizing end-to-end delay with extended network lifetime, while collecting real-time sensed data from different corners of the network. Existing backbone architectures, i.e., Ring- and Starfish-backbone, constitute rings of fixed radius ignoring the sizes of network. Moreover, the network performance and routing issues are greatly affected by the fixed size of the ring in the existing literature works, i.e., Ring- and Starfish-backbone, since the size has not been determined optimally based on the network size. In this paper, at first, we estimate the optimal size (or radius) of the ring-canal dynamically based on sensor's transmission range and network area. Later, we evaluate end-to-end delay and network throughput for Starfish routing with optimal ring-canal. The simulation results, performed in Network Simulator (NS-2), show significant improvement for delay and throughput compared to the existing literature works.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 62-66
On the Optimal Size of Ring-canal in Starfish Routing
Backbone based routing strategies for Mobile Wireless Sensor Networks (MWSNs) are becoming very popular for minimizing end-to-end delay with extended network lifetime, while collecting real-time sensed data from different corners of the network. Existing backbone architectures, i.e., Ring- and Starfish-backbone, constitute rings of fixed radius ignoring the sizes of network. Moreover, the network performance and routing issues are greatly affected by the fixed size of the ring in the existing literature works, i.e., Ring- and Starfish-backbone, since the size has not been determined optimally based on the network size. In this paper, at first, we estimate the optimal size (or radius) of the ring-canal dynamically based on sensor's transmission range and network area. Later, we evaluate end-to-end delay and network throughput for Starfish routing with optimal ring-canal. The simulation results, performed in Network Simulator (NS-2), show significant improvement for delay and throughput compared to the existing literature works.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
An Efficient Mobile-Sink Trajectory to Maximize Network Lifetime in Wireless Sensor Network
The introduction of mobile sink in collecting data from different corners of a Wireless Sensor Network (WSN) has proven in order to provide extended network-lifetime. However, selecting an efficient route of travelling path for sink is a challenging problem due to dynamic distribution of source nodes in the network. The problem becomes more critical when the network consists of various obstacles including buildings, trees, mountains or lakes etc. In this paper, we have developed an efficient mobile-sink trajectory in a path-restricted WSN. The proposed trajectory optimizes network lifetime using a mixed-integer-linear-program (MILP) model. Here, experimental results outperform random- and periphery-trajectory models in respect of end-to-end (e2e) delay and network-lifetime.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
An Efficient Mobile-Sink Trajectory to Maximize Network Lifetime in Wireless Sensor Network
The introduction of mobile sink in collecting data from different corners of a Wireless Sensor Network (WSN) has proven in order to provide extended network-lifetime. However, selecting an efficient route of travelling path for sink is a challenging problem due to dynamic distribution of source nodes in the network. The problem becomes more critical when the network consists of various obstacles including buildings, trees, mountains or lakes etc. In this paper, we have developed an efficient mobile-sink trajectory in a path-restricted WSN. The proposed trajectory optimizes network lifetime using a mixed-integer-linear-program (MILP) model. Here, experimental results outperform random- and periphery-trajectory models in respect of end-to-end (e2e) delay and network-lifetime.