Abstract
In this paper, we consider a network-coded cooperative wireless network, where users mutually pair among themselves to realize network coding. We assume a multi-user environment, where users transmit to a common destination in the absence of dedicated relaying nodes. We address the important problem of the mutual pairing of users, which directly governs the overall network performance. An optimal user pairing algorithm is proposed and tailored to maximize the network capacity. Next, we develop heuristic user pairing schemes, which demonstrate near-optimal performance at significantly reduced computational complexity. In particular, we propose max-max pairing to maximize the network capacity and max-min pairing to minimize the outage probability. We then consider power minimization for energy-constrained networks. A joint optimization problem is formulated and solved to find the pairing which maximizes the network capacity and minimizes the transmission power, while meeting certain network performance constraint, such as in terms of the minimum average capacity per user or maximum average outage probability per user.
Highlights
In contemporary wireless networks, diversity represents an efficient and established means to combat multipath fading
Among the two network coding schemes, max-max pairing is observed to perform worse than random pairing for all N. This is owing to the aggressive nature of the max-max pairing, which leads to a greater variance and spread within pairs, and results in a relatively high average outage probability per user, which is consistent as the number of pairing users increase
7 Conclusions The important problem of the mutual pairing of users in cooperative wireless network coding is addressed in this paper
Summary
Diversity represents an efficient and established means to combat multipath fading. In [22] the authors consider the problem of optimal user selection for cooperative wireless networks, which do not feature network coding, with the objective of energy minimization. J transmits its packet in the second time slot while i listens This is followed by the second (network coding) phase of transmission. J does the same in the second time slot of the second phase This two-source packet transmission model is inspired by the incremental network coding scheme proposed in [9]. The first and the second terms on the right-hand side of (8), cases (a) to (d), represent contributions from the direct transmission and the network coding phases, respectively. The effect of the MRC on capacity is reflected by the addition of the SNRs (e.g., the second term in (8), case (a), where the same network-coded packet si ⊕ sj is received twice over uncorrelated channels)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
