No abstract

In this paper, we propose a novel secure bufferaided decode-and-forward relay selection that amalgamates the benefits of the buffer-state-based relay selection, the max-ratio criterion, the simultaneous activation of multiple source-to-relay links, and the cooperative beamforming in dual-hop networks. More specifically, the proposed scheme is designed for selecting a single or multiple relay nodes for packet reception or transmission based on the buffer states of relay nodes, while avoiding the detrimental effects of both an empty buffer state and a buffer overflow. Analytical bounds on the secrecy outage probability and the average delay are derived for our proposed scheme, based on a Markov chain process, in order to verify the system model of our proposed scheme. Furthermore, we introduce the concept of cooperative jamming into the proposed scheme, in order to interfere with an eavesdropper's reception, while dispensing with the full channel state information associated with an eavesdropper at a central coordinator. Our simulation results demonstrate that the proposed schemes outperform the existing buffer-based secure relay selection schemes, in terms of both the secrecy outage probability and the average delay, as the explicit benefits of our novel introduced concepts.

In this paper, we propose a novel buffer-state-based relaying selection scheme in the context of cooperative cognitive radio networks (CRNs), supporting the primary and secondary networks. In the proposed scheme, both the effects of inter-network interference and fading are successfully suppressed by introducing a flexible link selection algorithm in the secondary network. More specifically, by relying on the broadcast nature of wireless communication channels between a source node and relay nodes in the secondary network, the associated source packet is shared among multiple relay nodes. This allows us to benefit from the additional degree of freedom. Furthermore, we consider the priority for link selection based on the buffer state of each relay node in the secondary network. This contributes to the avoidance of detrimental empty and full buffer states. Moreover, analytical bounds of the outage probability and the average packet delay are derived for the proposed scheme based on the Markov chain model, in order to verify the numerical results. The overhead required for a central coordinator of the secondary network to monitor channel state information and buffer states are also investigated. Our numerical results demonstrate that the proposed scheme achieves better outage and packet-delay performance than the conventional maxratio-based scheme in the buffer-aided CRN. INDEX TERMS Broadcast, buffer-aided relay, cooperative communication, cognitive radio network, Markov chain, outage probability, packet delay.

No abstract

In this paper, we propose a novel buffer-aided relay selection scheme that is capable of amalgamating the concepts of non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA) in the context of two-hop cooperative networks supporting multiple relays. This is enabled by allowing relay nodes to share a common information packet in their buffers with the aid of a source-to-relay broadcasting mode. Hence, the proposed relay selection scheme switches between diverse modes of uplink NOMA, downlink NOMA, unicast, source broadcasting, and cooperative beamforming. The theoretical bounds of the outage probability, throughput, average delay, and diversity order are derived for the proposed scheme, based on a Markov chain model. Through our analytical and numerical results, it is demonstrated that the proposed scheme is capable of switching to one of the best modes in an adaptive manner while outperforming the conventional buffer-aided cooperative schemes.