The Experts below are selected from a list of 2964 Experts worldwide ranked by ideXlab platform
Efstathios D Sykas - One of the best experts on this subject based on the ideXlab platform.
-
Destination Buffer analysis for packets rejection obliteration in multi channel networks
Journal of The Franklin Institute-engineering and Applied Mathematics, 2019Co-Authors: Peristera A Baziana, Georgia Fragkouli, Efstathios D SykasAbstract:Abstract In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver Buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronous access protocol which is affected by the collisions over the multiple channels and the Destination conflicts. The proposed protocol performance crucially depends on the size of the receiver Buffer since it determines the packet rejection probability at Destination. An analytical probabilistic model based on a Markovian process is adopted for the performance measures derivation by means of closed mathematical formulas. The proposed protocol is compared to relative ones that either totally ignore the receiver collisions or assume a receiver Buffer of a single packet capacity. The numerical results show that the increase of the receiver Buffer size improves the performance decisively, resulting in higher throughput and lower delay and rejection probability. Also, it is shown that the appropriate receiver Buffer size per station in order for the rejections at Destination to be effectively eliminated is not unlimited but is limited to three packets for 0.1% accepted maximum level of rejection probability.
Zhi Chen - One of the best experts on this subject based on the ideXlab platform.
-
Improving Physical Layer Security Using UAV-Enabled Mobile Relaying
IEEE Wireless Communications Letters, 2017Co-Authors: Qian Wang, Weidong Mei, Zhi Chen, Jun FangAbstract:Mobile relaying has aroused great interest in wireless communications recently, thanks to the rapid development and evolvement of unmanned aerial vehicles. This letter establishes the utility of mobile relaying in facilitating secure wireless communications. In particular, we consider transmit optimization in a four-node (source, Destination, Buffer-aided mobile relay, and eavesdropper) channel setup, wherein we aim at maximizing the secrecy rate of this system. However, the secrecy rate maximization problem is nonconvex and intractable to solve. To circumvent the nonconvexity, we exploit the difference-of-concave (DC) program to develop an iterative algorithm, which is proven to have Karush-Kuhn-Tucker point convergence guarantee. The algorithm conducts a water-filling-based solution in each DC iteration, and thus is computationally efficient to implement. In addition, for a given special case, we show that each DC iteration could yield a closed-form solution, which further reduces the computational complexity. Simulation results demonstrate that the proposed mobile relaying scheme could significantly outperform the static relaying scheme in terms of secrecy enhancement.
-
optimal link selection in multi source and multi Destination Buffer aided relay network
Vehicular Technology Conference, 2015Co-Authors: Zhi Chen, Yu GongAbstract:This paper studies the link selection protocol for the relay network consisting of N pairs of sources and Destinations, and one half-duplex decode-and- forwarding (DF) relay equipped with data Buffers. An optimal link selection scheme is proposed to maximize the average throughput of the relay network. Using the Karush-Kuhn-Tucker (KKT) conditions, the decision function for the optimal link selection is also obtained for Rayleigh fading channels. Simulation are given to verify the proposed scheme. The results show that the proposed scheme achieves not only significantly higher data rate than the classic max-min scheme without data Buffers at the relay, but also the existing Buffer- aided link selection schemes such as the max-max scheme. This making the proposed scheme attractive in practice.
Peristera A Baziana - One of the best experts on this subject based on the ideXlab platform.
-
Destination Buffer analysis for packets rejection obliteration in multi channel networks
Journal of The Franklin Institute-engineering and Applied Mathematics, 2019Co-Authors: Peristera A Baziana, Georgia Fragkouli, Efstathios D SykasAbstract:Abstract In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver Buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronous access protocol which is affected by the collisions over the multiple channels and the Destination conflicts. The proposed protocol performance crucially depends on the size of the receiver Buffer since it determines the packet rejection probability at Destination. An analytical probabilistic model based on a Markovian process is adopted for the performance measures derivation by means of closed mathematical formulas. The proposed protocol is compared to relative ones that either totally ignore the receiver collisions or assume a receiver Buffer of a single packet capacity. The numerical results show that the increase of the receiver Buffer size improves the performance decisively, resulting in higher throughput and lower delay and rejection probability. Also, it is shown that the appropriate receiver Buffer size per station in order for the rejections at Destination to be effectively eliminated is not unlimited but is limited to three packets for 0.1% accepted maximum level of rejection probability.
Jun Fang - One of the best experts on this subject based on the ideXlab platform.
-
Improving Physical Layer Security Using UAV-Enabled Mobile Relaying
IEEE Wireless Communications Letters, 2017Co-Authors: Qian Wang, Weidong Mei, Zhi Chen, Jun FangAbstract:Mobile relaying has aroused great interest in wireless communications recently, thanks to the rapid development and evolvement of unmanned aerial vehicles. This letter establishes the utility of mobile relaying in facilitating secure wireless communications. In particular, we consider transmit optimization in a four-node (source, Destination, Buffer-aided mobile relay, and eavesdropper) channel setup, wherein we aim at maximizing the secrecy rate of this system. However, the secrecy rate maximization problem is nonconvex and intractable to solve. To circumvent the nonconvexity, we exploit the difference-of-concave (DC) program to develop an iterative algorithm, which is proven to have Karush-Kuhn-Tucker point convergence guarantee. The algorithm conducts a water-filling-based solution in each DC iteration, and thus is computationally efficient to implement. In addition, for a given special case, we show that each DC iteration could yield a closed-form solution, which further reduces the computational complexity. Simulation results demonstrate that the proposed mobile relaying scheme could significantly outperform the static relaying scheme in terms of secrecy enhancement.
Yu Gong - One of the best experts on this subject based on the ideXlab platform.
-
optimal link selection in multi source and multi Destination Buffer aided relay network
Vehicular Technology Conference, 2015Co-Authors: Zhi Chen, Yu GongAbstract:This paper studies the link selection protocol for the relay network consisting of N pairs of sources and Destinations, and one half-duplex decode-and- forwarding (DF) relay equipped with data Buffers. An optimal link selection scheme is proposed to maximize the average throughput of the relay network. Using the Karush-Kuhn-Tucker (KKT) conditions, the decision function for the optimal link selection is also obtained for Rayleigh fading channels. Simulation are given to verify the proposed scheme. The results show that the proposed scheme achieves not only significantly higher data rate than the classic max-min scheme without data Buffers at the relay, but also the existing Buffer- aided link selection schemes such as the max-max scheme. This making the proposed scheme attractive in practice.