In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a random access procedure. A winner source node may give up its transmission opportunity if its link quality is poor. In this research, we apply the optimal stopping theory to analyze when a winner node should give up its transmission opportunity. By assuming the winner node has information of channel gains of links from itself to relays and from relays to its destination, the existence and uniqueness of an optimal stopping rule are rigorously proved. It is also found that the optimal stopping rule is a pure-threshold strategy. The case when the winner node does not have information of channel gains of links from relays to its destination is also studied. Two stopping problems exist, one in the main layer (for channel access of source nodes), and the other in the sub-layer (for channel access of relay nodes). An intuitive stopping rule, where the sub-layer and the main layer maximize their throughput respectively, is shown to be a semi-pure-threshold strategy. The intuitive stopping rule turns out to be non-optimal. An optimal stopping rule is then derived theoretically. Our research reveals that multi-user (including multi-source and multi-relay) diversity and time diversity can be fully utilized in a relay network by our proposed strategies.
An opportunistic DF-AF selection relaying scheme with maximal received signal-to-noise ratio (SNR) at the destination is investigated in this paper. The outage probability of the opportunistic DF-AF selection relaying scheme over Nakagami-m fading channels is analyzed, and a closed-form solution is obtained. We perform asymptotic analysis of the outage probability in high SNR domain. The coding gain and the diversity order are obtained. For the purpose of comparison, the asymptotic analysis of opportunistic AF scheme in Nakagami-m fading channels is also performed by using the Squeeze Theorem.…
Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks, proposes new opportunistic methods for several network geometries, and analyzes them in the high-SNR regime. For each of the geometries studied in the paper, we analyze the opportunistic DMT of several relay protocols, including amplify-and-forward, decode-and-forward, compress-and-forward, non-orthogonal amplify-forward, and dynamic decode-forward. Among t…
We analyze the opportunistic relaying based on HARQ transmission over the block-fading channel with absence of channel state information (CSI) at the transmitter nodes. We assume that both the source and the relay are allowed to vary their transmission rate between the HARQ transmission rounds. We solve the problem of throughput maximization with respect to the transmission rates using double-recursive Dynamic Programming. Simplifications are also proposed to diminish the complexity of the optimization. The numerical results confirm that the variable-rate HARQ can increase the throughput signi…
A network consisting of $n$ source-destination pairs and $m$ relays is considered. Focusing on the large system limit (large $n$), the throughput scaling laws of two-hop relaying protocols are studied for Rayleigh fading channels. It is shown that, under the practical constraints of single-user encoding-decoding scheme, and partial channel state information (CSI) at the transmitters (via integer-value feedback from the receivers), the maximal throughput scales as $\log n$ even if full relay cooperation is allowed. Furthermore, a novel decentralized opportunistic relaying scheme with receiver C…
In this paper, outage performance of network topology-aware distributed opportunistic relay selection strategies is studied with focus on the impact of different levels of channel state information (CSI) available at relays. Specifically, two scenarios with (a) exact instantaneous and (b) only statistical CSI are compared with explicit account for both small-scale Rayleigh fading and path loss due to random inter-node distances. Analytical results, matching closely to simulations, suggest that although similar diversity order can be achieved in both cases, the lack of precise CSI to support re…
It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission approach where relays forward parity information to the destination in the event of a decoding error. Such an approach, however, suffers a loss compared to centralized strategies that select relays with the best channel gain to the destination. This paper closes the performance gap by adding another level of channel feedback to the decentralized relay selection pr…
This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destination. For a given network, the effects of varying key parameters such as the feedback probability are presented and discussed. A primary advantage of the proposed technique is that relay selection can be performed in a distributed way. Simulation results find its performance to closely match that of centralized schemes that utilize GPS information, unlike the prop…
In this paper, we investigate opportunistic relaying and jamming techniques and develop relay selection algorithms that maximize the secrecy rate for multiuser buffer-aided relay networks. We develop an approach to maximize the secrecy rate of relay systems that does not require the channel state information (CSI) of the eavesdroppers. We also devise relaying and jamming function selection (RJFS) algorithms to select multiple relay nodes as well as multiple jamming nodes to assist the transmission. In the proposed RJFS algorithms inter-relay interference cancellation (IC) is taken into account…
This paper studies the impact of using outdated channel state information for relay selection on the performance of a network where two sources communicate with each other via fixed-gain amplifyand- forward relays. For a Rayleigh faded channel, closed-form expressions for the outage probability, moment generating function and symbol error rate are derived. Simulations results are also presented to corroborate the derived analytical results. It is shown that adding relays does not improve the performance if the channel is substantially outdated. Furthermore, relay location is also taken into co…
This paper investigates a wireless-powered cooperative communication network consisting of a source, a destination and a multi-antenna decode-and-forward relay. We consider the relay as a wireless-powered node that has no external power supply; but it is equipped with an energy harvesting (EH) unit and a rechargeable battery such that it can harvest and accumulate energy from radio-frequency signals broadcast by the source. By fully incorporating the EH feature of the relay, we develop an opportunistic relaying protocol, termed accumulate-then-forward (ATF), for the considered WPCCN. We then a…
In this paper, we propose an opportunistic network coding (ONC) scheme in cellular relay networks, which operates depending on whether the relay decodes source messages successfully or not. A fully distributed method is presented to implement the proposed opportunistic network coding scheme without the need of any feedback between two network nodes. We consider the use of proposed ONC for cellular downlink transmissions and derive its closed-form outage probability expression considering cochannel interference in a Rayleigh fading environment. Numerical results show that the proposed ONC schem…
The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the presence of a relay. A half-duplex relay is considered that transmits on a channel orthogonal to that used by the sources. The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at both the transmitter and receiver. Under an average power constraint at each source and the relay, the sum-rate for the achievable strategy of decode-and-forward (DF) is maximized over all po…
In this paper, we investigate opportunistic relay and jammer cooperation schemes in multiple-input multiple-output (MIMO) buffer-aided relay networks. The network consists of one source, an arbitrary number of relay nodes, legitimate users and eavesdroppers, with the constraints of physical layer security. We propose an algorithm to select a set of relay nodes to enhance the legitimate users' transmission and another set of relay nodes to perform jamming of the eavesdroppers. With Inter-Relay interference (IRI) taken into account, interference cancellation can be implemented to assist the tran…
Motivated by the fact that full diversity order is achieved using the "best-relay" selection technique, we consider opportunistic amplify-and-forward and decode-and-forward relaying systems. We focus on the outage probability of such a systems and then derive closed-form expressions for the outage probability of these systems over independent but non-identical imperfect Log-normal fading channels. We consider the error of channel estimation as a Gaussian random variable. As a result the estimated channels distribution are not Log-normal either as would be in the case of the Rayleigh fading cha…
Incorporating relaying techniques into Automatic Repeat reQuest (ARQ) mechanisms gives a general impression of diversity and throughput enhancements. Allowing overhearing among multiple relays is also a known approach to increase the number of participating relays in ARQs. However, when opportunistic amplify-and-forward (AF) relaying is applied to cooperative ARQs, the system design becomes nontrivial and even involved. Based on outage analysis, the spatial and temporal diversities are first found sensitive to the received signal qualities of relays, and a link quality control mechanism is the…
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…
In this paper, we propose an opportunistic buffered decode-wait-and-forward (OBDWF) protocol to exploit both relay buffering and relay mobility to enhance the system throughput and the end-to-end packet delay under bursty arrivals. We consider a point-to-point communication link assisted by K mobile relays. We illustrate that the OBDWF protocol could achieve a better throughput and delay performance compared with existing baseline systems such as the conventional dynamic decode-and-forward (DDF) and amplified-and-forward (AF) protocol. In addition to simulation performance, we also derived clo…
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…
The average achievable rate of an Opportunistic Non-Orthogonal Multiple Access (O-NOMA) based Cooperative Relaying System (CRS) with Channel State Information (CSI) known at the transmitter end is analyzed under Rician fading channels. For opportunistic transmission of data signals, CSI is used for the source-to-relay and source-to-destination links, which helps the transmitter to select the best out of the cooperative NOMA transmission and the direct transmission of signals, instantaneously. The average achievable rate of the O-NOMA and conventional NOMA (C-NOMA) based CRSs is considered for …
This paper presents a decentralized relay selection protocol for a dense wireless network and describes channel feedback strategies that improve its performance. The proposed selection protocol supports hybrid automatic-repeat-request transmission where relays forward parity information to the destination in the event of a decoding error. Channel feedback is employed for refining the relay selection process and for selecting an appropriate transmission mode in a proposed adaptive modulation transmission framework. An approximation of the throughput of the proposed adaptive modulation strategy …
The problem of optimal resource allocation is studied for ergodic fading orthogonal multiaccess relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits on a channel orthogonal to that used by the transmitting sources. Under the assumption that the instantaneous fading state information is available at all nodes, the maximum sum-rate and the optimal user and relay power allocations (policies) are developed for a decode-and-forward (DF) relay. With the observation that a DF relay results in two multiaccess channels, on…
This paper studies the application of compute-and-forward to multiple access relay channels (MARC). Despite its promising advantage of improving network throughput, it is not straightforward to apply compute-and-forward to the MARC. This paper proposes two efficient cooperation strategies for the MARC with compute-and-forward. Both proposed strategies are opportunistic in the sense that the cooperation between the relay and the destination are performed only when it is needed for the sake of high transmission efficiency. In the first strategy, the relay helps the destination by sending its loc…
We consider a wireless relay network with multiple antenna terminals over Rayleigh fading channels, and apply distributed space-time coding (DSTC) in amplify-and-forward (A&F) mode. The A&F scheme is used in a way that each relay transmits a scaled version of the linear combination of the received symbols. It turns out that, combined with power allocation in the relays, A&F DSTC results in an opportunistic relaying scheme, in which only the best relay is selected to retransmit the source's space-time coded signal. Furthermore, assuming the knowledge of source-relay CSI at the source node, we d…
We consider the opportunistic multiuser diversity in the multiuser two-way amplify-and-forward (AF) relay channel. The relay, equipped with multiple antennas and a simple zero-forcing beam-forming scheme, selects a set of two way relaying user pairs to enhance the degree of freedom (DoF) and consequently the sum throughput of the system. The proposed channel aligned pair scheduling (CAPS) algorithm reduces the inter-pair interference and keeps the signal to interference plus noise power ratio (SINR) of user pairs relatively interference free in average sense when the number of user pairs becom…
Wireless energy harvesting constitutes an effective way to prolong the lifetime of wireless networks. In this paper, an opportunistic decode-and-forward cooperative communication system is investigated, where the energy-constrained relays harvest energy from the received information signal and the co-channel interference (CCI) signals and then use that harvested energy to forward the correctly decoded signal to the destination. Different from conventional relaying system with constant energy supplier, the transmission power of the energy-constrained relay depends on the available energy that h…
The goal of this paper is to understand the key merits of multihop relaying techniques jointly in terms of their energy efficiency and spectral efficiency advantages in the presence of multiuser diversity gains from opportunistic (i.e., channel-aware) scheduling and identify the regimes and conditions in which relay-assisted multiuser communication provides a clear advantage over direct multiuser communication. For this purpose, we use Shannon-theoretic tools to analyze the tradeoff between energy efficiency and spectral efficiency (known as the power-bandwidth tradeoff) over a fading multiuse…
We study a cooperative network with a buffer-aided multi-antenna source, multiple half-duplex (HD) buffer-aided relays and a single destination. Such a setup could represent a cellular downlink scenario, in which the source can be a more powerful wireless device with a buffer and multiple antennas, while a set of intermediate less powerful devices are used as relays to reach the destination. The main target is to recover the multiplexing loss of the network by having the source and a relay to simultaneously transmit their information to another relay and the destination, respectively. Successi…
In this paper we consider a simple cooperative network consisting of a source, a destination and a cluster of decode-and-forward half-duplex relays. At each time-slot, the source and (possibly) one of the relays transmit a packet to another relay and the destination, respectively, resulting in inter-relay interference (IRI). In this work, with the aid of buffers at the relays, we mitigate the detrimental effect of IRI through interference cancellation. More specifically, we propose the min-power scheme that minimizes the total energy expenditure per time slot under an IRI cancellation scheme. …
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…
We introduce a new achievability scheme, termed opportunistic network decoupling (OND), operating in virtual full-duplex mode. In the scheme, a novel relay scheduling strategy is utilized in the $K\times N\times K$ channel with interfering relays, consisting of $K$ source--destination pairs and $N$ half-duplex relays in-between them. A subset of relays using alternate relaying is opportunistically selected in terms of producing the minimum total interference level, thereby resulting in network decoupling. As our main result, it is shown that under a certain relay scaling condition, the OND pro…
Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying protocols have been reported in the literature. However, most of the proposed solutions require either centrally coordinated scheduling or detailed channel state information (CSI) at the transmitter side. Here, an opportunistic relaying scheme is proposed, which alleviates these limitations. The scheme entails a two-hop communication protocol, in which sources…
In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the optimal opportunistic network coding policy that maximizes the aggregate network throughput subject to an average packet delay constraint. Towards this objective, first, we consider a pair of nodes communicating through a common relay and develop a two dimensional Markov chain model capturing the buffers' length states at the two nodes. Second, we formulate …
This paper considers a cooperative status update system with a source aiming to send randomly generated status updates to a designated destination as timely as possible with the help of a relay. We adopt a recently proposed concept, Age of Information (AoI), to characterize the timeliness of the status updates. We propose an age-oriented opportunistic relaying (AoR) protocol to reduce the AoI of the considered system. Specifically, the relay opportunistically replaces the source to retransmit the successfully received status updates that have not been correctly delivered to the destination, bu…
Energy consumption is a major limitation of low power and mobile devices. Efficient transmission protocols are required to minimize an energy consumption of the mobile devices for ubiquitous connectivity in the next generation wireless networks. Opportunistic schemes select a single relay using the criteria of the best channel and achieve a near-optimal diversity performance in a cooperative wireless system. In this paper, we study the energy efficiency of the opportunistic schemes for device-to-device communication. In the opportunistic approach, an energy consumed by devices is minimized by …
Energy efficiency has become an encouragement, and more than this, a requisite for the design of next-generation wireless communications standards. In current work, a dual-hop cognitive (secondary) relaying system is considered, incorporating multiple amplify-and-forward relays, a rather cost-effective solution. First, the secondary relays sense the wireless channel, scanning for a primary network activity, and then convey their reports to a secondary base station (SBS). Afterwards, the SBS, based on these reports and its own estimation, decides cooperatively the presence of primary transmissi…
This letter studies distributed opportunistic channel access in a wireless network with decode-and-forward relays. All the sources use channel contention to get transmission opportunity. If a source wins the contention, the channel state information in the first-hop channel (from the source to its relay) is estimated, and a decision is made for the winner source to either give up the transmission opportunity and let all sources start a new contention, or transmit to the relay. Once the relay gets the traffic, it may have a sequence of probings of the second-hop channel (from the relay to the d…
In this paper we present a multi-user cooperative protocol for wireless networks. Two sources transmit simultaneously their information blocks and relays employ opportunistically successive interference cancellation (SIC) in an effort to decode them. An adaptive decode/amplify-and-forward scheme is applied at the relays to the decoded blocks or their sufficient statistic if decoding fails. The main feature of the protocol is that SIC is exploited in a network since more opportunities arise for each block to be decoded as the number of used relays NRU is increased. This feature leads to benefit…
We study multi-stream transmission in the $K \times N \times K$ channel with interfering relay nodes, consisting of $K$ multi-antenna source--destination (S--D) pairs and $N$ single-antenna half-duplex relay nodes between the S--D pairs. We propose a new achievable scheme operating with partial effective channel gain, termed multi-stream opportunistic network decoupling (MS-OND), which achieves the optimal degrees of freedom (DoF) under a certain relay scaling law. Our protocol is built upon the conventional OND that leads to virtual full-duplex mode with one data stream transmission per S--D …
In this paper, an energy-efficient cross-layer design framework is proposed for cooperative relaying networks, which takes into account the influence of spectrum utilization probability. Specifically, random arrival traffic is considered and an adaptive modulation and coding (AMC) scheme is adopted in the cooperative transmission system to improve the system performance. The average packet dropping rate of the relay-buffer is studied at first. With the packet dropping rate and stationary distribution of the system state, the closed-form expression of the delay is derived. Then the energy effic…
In this paper, we investigate an opportunistic relay and jammer scheme along with relay selection algorithms based on the secrecy rate criterion in multiple-input multiple-output buffer-aided down link relay networks, which consist of one source, a number of relay nodes, legitimate users and eavesdroppers, with the constraints of physical layer security. The opportunistic relay and jammer scheme is employed to improve the transmission rate and different relay selection policies are performed to achieve better secrecy rate with the consideration of eavesdroppers. Among all the investigated rela…
Non-orthogonal Multiple Access (NOMA) has become a salient technology for improving the spectral efficiency of the next generation 5G wireless communication networks. In this paper, the achievable average rate of an Opportunistic Non-Orthogonal Multiple Access (O-NOMA) based Cooperative Relaying System (CRS) is studied under Rician fading channels with Channel State Information (CSI) available at the source terminal. Based on CSI, for opportunistic transmission, the source immediately chooses either the direct transmission or the cooperative NOMA transmission using the relay, which can provide…
In this paper, we consider a multi-hop cooperative network founded on two energy-harvesting (EH) decode-and-forward (DF) relays which are provided with harvest-store-use (HSU) architecture to harvest energy from the ambience using the energy buffers. For the sake of boosting the data delivery in this network, maximal ratio combining (MRC) at destination to combine the signals received from source and relays, as well as an opportunistic routing (OR) algorithm which considers channel status information, location and energy buffer status of relays is proposed. With applying discrete-time continuo…
We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source- destination pairs increases up to the operating maximum. Our opportunistic routing is novel in a sense that it is massively parallel, i.e., it is performed by many nodes simultaneously to maximize the opportunistic gain while controlling the inter-user interference. The scaling behavior of conventional multi-hop transmission that does not employ opportunistic routing is also examined for comparison. Our results indicate that our op…
This paper investigates the outage probability and the throughput of relay networks with wireless information and energy transfer where the relays harvest energy from the transmitted radio-frequency signal of the source. Considering different power consumption models, we derive the outage probability for both adaptive and non-adaptive power allocations at the relay. With a total energy consumption constraint at the source, we provide closed-form expressions for the optimal time sharing and power allocation between the source energy and information transfer signals as well as the optimal relay …
A novel subcarrier-pair based opportunistic DF protocol is proposed for cooperative downlink OFDMA transmission aided by a decode-and-forward (DF) relay. Specifically, user message bits are transmitted in two consecutive equal-duration time slots. A subcarrier in the first slot can be paired with a subcarrier in the second slot for the DF relay-aided transmission to a user. In particular, the source and the relay can transmit simultaneously to implement beamforming at the subcarrier in the second slot for the relay-aided transmission. Each unpaired subcarrier in either the first or second slot…
We study the outage probability of opportunistic relay selection in decode-and-forward relaying with secrecy constraints. We derive the closed-form expression for the outage probability. Based on the analytical result, the asymptotic performance is then investigated. The accuracy of our performance analysis is verified by the simulation results.
In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov optimization model and define decision variables to derive a network coding based packet scheduling algorithm, which has significantly less complexity and shorter queue size compared with the existing solutions. Further, the proposed algorithm is modified to meet the requirements of time-critical data. Finally, the simulation results verify the effectiveness …
Physical-layer security is emerging as a promising paradigm of securing wireless communications against eavesdropping between legitimate users, when the main link spanning from source to destination has better propagation conditions than the wiretap link from source to eavesdropper. In this paper, we identify and analyze the tradeoffs between the security and reliability of wireless communications in the presence of eavesdropping attacks. Typically, the reliability of the main link can be improved by increasing the source's transmit power (or decreasing its date rate) to reduce the outage prob…
In order to understand the key merits of multiuser diversity techniques in relay-assisted cellular multihop networks, this paper analyzes the spectral efficiency of opportunistic (i.e., channel-aware) scheduling algorithms over a fading multiuser relay channel with $K$ users in the asymptotic regime of large (but finite) number of users. Using tools from extreme-value theory, we characterize the limiting distribution of spectral efficiency focusing on Type I convergence and utilize it in investigating the large system behavior of the multiuser relay channel as a function of the number of users…
An opportunistic relay selection based on instantaneous knowledge of channels is considered to increase security against eavesdroppers. The closed-form expressions are derived for the average secrecy rates and the outage probability when the cooperative networks use Decode-and-Forward (DF) or Amplify-and-Forward (AF) strategy. These techniques are demonstrated analytically and with simulation results.
In this paper, the secrecy performance of a cooperative relay network with outdated relay selection is investigated where an eavesdropper intercepts the channels between the source and the destination. The best relay is chosen among N relays based on the opportunistic relay selection algorithm, which may not be the best relay at the time of transmission because of the outdated channel state information. We derive closed-form analytical expressions for the non-zero secrecy capacity, the secrecy outage probability, and the ergodic secrecy capacity. Finally, our theoretical analysis is validated …
We consider a two-hop cellular system in which the mobile nodes help the base station by relaying information to the dead spots. While two-hop cellular schemes have been analyzed previously, the distribution of the node locations has not been explicitly taken into account. In this paper, we model the node locations of the base stations and the mobile stations as a point process on the plane and then analyze the performance of two different two-hop schemes in the downlink. In one scheme the node nearest to the destination that has decoded information from the base station in the first hop is us…
We consider a half-duplex wireless relay network with hybrid-automatic retransmission request (HARQ) and Rayleigh fading channels. In this paper, we analyze the outage probability of the multi-relay delay-limited HARQ system with opportunistic relaying scheme in decode-and-forward mode, in which the \emph{best} relay is selected to transmit the source's regenerated signal. A simple and distributed relay selection strategy is proposed for multi-relay HARQ channels. Then, we utilize the non-orthogonal cooperative transmission between the source and selected relay for retransmitting of the source…
Processing of multiple communication flows in wireless systems has given rise to a number of novel transmission techniques, notably the two-way relaying based on wireless network coding. Recently, a related set of techniques has emerged, termed coordinated direct and relay (CDR) transmissions, where the constellation of traffic flows is more general than the two-way. Regardless of the actual traffic flows, in a CDR scheme the relay has a central role in managing the interference and boosting the overall system performance. In this paper we investigate the novel transmission modes, based on amp…
A key feature in the design of any MAC protocol is the throughput it can provide. In wireless networks, the channel of a user is not fixed but varies randomly. Thus, in order to maximize the throughput of the MAC protocol at any given time, only users with large channel gains should be allowed to transmit. In this paper, compressive sensing based opportunistic protocol for throughput improvement in wireless networks is proposed. The protocol is based on the traditional protocol of R-ALOHA which allows users to compete for channel access before reserving the channel to the best user. We use com…
This article investigates the physical-layer security of cognitive radio (CR) networks, which are vulnerable to various newly arising attacks targeting on the weaknesses of CR communications and networking. We first review a range of physical-layer attacks in CR networks, including the primary user emulation, sensing falsification, intelligence compromise, jamming and eavesdropping attacks. Then we focus on the physical-layer security of CR networks against eavesdropping and examine the secrecy performance of cognitive communications in terms of secrecy outage probability. We further consider …
This letter deals with the opportunistic beamforming (OBF) scheme for multi-antenna downlink with spatial randomness. In contrast to conventional OBF, the terminals return only 1-bit feedback, which is powered by wireless power transfer through a rectenna array. We study two fundamental topologies for the combination of the rectenna elements; the direct-current combiner and the radio-frequency combiner. The beam outage probability is derived in closed form for both combination schemes, by using high order statistics and stochastic geometry.
This paper proposes a novel channel estimation method, and a cluster-based opportunistic scheduling policy, that enhances the efficiency of wireless energy transfer in a system consisting of multiple energy receivers (ERs). Firstly, in the training stage, the energy transmitter (ET) obtains a set of RSSI feedback values from all ERs, and these values are used to estimate the channels between the ET and all ERs. Next, based on the channel estimates, the ERs are grouped into clusters, and the cluster that has its members closest to its centroid in phase is picked. This cluster will be given prio…
Network coding has the potential to improve the overall throughput of a network by combining different streams of data and forwarding them. In wireless networks, the wireless channel provide an excellent medium for physical layer network coding as signals from different transmitters are combined automatically by the wireless channel. In such scenarios, it would be interesting to investigate protocols and algorithms which can optimally relay information. In this paper, we look at a four-node two-way or bidirectional relay network, and propose a relay protocol which can relay information efficie…
In this work, we consider the use of buffer-aided relays, linear precoding techniques and multiple antennas for physical-layer security in wireless networks. We develop relay selection algorithms to improve the secrecy-rate performance of cooperative multi-user multiple-antenna wireless networks. In particular, we propose a novel finite buffer-aided relay selection algorithm that employs the maximum likelihood (ML) criterion to select sets of relays which fully exploit the flexibility offered by relay nodes equipped with buffers. Numerical results show the benefits of the proposed techniques a…
