This study investigated relay-assisted mode 1 sidelink (SL) multicast transmission, which encounters interference from mode 2 SL transmission, for use in low-latency vehicle-to-everything communications. To accommodate mode 1--mode 2 SL traffic, we use the hybrid multiple access (MA) approach, which combines orthogonal MA (OMA) and nonorthogonal MA (NOMA) schemes. We introduce a low-complexity location-based hybrid MA algorithm and its associated relay selection that can be used when SL channel state information is unavailable.
Standard upper and lower bounds on the capacity of relay channels are cut-set (CS), decode-forward (DF), and quantize-forward (QF) rates. For real additive white Gaussian noise (AWGN) multicast relay channels with one source node and one relay node, these bounds are shown to be quasi-concave in the receiver signal-to-noise ratios and the squared source-relay correlation coefficient. Furthermore, the CS rates are shown to be quasi-concave in the relay position for a fixed correlation coefficient, and the DF rates are shown to be quasi-concave in the relay position. The latter property character…
In this era of 5G technology, the ever-increasing demands for high data rates lead researchers to develop hybrid satellite-terrestrial (HST) networks as a substitution to the conventional cellular terrestrial systems. Since an HST network suffers from a masking effect which can be mitigated by adopting the terrestrial relaying strategy, in this work, we focus on wireless multicasting through an HST relaying net-work (HSTRN) in which a satellite sends messages to multiple terrestrial nodes via multiple relays under the wiretapping efforts of multiple eavesdroppers. Our concern is to protect the…
The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple access channel with a relay (cMACr), the capacity region of the multiple access channel with a "cognitive" relay is characterized, including the cases of partial and rate-limited cognition. Achievable rate regions for the cMACr model are then presented based on decode-and-forward (DF) and compress-and-forward (CF) relaying strategies. Moreover, an outer bound…
We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi et al. to linear deterministic relay networks and is based on the notion of flow for a unicast session that was introduced by the authors in earlier work. We present randomized and deterministic polynomial--time versions of our algorithm and show that for a network with $g$ destinations, our deterministic algorithm can achieve the capacity in $\left\lceil \log(g+1)\right\rceil $ uses …
The paper studies the scenario of wireless multicast with a single transmitter and a relay that deliver scalable source symbols to the receivers in a decode-and-forward (DF) fashion. With the end-to-end mean square error distortion (EED) as performance metric, we firstly derive the EED expression for the $L$-resolution scalable source symbol for any receiver. An optimization problem in minimizing the weighted EED is then formulated for finding the power allocations for all resolution layers at the transmitter and the relay. Due to nonlinearity of the formulations, we solve the formulated optim…
The secrecy performance of realistic wireless multicast scenarios can be significantly deteriorated by the simultaneous occurrence of multipath and shadowing. To resolve this security threat, in this work an opportunistic relaying-based dual-hop wireless multicast framework is proposed in which the source dispatches confidential information to a bunch of receivers via intermediate relays under the wiretapping attempts of multiple eavesdroppers. Two scenarios, i.e. non-line of sight (NLOS) and line of sight (LOS) communications along with the multiplicative and LOS shadowing are considered wher…
Through ordinary transmissions over wireless multicast networks are greatly hampered due to the simultaneous presence of fading and shadowing of wireless channels, secure transmissions can be enhanced by properly exploiting random attributes of the propagation medium. This study focuses on the utilization of those attributes to enhance the physical layer security (PLS) performance of a dual-hop wireless multicast network over kappa-mu shadow-fading channel under the wiretapping attempts of multiple eavesdroppers. In order to improve the secrecy level, the best relay selection strategy among mu…
In this paper, we completely characterize the deterministic capacity region of a four-node relay network with no direct links between the nodes, where each node communicates with the three other nodes via a relay. Towards this end, we develop an upper bound on the deterministic capacity region, based on the notion of a one-sided genie. To establish achievability, we use the detour schemes that achieve the upper bound by routing specific bits via indirect paths instead of sending them directly.
The problem of simultaneous multicasting of multiple messages with the help of a relay terminal is considered. In particular, a model is studied in which a relay station simultaneously assists two transmitters in multicasting their independent messages to two receivers. The relay may also have an independent message of its own to multicast. As a first step to address this general model, referred to as the compound multiple access channel with a relay (cMACr), the capacity region of the multiple access channel with a "cognitive" relay is characterized, including the cases of partial and rate-li…
We provide a geometric solution to the problem of optimal relay positioning to maximize the multicast rate for low-SNR networks. The networks we consider, consist of a single source, multiple receivers and the only intermediate and locatable node as the relay. We construct network the hypergraph of the system nodes from the underlying information theoretic model of low-SNR regime that operates using superposition coding and FDMA in conjunction (which we call the "achievable hypergraph model"). We make the following contributions. 1) We show that the problem of optimal relay positioning maximiz…
In this paper, we characterize the capacity of a new class of single-source multicast discrete memoryless relay networks having a tree topology in which the root node is the source and each parent node in the graph has at most one noisy child node and any number of noiseless child nodes. This class of multicast tree networks includes the class of diamond networks studied by Kang and Ulukus as a special case, where they showed that the capacity can be strictly lower than the cut-set bound. For achievablity, a novel coding scheme is constructed where each noisy relay employs a combination of dec…
The demand of massive access to the same multimedia content at the same time is one major challenge for next-generation cellular networks in densely-packed urban areas. The content-aware multicast transmission strategies provide promising solutions to such use cases involving many mobile users trying to fetch the same data. In this work, we consider multigroup multicast transmission with a common message (e.g., multimedia content), in which different multicast groups are interested along with their private multicast messages. We further assume that a relay helps the cellular base station (BS) …
A new coding scheme for general N-node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode-forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the Cover-El Gamal partial decode-forward coding scheme for 3-node relay channels. The key idea of the scheme is to precode all the codewords of the entire network at the source by multicoding over multiple blocks. This encoding step allows these codewords to carry partial information of the messages implicitly without complicated rate splitting and routing. This part…
Maddah-Ali and Niesen's original coded caching scheme for shared-link broadcast networks is now known to be optimal to within a factor two, and has been applied to other types of networks. For practical reasons, this paper considers that a server communicates to cache-aided users through $H$ intermediate relays. In particular, it focuses on combination networks where each of the $K = \binom{H}{r}$ users is connected to a distinct $r$-subsets of relays. By leveraging the symmetric topology of the network, this paper proposes a novel method to general multicast messages and to deliver them to th…
In this paper, we consider a two-hop one-way relay network for multigroup multicast transmission between long-distance users, in which the relay is equipped with multiple antennas, while the transmitters and receivers are all with a single antenna. Assuming that perfect channel state information is available, we study amplify-and-forward (AF) schemes that aim at optimizing the max-min-fair (MMF) rate. We begin by considering the classic beamformed AF (BF-AF) scheme, whose corresponding MMF design problem can be formulated as a rank-constrained fractional semidefinite program (SDP). We show tha…
This paper shows how to reduce the otherwise hard joint relay positioning and flow optimization problem into a sequence a two simpler decoupled problems. We consider a class of wireless multicast hypergraphs mainly characterized by their hyperarc rate functions, that are increasing and convex in power, and decreasing in distance between the transmit node and the farthest end node of the hyperarc. The set-up consists of a single multicast flow session involving a source, multiple destinations and a relay that can be positioned freely. The first problem formulates the relay positioning problem i…
Coding schemes for discrete memoryless multicast networks (DM-MN) with rate-limited feedback from the receivers and relays to the transmitter are proposed. The schemes improve over the noisy network coding proposed by Lim et al.. For the single relay channel with relay-transmitter feedback, our coding schemes recover Gabbai and Bross's results, and strictly improve on noisy network coding, distributed decode-forward coding proposed by Lim et al., and all known lower bounds on the achievable rates proposed for the setup without feedback. The coding schemes are based on block-Markov coding, supe…
The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate through degraded sets of message parts, achieves the cutset upper bound within $(1/2)\log N$ bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Ozgur, which is also based on partial decode--forward yet has an unbounded gap from the cutset bound for $L \ge 2$ destinations. When specialized to ind…
The deterministic wireless relay network model, introduced by Avestimehr et al., has been proposed for approximating Gaussian relay networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless medium and interference. Avestimehr et al. showed that the Min-cut Max-flow theorem holds in the ADT network. In this paper, we show that the ADT network model can be described within the algebraic network coding framework introduced by Koetter and Medard. We prove that the ADT network problem can be captured by a single matrix, called the "system matrix". We …
Multicast device-to-device (D2D) transmission is important for applications like local file transfer in commercial networks and is also a required feature in public safety networks. In this paper we propose a tractable baseline multicast D2D model, and use it to analyze important multicast metrics like the coverage probability, mean number of covered receivers and throughput. In addition, we examine how the multicast performance would be affected by certain factors like mobility and network assistance. Take the mean number of covered receivers as an example. We find that simple repetitive tran…
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 threshold-based 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 to a Poisson distribution and an analytical expression for the average feedback load is deriv…
This paper studies the general multi-antenna multiple-relay network. Every two nodes of the network are either connected together through a Rayleigh fading channel or disconnected. We study the ergodic capacity of the network in the high SNR regime. We prove that the traditional amplify-forward relaying achieves the maximum multiplexing gain of the network. Furthermore, we show that the maximum multiplexing gain of the network is equal to the minimum vertex cut-set of the underlying graph of the network, which can be computed in polynomial time in terms of the number of network nodes. Finally,…
This paper studies an unmanned aerial vehicle (UAV)-enabled multicast channel, in which a UAV serves as a mobile transmitter to deliver common information to a set of $K$ ground users. We aim to characterize the capacity of this channel over a finite UAV communication period, subject to its maximum speed constraint and an average transmit power constraint. To achieve the capacity, the UAV should use a sufficiently long code that spans over its whole communication period. Accordingly, the multicast channel capacity is achieved via maximizing the minimum achievable time-averaged rates of the $K$…
In this paper, we consider a full-duplex (FD) amplify-and-forward (AF) relay system and optimize its power allocation and relay location to minimize the system symbol error rate (SER). We first derive the asymptotic expressions of the outage probability and SER performance by taking into account the residual self interference (RSI) in FD systems. We then formulate the optimization problem based on the minimal SER criterion. Analytical and numerical results show that optimized relay location and power allocation can greatly improve system SER performance, and the performance floor caused by the…
Energy-efficient communication is an important requirement for mobile relay networks due to the limited battery power of user terminals. This paper considers energy-efficient relaying schemes through selection of mobile relays in cooperative cellular systems with asymmetric traffic. The total energy consumption per information bit of the battery-powered terminals, i.e., the mobile station (MS) and the relay, is derived in theory. In the Joint Uplink and Downlink Relay Selection (JUDRS) scheme we proposed, the relay which minimizes the total energy consumption is selected. Additionally, the ene…
In this work, we investigate a multi-source multi-cast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal common multicast throughput of all source nodes if resource allocations are available. A transmission protocol employing the relaying strategy, namely, compute-and-forward (CPF), is proposed. {We also adjust the methods in the literature to obtain the integer network-constructed coefficient matrix (a naive method, a local optimal method as well as a global opti…
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A \emph{Joint source-Wyner-Ziv encoding/sliding window decoding} scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered partition a set of feasibility constraints is derived. Then, utilizing the sub-modular property of the entropy function and a novel geometrical approach, the results of different ordered partitions a…
In this paper, a symbol-level selective transmission for full-duplex (FD) relaying networks is proposed to mitigate error propagation effects and improve system spectral efficiency. The idea is to allow the FD relay node to predict the correctly decoded symbols of each frame, based on the generalized square deviation method, and discard the erroneously decoded symbols, resulting in fewer errors being forwarded to the destination node. Using the capability for simultaneous transmission and reception at the FD relay node, our proposed strategy can improve the transmission efficiency without extr…
This paper investigates a network information flow problem for a multiple-input multiple-output (MIMO) Gaussian wireless network with $K$-users and a single intermediate relay having $M$ antennas. In this network, each user intends to convey a multicast message to all other users while receiving $K-1$ independent messages from the other users via an intermediate relay. This network information flow is termed a MIMO Gaussian $K$-way relay channel. For this channel, we show that $\frac{K}{2}$ degrees of freedom is achievable if $M=K-1$. To demonstrate this, we come up with an encoding and decodi…
In this paper we investigate the optimal relay location in the sense of maximizing suitably defined coverage region for MIMO relay channel. We consider the general Rayleigh fading case and assume that the channel state information is only available at the receivers (CSIR), which is an important practical case in applications such as cooperative vehicular communications. In order to overcome the mathematical difficulty regarding determination of the optimal relay location, we provide two analytical solutions, and show that it is possible to determine the optimal relay location (for a desired tr…
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locations become a design parameter that can be optimized. We evaluate the decode and forward (DF) and compress and forward (CF) strategies for the relay channel with respect to the new objective of maximizi…
In this paper we study and analyze coverage region for half-duplex multiple-input multiple-output (MIMO) relay channel with amplify-and-forward (AF) strategy at the relay station. By assuming mixed Rayleigh and Rician fading channels with two different relay station situations, we consider the objective of maximizing coverage region for a given transmission rate and find the optimal relay location in the sense of maximizing coverage region. using Monte Carlo simulations, the coverage region and capacity bounds are shown for different fading cases and different relay station locations. Finally,…
Optimal deployment of unmanned aerial vehicles (UAVs) as communication relays is studied for fixed-rate variable-power systems. The considered setup is a set of ground transmitters (GTs) wishing to communicate with a set of ground receivers (GRs) through the UAVs. Each GT-GR pair communicates through only one selected UAV and have no direct link. Two different UAV selection scenarios are studied: In centralized selection, a decision center assigns an optimal UAV depending on the locations of all terminals. In distributed selection, a GT selects its relaying UAV using only the local knowledge o…
We consider the broadcast relay channel (BRC), where a single source transmits to multiple destinations with the help of a relay, in the limit of a large bandwidth. We address the problem of optimal relay positioning and power allocations at source and relay, to maximize the multicast rate from source to all destinations. To solve such a network planning problem, we develop a three-faceted approach based on an underlying information theoretic model, computational geometric aspects, and network optimization tools. Firstly, assuming superposition coding and frequency division between the source …
In this paper, we analyze the performance of cooperative transmissions in wireless ad hoc networks with random node locations. According to a contention probability for message transmission, each source node can either transmits its own message signal or acts as a potential relay for others. Hence, each destination node can potentially receive two copies of the message signal, one from the direct link and the other from the relay link. Taking the random node locations and interference into account, we derive closed-form expressions for the outage probability with different combining schemes at…
We present the ε-outage capacity of incremental relaying at low signal-to-noise ratios (SNR) in a wireless cooperative network with slow Rayleigh fading channels. The relay performs decode-and-forward and repetition coding is employed in the network, which is optimal in the low SNR regime. We derive an expression on the optimal relay location that maximizes the ε-outage capacity. It is shown that this location is independent of the outage probability and SNR but only depends on the channel conditions represented by a path-loss factor. We compare our results to the ε-outage capacity of the cut-…
We consider a set of cellular users associated with a base station (BS) in a cellular network that employs Device-to-device (D2D) communication. A subset of the users request for some files from the BS. Now, some of the users can potentially act as relays and forward the requested files, or partitions of files, from the BS to some of the requesting users (destination nodes) over D2D links. However, this requires cooperation among the cellular users. In this paper, we seek conditions under which users have an incentive to cooperate with each other. We model the above scenario using the framewor…
In this paper, we consider an imperfect hardware hybrid satellite-terrestrial network (HSTN) where the satellite communication with a ground user equipment (UE) is aided by the multiple amplify-and-forward (AF) three-dimensional ($3$D) mobile unmanned aerial vehicle (UAV) relays. Herein, we consider that all transceiver nodes are corrupted by the radio frequency hardware impairments (RFHI). Further, a stochastic mixed mobility (MM) model is employed to characterize the instantaneous location of $3$D mobile UAV relays in a cylindrical cell with UE lying at its center on ground plane. Taking int…
We study and analyze coverage region in MIMO communication systems for a multiple-relay network with decode-and-forward (DF) strategy at the relays. Assuming that there is a line-of-sight (LOS) propagation environment for source-relay channels and channel state information is available at receivers (CSIR), we consider the objective of maximizing coverage region for a given transmission rate and show numerically the significant effect of propagation environment on capacity bounds, optimal relay location and coverage region. Also, we study the situation in which two adjacent relays cooperate in …
Channels of satellite communication are usually modeled as Rician fading channels with very large Rician factor or Gaussian channels. Therefore, when a legitimate user is close to an eavesdropping user, the legitimate channel is approximately the same as the eavesdropping channel. The physical layer security technology of traditional terrestrial wireless communication mainly takes advantage of the difference be-tween the legitimate channel and the eaves-dropping channel; thus, it is not suitable for satellite communication. To implement secure communication in similar channels for satellite co…
This paper proposes a novel cooperative secure unmanned aerial vehicle (UAV) aided transmission protocol, where a source (Alice) sends confidential information to a destination (Bob) via an energy-constrained UAV-mounted amplify-and-forward (AF) relay in the presence of a ground eavesdropper (Eve). We adopt destination-assisted cooperative jamming (CJ) as well as simultaneous wireless information and power transfer (SWIPT) at the UAV-mounted relay to enhance physical-layer security (PLS) and transmission reliability. Assuming a low altitude UAV, we derive connection probability (CP), secrecy o…
This paper considers the use of an intelligent reconfigurable surface (IRS) to aid wireless communication systems. The main goal is to compare this emerging technology with conventional decode-and-forward (DF) relaying. Unlike prior comparisons, we assume that electromagnetic interference (EMI), consisting of incoming waves from external sources, is present at the location where the IRS or DF relay are placed. The analysis, in terms of minimizing the total transmit power, shows that EMI has a strong impact on DF relay-assisted communications, even when the relaying protocol is optimized agains…
Automatic Repeat Request (ARQ) is an effective technique for reliable transmission of packets in wireless networks. In ARQ, however, only a few erroneous bits in a packet will cause the entire packet to be discarded at the receiver. In this case, it's wasteful to retransmit the correct bit in the received packet. The partial packet recovery only retransmits the unreliable decoded bits in order to increase the throughput of network. In addition, the cooperative transmission based on Interleave-division multiple-access (IDMA) can obtain diversity gains with multiple relays with different locatio…
We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may connect to multiple relays in the first hop. In the presence of interference and without tight coordination of the relays, it is not clear which relays should transmit the packet. We propose four decentralized methods of relay selection, some based on location information and others based on the received signal strength (RSS). We provide a complete analytical c…
An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as storage resources in the form of caches to reduce file delivery latency. To investigate this aspect, we study the fundamental limits of a cache-aided broadcast-relay wireless network consisting of one central base station, $M$ cache-equipped transceivers and $K$ receivers from a latency-centric perspective. We use the normalized delivery time (NDT) to capture the per-bit latency for the worst-case file request pattern, normalized with respect to a reference interference-f…
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Optimal relay subset selection with the objective of maximizing the overall throughput is a difficult problem that depends on multiple factors including node locations, queue lengths and power consumption. A partial decode-and-forward strategy is applied in this paper to improve the tractability of the relay selection problem and performance of the overall network. Note that the number of relays selected ultimately deter…
User-to-network relaying enabled via Device-to-Device communications (D2D) is a promising technique for improving the performance of cellular networks. Since in practice relays are in mobility, a dynamic relay selection scheme is unavoidable. In this paper, we propose a dynamic relay selection policy that maximizes the performance of cellular networks (e.g. throughput, reliability, coverage) under cost constraints (e.g. transmission power, power budget). We represent the relays' dynamics as a Markov Decision Process (MDP) and assume that only the locations of the selected relays are observable…
In this paper, we analyze the outage performance of different multicarrier relay selection schemes for two-hop orthogonal frequency-division multiplexing (OFDM) systems in a Poisson field of relays. In particular, special emphasis is placed on decode-and-forward (DF) relay systems, equipped with bulk and per-subcarrier selection schemes, respectively. The exact expressions for outage probability are derived in integrals for general cases. In addition, asymptotic expressions for outage probability in the high signal-to-noise ratio (SNR) region in the finite circle relay distribution region are …
This work proposes a novel location-based multi-group multicast framework which is termed as non-orthogonal multiple access (NOMA) assisted multi-region geocast. This novel spectrum sharing framework exploits the NOMA technology to realize the simultaneous delivery of different messages to different user groups characterized by different geographical locations. The essence of the proposed framework is that the geographical information of user groups unites NOMA and multi-group multicast to enhance the spectral efficiency (SE) and the energy efficiency (EE) of wireless transmissions. Specifical…
In view of noteworthy communications performance improvements for future B5G/6G (such as cognitive Internet of Things, space-ground integration network and so on), cooperative communications (CC) diversity with relays selection algorithms have been extensively studied to significantly improve communications quality, but so far there is still a lot of potential optimization work with CC schemes. In this paper, in the light of NP-hard problem of subsets relays selection, further studies for theorems of relays subsets with K-layers power allocation standard have been put forward to explore better…
Immersive viewing is emerging as the next interface evolution for human-computer interaction. A truly wireless immersive application necessitates immense data delivery with ultra-low latency, raising stringent requirements for next-generation wireless networks. A potential solution for addressing these requirements is through the efficient usage of in-device storage and computation capabilities. This paper proposes a novel location-based coded cache placement and delivery scheme, which leverages the nested code modulation (NCM) to enable multi-rate multicasting transmission. To provide a unifo…
This paper considers a multi-way massive multiple-input multiple-output relaying system, where single-antenna users exchange their information-bearing signals with the help of one relay station equipped with unconventionally many antennas. The relay first estimates the channels to all users through the pilot signals transmitted from them. Then, the relay uses maximum-ratio processing (i.e. maximum-ratio combining in the multiple-access phase and maximum-ratio transmission in the broadcast phase) to process the signals. A rigorous closed-form expression for the spectral efficiency is derived. T…
Recently, energy harvesting (EH) has emerged as a promising way to realize green communications. In this paper, we investigate the multiuser transmission network with an EH cooperative relay, where a source transmits independent information to multiple destinations with the help of an energy constrained relay. The relay can harvest energy from the radio frequency (RF) signals transmitted from the source, and it helps the multiuser transmission only by consuming the harvested energy. By adopting the time switching and the power-splitting relay receiver architectures, we firstly propose two prot…
Energy-efficient communication is an important requirement for mobile devices, as the battery technology has not kept up with the growing requirements stemming from ubiquitous multimedia applications. This paper considers energy-efficient transmission schemes in cooperative cellular systems with unbalanced traffic between uplink and downlink. Theoretically, we derive the optimal transmission data rate, which minimizes the total energy consumption of battery-powered terminals per information bit. The energy-efficient cooperation regions are then investigated to illustrate the effects of relay l…
Data gathering operations in remote locations often rely on relay drones, which collect, store and deliver transmitted information to a ground control station. The probability of the ground control station successfully reconstructing the gathered data can be increased if random linear coding (RLC) is used, especially when feedback channels between the drones and the transmitter are not available. RLC decoding can be complemented by partial packet recovery (PPR), which utilizes sparse recovery principles to repair erroneously received data before RLC decoding takes place. We explain that the sp…
This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop secure transmission protocols in physical layer secrecy framework cannot provide a flexible load-balance control, which may significantly limit their application scopes. This paper proposes a secure transmission protocol in case that the path-loss is identical between all pairs of nodes, in which the relay is randomly selected from the first $k$ preferable as…
This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite networks and their asymptotic behavior and scaling law results, this papers focuses on a more practical network with finite number of system nodes and explores the corresponding exact results on the number of eavesdroppers the network can tolerant to ensure a desired secrecy and reliability. For achieving secure and reliable information transmission in a finite…
