The Experts below are selected from a list of 64791 Experts worldwide ranked by ideXlab platform
Jamie Evans - One of the best experts on this subject based on the ideXlab platform.
-
Average Transmission Success Probability Bound for SWIPT Relay Networks
arXiv: Signal Processing, 2019Co-Authors: Bhathiya Pilanawithana, Saman Atapattu, Jamie EvansAbstract:Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The relay is equipped with a finite capacity battery. The system performance, which is characterized by the average Success Probability of source to destination transmission, is a function of the resource allocation policy that selects the PS ratio and the transmit energy of the relay. We develop a mathematical framework to find an upper bound for the maximum the average Success Probability. The upper bound is formulated by a discrete state space Markov decision problem (MDP) and make use of a policy iteration algorithm to calculate it.
-
WCNC - Average Transmission Success Probability Bound for SWIPT Relay Networks
2019 IEEE Wireless Communications and Networking Conference (WCNC), 2019Co-Authors: Bhathiya Pilanawithana, Saman Atapattu, Jamie EvansAbstract:Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The relay is equipped with a finite capacity battery. The system performance, which is characterized by the average Success Probability of source to destination transmission, is a function of the resource allocation policy that selects the PS ratio and the transmit energy of the relay. We develop a mathematical framework to find an upper bound for the maximum the average Success Probability. The upper bound is formulated by a discrete state space Markov decision problem (MDP) and make use of a policy iteration algorithm to calculate it.
Mingsheng Ying - One of the best experts on this subject based on the ideXlab platform.
-
mathematical nature of and a family of lower bounds for the Success Probability of unambiguous discrimination
Physical Review A, 2002Co-Authors: Xiaoming Sun, Shengyu Zhang, Yuan Feng, Mingsheng YingAbstract:Unambiguous discrimination is a strategy to the discrimination problem that identifies the state with certainty, leaving a possibility of undecidability. This paper points out that the optimal Success Probability of unambiguous discrimination is mathematically the well-known semidefinite programming problem. A family of lower bounds of the optimal Success Probability is also given.
-
Upper bound for the Success Probability of unambiguous discrimination among quantum states
Physical Review A, 2001Co-Authors: Shengyu Zhang, Xiaoming Sun, Yuan Feng, Mingsheng YingAbstract:One strategy to the discrimination problem is to identify the state with certainty, leaving a possibility of undecidability. This paper gives an upper bound for the maximal Success Probability of unambiguous discrimination among n states. This bound coincides with the known IDP limit when two states are considered.
Bhathiya Pilanawithana - One of the best experts on this subject based on the ideXlab platform.
-
Average Transmission Success Probability Bound for SWIPT Relay Networks
arXiv: Signal Processing, 2019Co-Authors: Bhathiya Pilanawithana, Saman Atapattu, Jamie EvansAbstract:Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The relay is equipped with a finite capacity battery. The system performance, which is characterized by the average Success Probability of source to destination transmission, is a function of the resource allocation policy that selects the PS ratio and the transmit energy of the relay. We develop a mathematical framework to find an upper bound for the maximum the average Success Probability. The upper bound is formulated by a discrete state space Markov decision problem (MDP) and make use of a policy iteration algorithm to calculate it.
-
WCNC - Average Transmission Success Probability Bound for SWIPT Relay Networks
2019 IEEE Wireless Communications and Networking Conference (WCNC), 2019Co-Authors: Bhathiya Pilanawithana, Saman Atapattu, Jamie EvansAbstract:Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The relay is equipped with a finite capacity battery. The system performance, which is characterized by the average Success Probability of source to destination transmission, is a function of the resource allocation policy that selects the PS ratio and the transmit energy of the relay. We develop a mathematical framework to find an upper bound for the maximum the average Success Probability. The upper bound is formulated by a discrete state space Markov decision problem (MDP) and make use of a policy iteration algorithm to calculate it.
Martin Haenggi - One of the best experts on this subject based on the ideXlab platform.
-
Success Probability of millimeter wave d2d networks with heterogeneous antenna arrays
Wireless Communications and Networking Conference, 2018Co-Authors: Na Deng, Yi Sun, Martin HaenggiAbstract:This paper focuses on the Success Probability (or, equivalently, the signal-to-interference-plus-noise ratio (SINR) distribution) at the typical receiver in millimeter wave (mm-wave) device-to-device (D2D) networks. Unlike earlier works, we consider a more general and realistic case where devices in the network are equipped with heterogeneous antenna arrays so that the concurrent transmission beams are varying in width. Specifically, we first establish a general and tractable framework for the target network with Nakagami fading and directional beamforming. Next, we investigate the interactions among beams with different widths and their sensitivities to the adopted model for the antenna pattern. In addition, to show the impact of heterogeneous antenna arrays on the link performance, we derive the Success Probability of the typical receiver as well as its bounds to get deep insights on the performance of the network.
-
WCNC - Success Probability of millimeter-wave D2D networks with heterogeneous antenna arrays
2018 IEEE Wireless Communications and Networking Conference (WCNC), 2018Co-Authors: Na Deng, Yi Sun, Martin HaenggiAbstract:This paper focuses on the Success Probability (or, equivalently, the signal-to-interference-plus-noise ratio (SINR) distribution) at the typical receiver in millimeter wave (mm-wave) device-to-device (D2D) networks. Unlike earlier works, we consider a more general and realistic case where devices in the network are equipped with heterogeneous antenna arrays so that the concurrent transmission beams are varying in width. Specifically, we first establish a general and tractable framework for the target network with Nakagami fading and directional beamforming. Next, we investigate the interactions among beams with different widths and their sensitivities to the adopted model for the antenna pattern. In addition, to show the impact of heterogeneous antenna arrays on the link performance, we derive the Success Probability of the typical receiver as well as its bounds to get deep insights on the performance of the network.
Harpreet S. Dhillon - One of the best experts on this subject based on the ideXlab platform.
-
Success Probability and Area Spectral Efficiency of a VANET Modeled as a Cox Process
arXiv: Information Theory, 2018Co-Authors: Vishnu Vardhan Chetlur, Harpreet S. DhillonAbstract:This paper analyzes the performance of a vehicular ad hoc network (VANET) modeled as a Cox process, where the spatial layout of the roads is modeled by a Poisson line process (PLP) and the locations of nodes on each line are modeled as a 1D Poisson point process (PPP). For this setup, we characterize the Success Probability of a typical link and the area spectral efficiency (ASE) of the network assuming slotted ALOHA as the channel access scheme. We then concretely establish that the Success Probability of a typical link in a VANET modeled using a Cox process converges to that of a 1D and 2D PPP for some extreme values of the line and node densities. We also study the trends in Success Probability as a function of the system parameters and show that the optimum transmission Probability that maximizes the ASE for this Cox process model differs significantly from those of the relatively-simpler 1D and 2D PPP models used commonly in the literature to model vehicular networks.
-
Success Probability and Area Spectral Efficiency of a VANET Modeled as a Cox Process
IEEE Wireless Communications Letters, 2018Co-Authors: Vishnu Vardhan Chetlur, Harpreet S. DhillonAbstract:This letter analyzes the performance of a vehicular ad hoc network (VANET) modeled as a Cox process, where the spatial layout of the roads is modeled by a Poisson line process and the locations of nodes on each line are modeled as a 1-D Poisson point process (PPP). For this setup, we characterize the Success Probability of a typical link and the area spectral efficiency (ASE) of the network assuming slotted ALOHA as the channel access scheme. We then concretely establish that the Success Probability of a typical link in a VANET modeled using a Cox process converges to that of a 1-D and 2-D PPP for some extreme values of the line and node densities. We also study the trends in Success Probability as a function of the system parameters and show that the optimum transmission Probability that maximizes the ASE for this Cox process model differs significantly from those of the relatively simpler 1-D and 2-D PPP models used commonly in the literature to model vehicular networks.
