Abstract
Wireless Body Area Networks (WBANs) hold immense potential in healthcare monitoring, but ensuring reliable data transmission is crucial. While the IEEE 802.15.4 standard offers low-power operation and basic security, its Contention-Based Access (CBA) mechanism can lead to packet collisions and reduced reliability, especially in congested scenarios. This paper proposes a novel approach to enhance reliability in 802.15.4 WBANs by incorporating a Greedy Spider Monkey Optimization Algorithm (GSMA). The GSMA mimics the intelligent foraging behaviour of spider monkeys, enabling dynamic channel selection and optimal transmission scheduling. Our approach aims to minimize packet collisions by selecting channels with lower traffic based on historical data and real-time network conditions; the GSMA reduces the likelihood of collisions and data loss. Secondly, the algorithm prioritizes critical data packets based on their urgency and channel availability, ensuring the timely delivery of essential medical information. Finally, by reducing collisions and optimizing scheduling, the GSMA helps maintain efficient data flow within the WBAN. This paper presents the design and implementation of the GSMA-based approach within the 802.15.4 framework. Simulation results are presented to evaluate the effectiveness of the proposed method in improving reliability, reducing packet loss, and enhancing overall network performance in WBANs. The findings demonstrate the potential of the GSMA to address the limitations of 802.15.4 and contribute to developing more reliable and efficient WBAN solutions for healthcare applications.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer






