The Experts below are selected from a list of 4722 Experts worldwide ranked by ideXlab platform
Andreas Willig - One of the best experts on this subject based on the ideXlab platform.
-
ICON - Study of resource utilization in IEEE 802.15.4 Wireless Body Sensor Network, Part II: Greedy Channel Utilization
2013 19th IEEE International Conference on Networks (ICON), 2013Co-Authors: Amirhossein Moravejosharieh, Ehsan Tabatabaei Yazdi, Andreas WilligAbstract:The channel scarcity phenomenon has recently introduced new challenges in the field of Wireless Body Sensor Networks (WBSNs). Within a WBSN, node's communication is restricted throughout their defined active period. As the number of WBSNs increases, the overlapping active periods are elevated due to inefficient utilization of the spectrum. This consequently results in higher Packet Loss Ratio and eventually performance degradation of the WBSNs entirely. To overcome the aforementioned issue, in this paper, we have proposed a new scheme called “Greedy Channel Utilization” (GCU) scheme in which coordinators compete for slot reservation and attempt to utilize the channel voraciously by pushing other contestants in to sleep mode. To evaluate the performance of our proposed scheme, we compared it with the bare IEEE 802.15.4 Std. in terms of channel utilization percentage, Packet Loss Ratio, sensor's orphan time and energy consumption of sensors and coordinator. Eventually, this study concludes the outperformance of GCU scheme over the blind scheme.
-
Study of resource utilization in IEEE 802.15.4 Wireless Body Sensor Network, Part II: Greedy Channel Utilization
IEEE International Conference on Networks ICON, 2013Co-Authors: Amirhossein Moravejosharieh, Ehsan Tabatabaei Yazdi, Andreas WilligAbstract:The channel scarcity phenomenon has recently introduced new challenges in the field of Wireless Body Sensor Networks (WBSNs). Within a WBSN, node's communication is restricted throughout their defined active period. As the number of WBSNs increases, the overlapping active periods are elevated due to inefficient utilization of the spectrum. This consequently results in higher Packet Loss Ratio and eventually performance degradation of the WBSNs entirely. To overcome the aforementioned issue, in this paper, we have proposed a new scheme called “Greedy Channel Utilization” (GCU) scheme in which coordinators compete for slot reservation and attempt to utilize the channel voraciously by pushing other contestants in to sleep mode. To evaluate the performance of our proposed scheme, we compared it with the bare IEEE 802.15.4 Std. in terms of channel utilization percentage, Packet Loss Ratio, sensor's orphan time and energy consumption of sensors and coordinator. Eventually, this study concludes the outperformance of GCU scheme over the blind scheme.
Amirhossein Moravejosharieh - One of the best experts on this subject based on the ideXlab platform.
-
ICON - Study of resource utilization in IEEE 802.15.4 Wireless Body Sensor Network, Part II: Greedy Channel Utilization
2013 19th IEEE International Conference on Networks (ICON), 2013Co-Authors: Amirhossein Moravejosharieh, Ehsan Tabatabaei Yazdi, Andreas WilligAbstract:The channel scarcity phenomenon has recently introduced new challenges in the field of Wireless Body Sensor Networks (WBSNs). Within a WBSN, node's communication is restricted throughout their defined active period. As the number of WBSNs increases, the overlapping active periods are elevated due to inefficient utilization of the spectrum. This consequently results in higher Packet Loss Ratio and eventually performance degradation of the WBSNs entirely. To overcome the aforementioned issue, in this paper, we have proposed a new scheme called “Greedy Channel Utilization” (GCU) scheme in which coordinators compete for slot reservation and attempt to utilize the channel voraciously by pushing other contestants in to sleep mode. To evaluate the performance of our proposed scheme, we compared it with the bare IEEE 802.15.4 Std. in terms of channel utilization percentage, Packet Loss Ratio, sensor's orphan time and energy consumption of sensors and coordinator. Eventually, this study concludes the outperformance of GCU scheme over the blind scheme.
-
Study of resource utilization in IEEE 802.15.4 Wireless Body Sensor Network, Part II: Greedy Channel Utilization
IEEE International Conference on Networks ICON, 2013Co-Authors: Amirhossein Moravejosharieh, Ehsan Tabatabaei Yazdi, Andreas WilligAbstract:The channel scarcity phenomenon has recently introduced new challenges in the field of Wireless Body Sensor Networks (WBSNs). Within a WBSN, node's communication is restricted throughout their defined active period. As the number of WBSNs increases, the overlapping active periods are elevated due to inefficient utilization of the spectrum. This consequently results in higher Packet Loss Ratio and eventually performance degradation of the WBSNs entirely. To overcome the aforementioned issue, in this paper, we have proposed a new scheme called “Greedy Channel Utilization” (GCU) scheme in which coordinators compete for slot reservation and attempt to utilize the channel voraciously by pushing other contestants in to sleep mode. To evaluate the performance of our proposed scheme, we compared it with the bare IEEE 802.15.4 Std. in terms of channel utilization percentage, Packet Loss Ratio, sensor's orphan time and energy consumption of sensors and coordinator. Eventually, this study concludes the outperformance of GCU scheme over the blind scheme.
Chonggang Wang - One of the best experts on this subject based on the ideXlab platform.
-
LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement
IEEE Transactions on Parallel and Distributed Systems, 2020Co-Authors: Chonggang Wang, Bo Li, Kazem SohrabyAbstract:Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, Random Early Detection ( RED), and many of its variants employ queue length as a congestion indicator to trigger Packet dropping. Despite their simplicity, these approaches often suffer from unstable behaviors in a dynamic network. Adaptive parameter settings, though might solve the problem, remain difficult in such a complex system. Recent proposals based on analytical TCP control and AQM models suggest the use of both queue length and traffic input rate as congestion indicators, which effectively enhances stability. Their response time generally increases however, leading to frequent buffer overflow and emptiness. In this paper, we propose a novel AQM algorithm that achieves fast response time and yet good robustness. The algorithm, called Loss Ratio-based RED (LRED), measures the latest Packet Loss Ratio, and uses it as a complement to queue length for adaptively adjusting the Packet drop probability. We develop an analytical model for LRED, which demonstrates that LRED is responsive even if the number of TCP flows and their persisting times vary significantly. It also provides a general guideline for the parameter settings in LRED. The performance of LRED is further examined under various simulated network environments, and compared to existing AQM algorithms. Our simulation results show that, with comparable complexities, LRED achieves shorter response time and higher robustness. More importantly, it trades off the goodput with queue length better than existing algorithms, enabling flexible system configuRations
-
LRED: A robust and responsive AQM algorithm using Packet Loss Ratio measurement
IEEE Transactions on Parallel and Distributed Systems, 2007Co-Authors: Chonggang Wang, Jiangchuan Liu, Kazem Sohraby, Bo Li, Y. Thomas HouAbstract:Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, random early detection (RED), and many of its variants employ queue length as a congestion indicator to trigger Packet dropping. Despite their simplicity, these approaches often suffer from unstable behaviors in a dynamic network. Adaptive parameter settings, though might solve the problem, remain difficult in such a complex system. Recent proposals based on analytical TCP control and AQM models suggest the use of both queue length and traffic input rate as congestion indicators, which effectively enhances stability. Their response time generally increases however, leading to frequent buffer overflow and emptiness. In this paper, we propose a novel AQM algorithm that achieves fast response time and yet good robustness. The algorithm, called Loss Ratio-based RED (LRED), measures the latest Packet Loss Ratio, and uses it as a complement to queue length for adaptively adjusting the Packet drop probability. We develop an analytical model for LRED, which demonstrates that LRED is responsive even if the number of TCP flows and their persisting times vary significantly. It also provides a general guideline for the parameter settings in LRED. The performance of LRED is further examined under various simulated network environments, and compared to existing AQM algorithms. Our simulation results show that, with comparable complexities, LRED achieves shorter response time and higher robustness. More importantly, it trades off the goodput with queue length better than existing algorithms, enabling flexible system configuRations
-
An adaptive algorithm for active queue management
Journal of Combinatorial Optimization, 2006Co-Authors: Chonggang Wang, Kazem Sohraby, Bo LiAbstract:This paper proposes an adaptive proportional integral (API) algorithm for active queue management. API uses mean Packet Loss Ratio and mean queue length as control error to adaptively adjust Packet drop probability in order to expedite congestion control. The extensive simulations validate that API achieves faster control response and improved performance in terms of goodput, average queue length, and Packet Loss Ratio.
-
LRED: a robust active queue management scheme based on Packet Loss Ratio
IEEE INFOCOM 2004, 2004Co-Authors: Chonggang Wang, Bin Li, Kazem SohrabyAbstract:Active queue management (AQM) is an effective method to enhance congestion control, and to achieve tradeoff between link utilization and delay. The de facto standard, random early detection (RED), and most of its variants use queue length as a congestion indicator to trigger Packet dropping. The proportional-integral (PI), use both queue length and traffic input rate as congestion indicators; effective stability model and practical design rules built on the TCP control model and abstracted AQM model reveal that such schemes enhance the stability of a system. In this paper, we propose an AQM scheme with fast response time, yet good robustness. The scheme, called Loss Ratio based RED (LRED), measures the latest Packet Loss Ratio, and uses it as a complement to queue length in order to dynamically adjust Packet drop probability. Employing the closed-form relationship between Packet Loss Ratio and the number of TCP flows, this scheme is responsive even if the number of TCP flows varies significantly. We also provide the design rules for this scheme based on the well-known TCP control model. This scheme's performance is examined under various network configuRations, and compared to existing AQM schemes, including PI, random exponentially marking (REM), and adaptive virtual queue (AVQ). Our simulation results show that, with comparable complexity', this scheme has short response time, better robustness, and more desirable tradeoff than PI, REM, and AQV, especially under highly dynamic network and heavy traffic load.
-
INFOCOM - LRED: a robust active queue management scheme based on Packet Loss Ratio
IEEE INFOCOM 2004, 2004Co-Authors: Chonggang Wang, Bin Li, Kazem SohrabyAbstract:Active queue management (AQM) is an effective method to enhance congestion control, and to achieve tradeoff between link utilization and delay. The de facto standard, random early detection (RED), and most of its variants use queue length as a congestion indicator to trigger Packet dropping. The proportional-integral (PI), use both queue length and traffic input rate as congestion indicators; effective stability model and practical design rules built on the TCP control model and abstracted AQM model reveal that such schemes enhance the stability of a system. In this paper, we propose an AQM scheme with fast response time, yet good robustness. The scheme, called Loss Ratio based RED (LRED), measures the latest Packet Loss Ratio, and uses it as a complement to queue length in order to dynamically adjust Packet drop probability. Employing the closed-form relationship between Packet Loss Ratio and the number of TCP flows, this scheme is responsive even if the number of TCP flows varies significantly. We also provide the design rules for this scheme based on the well-known TCP control model. This scheme's performance is examined under various network configuRations, and compared to existing AQM schemes, including PI, random exponentially marking (REM), and adaptive virtual queue (AVQ). Our simulation results show that, with comparable complexity', this scheme has short response time, better robustness, and more desirable tradeoff than PI, REM, and AQV, especially under highly dynamic network and heavy traffic load.
Kazem Sohraby - One of the best experts on this subject based on the ideXlab platform.
-
LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement
IEEE Transactions on Parallel and Distributed Systems, 2020Co-Authors: Chonggang Wang, Bo Li, Kazem SohrabyAbstract:Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, Random Early Detection ( RED), and many of its variants employ queue length as a congestion indicator to trigger Packet dropping. Despite their simplicity, these approaches often suffer from unstable behaviors in a dynamic network. Adaptive parameter settings, though might solve the problem, remain difficult in such a complex system. Recent proposals based on analytical TCP control and AQM models suggest the use of both queue length and traffic input rate as congestion indicators, which effectively enhances stability. Their response time generally increases however, leading to frequent buffer overflow and emptiness. In this paper, we propose a novel AQM algorithm that achieves fast response time and yet good robustness. The algorithm, called Loss Ratio-based RED (LRED), measures the latest Packet Loss Ratio, and uses it as a complement to queue length for adaptively adjusting the Packet drop probability. We develop an analytical model for LRED, which demonstrates that LRED is responsive even if the number of TCP flows and their persisting times vary significantly. It also provides a general guideline for the parameter settings in LRED. The performance of LRED is further examined under various simulated network environments, and compared to existing AQM algorithms. Our simulation results show that, with comparable complexities, LRED achieves shorter response time and higher robustness. More importantly, it trades off the goodput with queue length better than existing algorithms, enabling flexible system configuRations
-
LRED: A robust and responsive AQM algorithm using Packet Loss Ratio measurement
IEEE Transactions on Parallel and Distributed Systems, 2007Co-Authors: Chonggang Wang, Jiangchuan Liu, Kazem Sohraby, Bo Li, Y. Thomas HouAbstract:Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, random early detection (RED), and many of its variants employ queue length as a congestion indicator to trigger Packet dropping. Despite their simplicity, these approaches often suffer from unstable behaviors in a dynamic network. Adaptive parameter settings, though might solve the problem, remain difficult in such a complex system. Recent proposals based on analytical TCP control and AQM models suggest the use of both queue length and traffic input rate as congestion indicators, which effectively enhances stability. Their response time generally increases however, leading to frequent buffer overflow and emptiness. In this paper, we propose a novel AQM algorithm that achieves fast response time and yet good robustness. The algorithm, called Loss Ratio-based RED (LRED), measures the latest Packet Loss Ratio, and uses it as a complement to queue length for adaptively adjusting the Packet drop probability. We develop an analytical model for LRED, which demonstrates that LRED is responsive even if the number of TCP flows and their persisting times vary significantly. It also provides a general guideline for the parameter settings in LRED. The performance of LRED is further examined under various simulated network environments, and compared to existing AQM algorithms. Our simulation results show that, with comparable complexities, LRED achieves shorter response time and higher robustness. More importantly, it trades off the goodput with queue length better than existing algorithms, enabling flexible system configuRations
-
An adaptive algorithm for active queue management
Journal of Combinatorial Optimization, 2006Co-Authors: Chonggang Wang, Kazem Sohraby, Bo LiAbstract:This paper proposes an adaptive proportional integral (API) algorithm for active queue management. API uses mean Packet Loss Ratio and mean queue length as control error to adaptively adjust Packet drop probability in order to expedite congestion control. The extensive simulations validate that API achieves faster control response and improved performance in terms of goodput, average queue length, and Packet Loss Ratio.
-
LRED: a robust active queue management scheme based on Packet Loss Ratio
IEEE INFOCOM 2004, 2004Co-Authors: Chonggang Wang, Bin Li, Kazem SohrabyAbstract:Active queue management (AQM) is an effective method to enhance congestion control, and to achieve tradeoff between link utilization and delay. The de facto standard, random early detection (RED), and most of its variants use queue length as a congestion indicator to trigger Packet dropping. The proportional-integral (PI), use both queue length and traffic input rate as congestion indicators; effective stability model and practical design rules built on the TCP control model and abstracted AQM model reveal that such schemes enhance the stability of a system. In this paper, we propose an AQM scheme with fast response time, yet good robustness. The scheme, called Loss Ratio based RED (LRED), measures the latest Packet Loss Ratio, and uses it as a complement to queue length in order to dynamically adjust Packet drop probability. Employing the closed-form relationship between Packet Loss Ratio and the number of TCP flows, this scheme is responsive even if the number of TCP flows varies significantly. We also provide the design rules for this scheme based on the well-known TCP control model. This scheme's performance is examined under various network configuRations, and compared to existing AQM schemes, including PI, random exponentially marking (REM), and adaptive virtual queue (AVQ). Our simulation results show that, with comparable complexity', this scheme has short response time, better robustness, and more desirable tradeoff than PI, REM, and AQV, especially under highly dynamic network and heavy traffic load.
-
INFOCOM - LRED: a robust active queue management scheme based on Packet Loss Ratio
IEEE INFOCOM 2004, 2004Co-Authors: Chonggang Wang, Bin Li, Kazem SohrabyAbstract:Active queue management (AQM) is an effective method to enhance congestion control, and to achieve tradeoff between link utilization and delay. The de facto standard, random early detection (RED), and most of its variants use queue length as a congestion indicator to trigger Packet dropping. The proportional-integral (PI), use both queue length and traffic input rate as congestion indicators; effective stability model and practical design rules built on the TCP control model and abstracted AQM model reveal that such schemes enhance the stability of a system. In this paper, we propose an AQM scheme with fast response time, yet good robustness. The scheme, called Loss Ratio based RED (LRED), measures the latest Packet Loss Ratio, and uses it as a complement to queue length in order to dynamically adjust Packet drop probability. Employing the closed-form relationship between Packet Loss Ratio and the number of TCP flows, this scheme is responsive even if the number of TCP flows varies significantly. We also provide the design rules for this scheme based on the well-known TCP control model. This scheme's performance is examined under various network configuRations, and compared to existing AQM schemes, including PI, random exponentially marking (REM), and adaptive virtual queue (AVQ). Our simulation results show that, with comparable complexity', this scheme has short response time, better robustness, and more desirable tradeoff than PI, REM, and AQV, especially under highly dynamic network and heavy traffic load.
Ehsan Tabatabaei Yazdi - One of the best experts on this subject based on the ideXlab platform.
-
ICON - Study of resource utilization in IEEE 802.15.4 Wireless Body Sensor Network, Part II: Greedy Channel Utilization
2013 19th IEEE International Conference on Networks (ICON), 2013Co-Authors: Amirhossein Moravejosharieh, Ehsan Tabatabaei Yazdi, Andreas WilligAbstract:The channel scarcity phenomenon has recently introduced new challenges in the field of Wireless Body Sensor Networks (WBSNs). Within a WBSN, node's communication is restricted throughout their defined active period. As the number of WBSNs increases, the overlapping active periods are elevated due to inefficient utilization of the spectrum. This consequently results in higher Packet Loss Ratio and eventually performance degradation of the WBSNs entirely. To overcome the aforementioned issue, in this paper, we have proposed a new scheme called “Greedy Channel Utilization” (GCU) scheme in which coordinators compete for slot reservation and attempt to utilize the channel voraciously by pushing other contestants in to sleep mode. To evaluate the performance of our proposed scheme, we compared it with the bare IEEE 802.15.4 Std. in terms of channel utilization percentage, Packet Loss Ratio, sensor's orphan time and energy consumption of sensors and coordinator. Eventually, this study concludes the outperformance of GCU scheme over the blind scheme.
-
Study of resource utilization in IEEE 802.15.4 Wireless Body Sensor Network, Part II: Greedy Channel Utilization
IEEE International Conference on Networks ICON, 2013Co-Authors: Amirhossein Moravejosharieh, Ehsan Tabatabaei Yazdi, Andreas WilligAbstract:The channel scarcity phenomenon has recently introduced new challenges in the field of Wireless Body Sensor Networks (WBSNs). Within a WBSN, node's communication is restricted throughout their defined active period. As the number of WBSNs increases, the overlapping active periods are elevated due to inefficient utilization of the spectrum. This consequently results in higher Packet Loss Ratio and eventually performance degradation of the WBSNs entirely. To overcome the aforementioned issue, in this paper, we have proposed a new scheme called “Greedy Channel Utilization” (GCU) scheme in which coordinators compete for slot reservation and attempt to utilize the channel voraciously by pushing other contestants in to sleep mode. To evaluate the performance of our proposed scheme, we compared it with the bare IEEE 802.15.4 Std. in terms of channel utilization percentage, Packet Loss Ratio, sensor's orphan time and energy consumption of sensors and coordinator. Eventually, this study concludes the outperformance of GCU scheme over the blind scheme.
