The Experts below are selected from a list of 11979 Experts worldwide ranked by ideXlab platform
Jonathon A Chambers - One of the best experts on this subject based on the ideXlab platform.
-
buffer aided relay selection with reduced Packet Delay in cooperative networks
IEEE Transactions on Vehicular Technology, 2017Co-Authors: Zhao Tian, Yu Gong, Gaojie Chen, Jonathon A ChambersAbstract:Applying data buffers at relay nodes significantly improves the outage performance in relay networks, but the performance gain is often at the price of long Packet Delays. In this paper, a novel relay selection scheme with significantly reduced Packet Delay is proposed. The outage probability and Average Packet Delay of the proposed scheme under different channel scenarios are analyzed. Simulation results are also given to verify the analysis. The analytical and simulation results show that, compared with non-buffer-aided relay selection schemes, the proposed scheme has not only significant gain in outage performance but also similar Average Packet Delay when the channel signal-to-noise ratio (SNR) is high enough, making it an attractive scheme in practice.
-
buffer aided link selection with network coding in multihop networks
IEEE Transactions on Vehicular Technology, 2016Co-Authors: Zhao Tian, Yu Gong, Gaojie Chen, Zhi Chen, Jonathon A ChambersAbstract:This paper proposes a novel buffer-aided link selection scheme based on network coding in the multiple-hop relay network. The proposed scheme significantly increases transmission throughput by applying data buffers at the relays to decrease the outage probability and using network coding to increase the data rate. The closed-form expressions of both Average throughput and Packet Delay are successfully derived. The proposed scheme not only has significantly higher throughput than both the traditional and existing buffer-aided max-link schemes but smaller Average Packet Delay than the max-link scheme as well, making it an attractive scheme in practice.
Yu Gong - One of the best experts on this subject based on the ideXlab platform.
-
Buffer-aided 5G cooperative networks: Considering the source Delay
2019Co-Authors: Mohammad Alkhawatrah, Yu Gong, Omar Aldabbas, Mohammad HammoudehAbstract:© 2019 Association for Computing Machinery. Applying relays employed with data buffers drastically enhance the performance of cooperative networks. However, lengthening the Packet Delay is still a serious challenge for cooperative networks. This paper thoroughly studies a new factor affecting the Packet Delay which is the source Delay. This factor plays a key role in calculating the total Delay that messages encounter before reaching their destination. This Delay is crucial especially in applications that require their messages to get transmitted as fast as possible. Markov chain is employed to model the system and analyze the source Delay. Numerical simulations verify the analytical model, the results show that buffer-aided relays can beat non-buffer relays in terms of Average Packet Delay, especially at low signal to noise ratio (SNR) range. This makes adding buffers to relays an attractive solution for the Packet Delay in 5G applications
-
using buffers in trust aware relay selection networks with spatially random relays
IEEE Transactions on Wireless Communications, 2018Co-Authors: Yu Gong, Gaojie Chen, Tian XieAbstract:It is well recognized that using buffers in relay networks significantly improves the transmission reliability, which is often at the price of higher Packet Delay. Existing buffer-aided relay networks are all based on the physical links among cooperative nodes. This may, however, lead to performance degradation in practice, because those cooperative nodes may not trust each other for cooperation even though their physical connections are strong. In this paper, we propose a novel buffer-aided relay selection scheme to align data transmission with both strong and trusted links. By maintaining the buffer lengths as close as possible to the newly introduced target buffer lengths, the proposed scheme is able to balance the outage performance and Packet Delay. Both the outage probability and Average Packet Delay are analyzed for spatially random relays. Particularly, we show that the outage performance may have error floors because of the trusts. The analysis shows that using buffers in trust-aware relay networks is able to either increase the diversity order or lower the error floor of the outage probability.
-
buffer aided relay selection with reduced Packet Delay in cooperative networks
IEEE Transactions on Vehicular Technology, 2017Co-Authors: Zhao Tian, Yu Gong, Gaojie Chen, Jonathon A ChambersAbstract:Applying data buffers at relay nodes significantly improves the outage performance in relay networks, but the performance gain is often at the price of long Packet Delays. In this paper, a novel relay selection scheme with significantly reduced Packet Delay is proposed. The outage probability and Average Packet Delay of the proposed scheme under different channel scenarios are analyzed. Simulation results are also given to verify the analysis. The analytical and simulation results show that, compared with non-buffer-aided relay selection schemes, the proposed scheme has not only significant gain in outage performance but also similar Average Packet Delay when the channel signal-to-noise ratio (SNR) is high enough, making it an attractive scheme in practice.
-
buffer aided link selection with network coding in multihop networks
IEEE Transactions on Vehicular Technology, 2016Co-Authors: Zhao Tian, Yu Gong, Gaojie Chen, Zhi Chen, Jonathon A ChambersAbstract:This paper proposes a novel buffer-aided link selection scheme based on network coding in the multiple-hop relay network. The proposed scheme significantly increases transmission throughput by applying data buffers at the relays to decrease the outage probability and using network coding to increase the data rate. The closed-form expressions of both Average throughput and Packet Delay are successfully derived. The proposed scheme not only has significantly higher throughput than both the traditional and existing buffer-aided max-link schemes but smaller Average Packet Delay than the max-link scheme as well, making it an attractive scheme in practice.
Gaojie Chen - One of the best experts on this subject based on the ideXlab platform.
-
using buffers in trust aware relay selection networks with spatially random relays
IEEE Transactions on Wireless Communications, 2018Co-Authors: Yu Gong, Gaojie Chen, Tian XieAbstract:It is well recognized that using buffers in relay networks significantly improves the transmission reliability, which is often at the price of higher Packet Delay. Existing buffer-aided relay networks are all based on the physical links among cooperative nodes. This may, however, lead to performance degradation in practice, because those cooperative nodes may not trust each other for cooperation even though their physical connections are strong. In this paper, we propose a novel buffer-aided relay selection scheme to align data transmission with both strong and trusted links. By maintaining the buffer lengths as close as possible to the newly introduced target buffer lengths, the proposed scheme is able to balance the outage performance and Packet Delay. Both the outage probability and Average Packet Delay are analyzed for spatially random relays. Particularly, we show that the outage performance may have error floors because of the trusts. The analysis shows that using buffers in trust-aware relay networks is able to either increase the diversity order or lower the error floor of the outage probability.
-
buffer aided relay selection with reduced Packet Delay in cooperative networks
IEEE Transactions on Vehicular Technology, 2017Co-Authors: Zhao Tian, Yu Gong, Gaojie Chen, Jonathon A ChambersAbstract:Applying data buffers at relay nodes significantly improves the outage performance in relay networks, but the performance gain is often at the price of long Packet Delays. In this paper, a novel relay selection scheme with significantly reduced Packet Delay is proposed. The outage probability and Average Packet Delay of the proposed scheme under different channel scenarios are analyzed. Simulation results are also given to verify the analysis. The analytical and simulation results show that, compared with non-buffer-aided relay selection schemes, the proposed scheme has not only significant gain in outage performance but also similar Average Packet Delay when the channel signal-to-noise ratio (SNR) is high enough, making it an attractive scheme in practice.
-
buffer aided link selection with network coding in multihop networks
IEEE Transactions on Vehicular Technology, 2016Co-Authors: Zhao Tian, Yu Gong, Gaojie Chen, Zhi Chen, Jonathon A ChambersAbstract:This paper proposes a novel buffer-aided link selection scheme based on network coding in the multiple-hop relay network. The proposed scheme significantly increases transmission throughput by applying data buffers at the relays to decrease the outage probability and using network coding to increase the data rate. The closed-form expressions of both Average throughput and Packet Delay are successfully derived. The proposed scheme not only has significantly higher throughput than both the traditional and existing buffer-aided max-link schemes but smaller Average Packet Delay than the max-link scheme as well, making it an attractive scheme in practice.
Zhao Tian - One of the best experts on this subject based on the ideXlab platform.
-
buffer aided relay selection with reduced Packet Delay in cooperative networks
IEEE Transactions on Vehicular Technology, 2017Co-Authors: Zhao Tian, Yu Gong, Gaojie Chen, Jonathon A ChambersAbstract:Applying data buffers at relay nodes significantly improves the outage performance in relay networks, but the performance gain is often at the price of long Packet Delays. In this paper, a novel relay selection scheme with significantly reduced Packet Delay is proposed. The outage probability and Average Packet Delay of the proposed scheme under different channel scenarios are analyzed. Simulation results are also given to verify the analysis. The analytical and simulation results show that, compared with non-buffer-aided relay selection schemes, the proposed scheme has not only significant gain in outage performance but also similar Average Packet Delay when the channel signal-to-noise ratio (SNR) is high enough, making it an attractive scheme in practice.
-
buffer aided link selection with network coding in multihop networks
IEEE Transactions on Vehicular Technology, 2016Co-Authors: Zhao Tian, Yu Gong, Gaojie Chen, Zhi Chen, Jonathon A ChambersAbstract:This paper proposes a novel buffer-aided link selection scheme based on network coding in the multiple-hop relay network. The proposed scheme significantly increases transmission throughput by applying data buffers at the relays to decrease the outage probability and using network coding to increase the data rate. The closed-form expressions of both Average throughput and Packet Delay are successfully derived. The proposed scheme not only has significantly higher throughput than both the traditional and existing buffer-aided max-link schemes but smaller Average Packet Delay than the max-link scheme as well, making it an attractive scheme in practice.
Piet Demeester - One of the best experts on this subject based on the ideXlab platform.
-
dynamic bandwidth allocation with sla awareness for qos in ethernet passive optical networks
IEEE\ OSA Journal of Optical Communications and Networking, 2013Co-Authors: Abhishek Dixit, Bart Lannoo, Didier Colle, Mario Pickavet, Goutam Das, Piet DemeesterAbstract:Quality-of-service (QoS) support in Ethernet passive optical networks is a crucial concern. We propose a new dynamic bandwidth allocation (DBA) algorithm for service differentiation that meets the service-level agreements (SLAs) of the users. The proposed Delay-aware (DA) online DBA algorithm provides constant and predictable Average Packet Delay and reduced Delay variation for the high- and medium-priority traffic while keeping the Packet loss rate under check. We prove the effectiveness of the proposed algorithm by exhaustive simulations.
