Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2020, IEEE Systems Journal
…
5 pages
1 file
In deterministic networks where relay nodes are stationary, combined relay selection is an efficient relay selection scheme, which is capable of achieving the near-optimal outage performance with much lower system complexity. However, the efficiency of combined relay selection is only validated upon fixed topological settings. To investigate the performance of combined relay selection in spatially random networks (SRNs), we employ the Poisson point process to model the dynamical nature of cooperative networks and study the outage performance of the proposed system. It is surprising that the equivalence principle of combined relay selection appearing in deterministic networks does not hold in SRNs.
ICC 2019 - 2019 IEEE International Conference on Communications (ICC)
This paper investigates the location-based relay selection problem, where the source node chooses its relay from a set of spatially deployed decode-and-forward relays. The advantages of location-based relay selection are the elimination of excessive relay switching rate and the feedback reduction avoiding the requirement of having full channel state information at the source node. For a homogeneous Poisson point process of candidate relays, we first derive the distribution for the distance of the relay (relative to the source and destination nodes) selected by the optimum location-based relay selection policy. This result is independent of the functional form of the path-loss function as long as it is a non-increasing function of the transmitter-receiver separation. By utilizing the derived optimum relay distance distribution, we then obtain analytical expressions for the average rate and outage probability by considering the powerlaw decaying path-loss function for the no-fading and Rayleigh fading communication scenarios. It is observed that the optimum relay selection policy outperforms the other common selection strategies notably, including the ones choosing the relay closest to the source, the relay closest to the destination and the relay closest to the mid-point between source and destination.
2019 IEEE Global Communications Conference (GLOBECOM), 2019
This paper considers a location-based optimal relay selection scheme for a relay-assisted wireless network where available decode-and-forward relays are distributed as a homogeneous Poisson point process. To solve an optimum relay selection problem, a central entity or the source requires information pertaining to all relay locations. Since the task of feeding this information back is impractical, we investigate a threshold-based limited feedback distributed relay selection policy. We show that the total number of relays feeding back is a Poisson distributed random variable. For a given threshold-based limited feedback distributed relay selection policy, we obtain analytical expressions for the average rate and the outage probability over the fading and no-fading communication scenarios. The derived analytical expressions are verified and the performance achieved by the proposed relay selection policy is illustrated through extensive simulations. It is observed that the limited feedback distributed relay selection policy can achieve almost the same performance with the optimum relay selection policy by only utilizing location information from a few number of relays.
2020
This paper derives the performance and key structural properties of optimum location-based relay selection schemes for wireless networks consisting of spatially deployed decode-and-forward relays. For a homogeneous Poisson point process (PPP) of relays and general path-loss models, we obtain the distribution for channel quality indicator of the relay selected by the optimum location-based relay selection policy. For feedback reduction, we investigate a class of threshold-based distributed relay selection policies. For this class, we show that the total number of relays feeding back is a Poisson distributed random variable and obtain an analytical expression for the average feedback load. We derive analytical expressions for the average rate and the outage probability for the fading and no-fading scenarios with and without full feedback. As generalizations, we study the optimum relay selection problem for two other scenarios: i) isotropic Poisson point processes and ii) heterogeneous...
In this paper, the performance of opportunistic relaying in a dual-hop decode-and-forward (DF) relay network is analyzed where the intermediate relay nodes are distributed according to a homogeneous Poisson point process with fixed density. A sectorized relay selection region is considered, where the "best relay" is selected among those potential relay nodes that lie in this region. In particular, the density of the potential relay nodes and the closed-form expression for outage probability of the system with maximal ratio combining (MRC) receiver at the destination, is derived based on the theory of point processes. Our results show that, as expected, MRC receiver outperforms the selection combining (SC) receiver at spatially random networks. The results of this paper are attested through Monte-Carlo simulations.
IEEE Transactions on Vehicular Technology, 2017
A new, fair relay selection scheme is proposed for a dual-hop decode-and-forward network with randomlydistributed relays. Most of the reported works in the literature achieve fairness at the expense of degrading the outage probability performance. In addition, they often assume that the number and locations of the relays are known. In contrast, the proposed scheme achieves fairness in a random field of relays without deteriorating the outage probability performance. In this scheme, each relay maintains a countdown timer whose initial value is a function of the relay location and a tunable parameter which controls the level of fairness. The optimum value of this parameter is evaluated in an offline manner so as to achieve fairness by making the average powers consumed by the relays as close as possible. An exact analytical expression is derived for the average power consumed by each relay. This expression is then used to show the superiority of the proposed scheme over opportunistic relaying and random relay selection schemes. Index Terms-Decode-and-forward (DF) relaying, fairness, outage probability, Poisson point process, stochastic geometry. I. INTRODUCTION Cooperative communication is known to be an effective means for combating the adverse effect of multipath fading on wireless communication systems [1], [2]. In a cooperative system, idle users (referred to as relays in the sequel) serve as virtual antennas for the source and destination nodes allowing them to achieve spatial diversity [3]. Cooperative communication was first introduced in [4] and then further investigated in [5] and more recently in [2]. Several cooperation protocols have been proposed in the literature among which amplify-and-forward (AF) and decode-and-forward (DF) have received much attention owing to their simplicity and effectiveness [2], [6]. In order to take better advantage of relaying, signals received from the source and relays have to be properly combined at destination. Opportunistic relaying [7], is a simple yet effective combining scheme in which only a single relay participates in cooperation. This relay should be among the set of relays that can correctly decode the source signal. In addition, it should have the largest relay-destination signal-to-noise power ratio (SNR). An important but less investigated issue in relay networks is to design a fair relaying strategy, i.e., a strategy in which the average powers consumed by the relays are approximately the same. Despite its many advantages, opportunistic relaying suffers from lack of fairness among relays, i.e., a relay with slightly better average channel gain than others is always chosen for cooperation and, hence, its power drains much The authors are with the School of Electrical and Computer Engineering,
2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2007
In this paper we study two-hop cooperative diversity relaying in random wireless networks. In contrast to most work on cooperative diversity relaying where the relay node positions or average channel characteristics are given as parameters, we formulate the problem recognizing that node positions, as well as channel fading states of the channels among the nodes, are random.
IEEE Transactions on Information Theory, 2021
This paper studies the performance and key structural properties of the optimum location-based relay selection policy for wireless networks consisting of homogeneous Poisson distributed relays. The distribution of the channel quality indicator at the optimum relay location is obtained. A thresholdbased distributed selective feedback policy is proposed for the discovery of the optimum relay location with finite average feedback load. It is established that the total number of relays feeding back obeys a Poisson distribution and an analytical expression for the average feedback load is derived. The analytical expressions for the average rate and outage probability with and without selective feedback are also obtained for general path-loss models. It is shown that the optimum location-based relay selection policy outperforms other common relay selection strategies notably. It is also shown that utilizing location information from a small number of relays is enough to achieve almost the same performance with the infinite feedback load case. As generalizations, full-duplex relays, isotropic Poisson point processes, and heterogeneous source-to-relay and relay-to-destination links are also studied.
2012 IEEE International Symposium on Information Theory Proceedings, 2012
This paper investigates the potential gain of cooperation in large wireless networks with multiple sources and relays, where the nodes form an homogeneous Poisson point process. The source nodes may choose their nearest neighbor from the set of inactive nodes as their relay. Although cooperation can potentially lead to significant improvements on the asymptotic error probability of a communication pair, relaying causes additional interference in the network, increasing the average noise. We address the basic question: how should source nodes optimally balance cooperation vs. interference to guarantee reliability in all communication pairs. Based on the decode-and-forward (DF) scheme at the relays, we derive closed-form approximations to the upper bounds on the error probability, averaging over all node positions. Surprisingly, in the small outage probability regime, there is an almost binary behavior that dictates -depending on network parameters-the activation or not of all relay nodes. ∞ 0 t z−1 e −t dt is the Gamma function. Define the functions G(x) = 1 − exp(−x); Q m,n (a, b) is the (m, n)
IET Communications, 2014
A new approach in fairness is proposed by using a probabilistic relay assignment strategy for cooperative communication systems. In this approach, relays are allocated to sources based on a probabilistic relay assignment function, which is characterised by the outage probability. To examine the proposed relay assignment strategy, an exact expression for the outage probability of an opportunistic coded cooperation diversity system is derived. It is assumed that the relays in this system are distributed according to a two-dimensional homogeneous Poisson point process, and the transmission channels undergo Rayleigh fading as well as path loss. It is observed that the proposed strategy reduces the number of requests for using the relays and, thus, utilises the relays more efficiently. Furthermore, compared to the conventional opportunistic relay assignment strategy, the total power consumed by the relays decreases, while the quality of service requirements are still satisfied.
IEEE Transactions on Communications, 2015
Relay selection strategies help to improve spectral and energy efficiencies, to enhance transmission robustness, or to reduce latency in multi-relay cooperative networks. Two novel relay selection strategies are proposed and analyzed here for multipleinput multiple-output (MIMO) amplify-and-forward (AF) two-way relay networks (TWRNs) with spatial multiplexing. Specifically, they are designed to maximize the effective end-to-end signal-to-noise ratio (SNR), and thereby minimize the overall outage probability or maximize the achievable sum rate. Interestingly, the first strategy amounts to maximizing the minimum of the eigenvalues of the Wishart matrices from the selected relay to the two user nodes. Counter-intuitively, the latter strategy amounts to maximizing the minimum of the determinant of the same Wishart matrices. The performance of these two strategies is investigated by deriving lower/upper bounds of the overall outage probability and the average sum rate approximations in closed-form. Further, the asymptotic high SNR approximations of the outage probability are derived, and thereby, the achievable diversity-multiplexing trade-off is quantified. This trade-off reveals that whenever the sum of relay antennas is fixed, the achievable diversity order is always a constant, and hence, the multiplexing gain can indeed be improved by equally distributing antennas among the available set of relays. Our results reveal that relay selection indeed significantly alleviates the inherent diversitygain loss associated with the use of available degrees of freedom for spatial multiplexing.
Action Research and Systemic Practice, 2019
Momentos de empotramiento perfecto y reacciones en los apoyos, 2024
Journal of Hydrology, 2009
Revista Semestral de Direito Empresarial (RSDE), 2021
Journal of Pharmacy Science and Technology, 2023
PROCEEDINGS OF THE ASME INTERNATIONAL MECHANICAL ENGINEERING CONGRESS AND EXPOSITION, 2017
International Forum S.A.V.E. Heritage, Safeguard of Architectural, Visual, Environmental Heritage , 2011
Transportation Research Record: Journal of the Transportation Research Board, 2013
Nephron, 1989
Nur Azizah, 2022
Proceedings of International Conference on Halal Food and Health Nutrition
Journal of Research and Development on Information and Communication Technology, 2015
Journal of Advanced Statistics, 2016
Colloid & Polymer Science, 1992
Journal of the Meteorological Society of Japan. Ser. II, 2009