Multi-Disjoint Path opportunistic networks with Hidden Markov Chain modeling
Advancing the efficiency and reliability of wireless sensor networks is a paramount pursuit in modern networking research. In this context, we introduce a groundbreaking approach based on Hidden Markov Chain (HMC) modeling with opportunistic routing, harnessed by the Carrier Sense Multiple Access wi...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-11-01
|
| Series: | Alexandria Engineering Journal |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1110016824007257 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846167145318187008 |
|---|---|
| author | Khurram Hussain Yuanqing Xia Ameer Onaizah Tayyab Manzoor |
| author_facet | Khurram Hussain Yuanqing Xia Ameer Onaizah Tayyab Manzoor |
| author_sort | Khurram Hussain |
| collection | DOAJ |
| description | Advancing the efficiency and reliability of wireless sensor networks is a paramount pursuit in modern networking research. In this context, we introduce a groundbreaking approach based on Hidden Markov Chain (HMC) modeling with opportunistic routing, harnessed by the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) mechanism. Our innovative algorithm addresses key challenges in Wireless Body Area Networks, including delay, throughput, and bandwidth utilization. By strategically integrating the HMC model, which captures intricate state transitions and emission probabilities, our proposed method introduces a robust solution for optimizing node connections and routing decisions. This fusion of HMC and opportunistic routing capitalizes on the strengths of both paradigms, enhancing the network's ability to make intelligent decisions in dynamic scenarios. Through rigorous simulations, we showcase the algorithm's prowess in achieving efficient data transmission. The empirical evidence from these simulations underscores the algorithm's superiority when juxtaposed against state-of-the-art mechanisms such as Simple Multi-Packet Access (SMPA) and Priority-based Congestion-avoidance Routing Protocol (PCRP). Our algorithm not only outperforms existing solutions in terms of delay, throughput, and bandwidth utilization, but it also showcases its ability to adapt to varying network conditions, making it a versatile tool for diverse applications. |
| format | Article |
| id | doaj-art-d033967a152c48bdbe3da4f95fc34fb0 |
| institution | Kabale University |
| issn | 1110-0168 |
| language | English |
| publishDate | 2024-11-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Alexandria Engineering Journal |
| spelling | doaj-art-d033967a152c48bdbe3da4f95fc34fb02024-11-15T06:11:08ZengElsevierAlexandria Engineering Journal1110-01682024-11-011074760Multi-Disjoint Path opportunistic networks with Hidden Markov Chain modelingKhurram Hussain0Yuanqing Xia1Ameer Onaizah2Tayyab Manzoor3School of Automation, Beijing Institute of Technology, Beijing 100081, ChinaSchool of Automation, Beijing Institute of Technology, Beijing 100081, China; Zhongyuan University of Technology, Zhengzhou, Henan Province 450007, China; Corresponding author at: Zhongyuan University of Technology, Zhengzhou, Henan Province 450007, China.School of Automation, Beijing Institute of Technology, Beijing 100081, ChinaSchool of Automation and Electrical Engineering, Zhongyuan University of Technology, Zhengzhou, Henan Province 450007, ChinaAdvancing the efficiency and reliability of wireless sensor networks is a paramount pursuit in modern networking research. In this context, we introduce a groundbreaking approach based on Hidden Markov Chain (HMC) modeling with opportunistic routing, harnessed by the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) mechanism. Our innovative algorithm addresses key challenges in Wireless Body Area Networks, including delay, throughput, and bandwidth utilization. By strategically integrating the HMC model, which captures intricate state transitions and emission probabilities, our proposed method introduces a robust solution for optimizing node connections and routing decisions. This fusion of HMC and opportunistic routing capitalizes on the strengths of both paradigms, enhancing the network's ability to make intelligent decisions in dynamic scenarios. Through rigorous simulations, we showcase the algorithm's prowess in achieving efficient data transmission. The empirical evidence from these simulations underscores the algorithm's superiority when juxtaposed against state-of-the-art mechanisms such as Simple Multi-Packet Access (SMPA) and Priority-based Congestion-avoidance Routing Protocol (PCRP). Our algorithm not only outperforms existing solutions in terms of delay, throughput, and bandwidth utilization, but it also showcases its ability to adapt to varying network conditions, making it a versatile tool for diverse applications.http://www.sciencedirect.com/science/article/pii/S1110016824007257Hidden Markov ChainOpportunistic networksWireless body area networksCSMACollision avoidancePCRP |
| spellingShingle | Khurram Hussain Yuanqing Xia Ameer Onaizah Tayyab Manzoor Multi-Disjoint Path opportunistic networks with Hidden Markov Chain modeling Alexandria Engineering Journal Hidden Markov Chain Opportunistic networks Wireless body area networks CSMA Collision avoidance PCRP |
| title | Multi-Disjoint Path opportunistic networks with Hidden Markov Chain modeling |
| title_full | Multi-Disjoint Path opportunistic networks with Hidden Markov Chain modeling |
| title_fullStr | Multi-Disjoint Path opportunistic networks with Hidden Markov Chain modeling |
| title_full_unstemmed | Multi-Disjoint Path opportunistic networks with Hidden Markov Chain modeling |
| title_short | Multi-Disjoint Path opportunistic networks with Hidden Markov Chain modeling |
| title_sort | multi disjoint path opportunistic networks with hidden markov chain modeling |
| topic | Hidden Markov Chain Opportunistic networks Wireless body area networks CSMA Collision avoidance PCRP |
| url | http://www.sciencedirect.com/science/article/pii/S1110016824007257 |
| work_keys_str_mv | AT khurramhussain multidisjointpathopportunisticnetworkswithhiddenmarkovchainmodeling AT yuanqingxia multidisjointpathopportunisticnetworkswithhiddenmarkovchainmodeling AT ameeronaizah multidisjointpathopportunisticnetworkswithhiddenmarkovchainmodeling AT tayyabmanzoor multidisjointpathopportunisticnetworkswithhiddenmarkovchainmodeling |