• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.133-138
• /
• 2011

This paper presents an information theoretic outage analysis for physical layer of a cooperative multihop wireless network. Our analysis shows that cooperation by selecting a proper relay at each hop increases the coverage or data rate of the network. In our analysis we consider both symmetric and asymmetric network model. We also investigate the availability of cooperative relay at each hop and show that end-to-end performance of the network depends on the relay selection procedure at each hop. We also verify our analytical results with simulations.

• Journal of electromagnetic engineering and science
• /
• v.11 no.4
• /
• pp.262-268
• /
• 2011

In this paper, we evaluate the outage performance of cooperative transmission in two-dimensional random networks. Firstly, we derive the joint distributions of the source-relay and the relay-destination links. Secondly, the outage probability for the decode-and-forward relaying system is derived when selection combining (SC) is employed at the destination. Finally, we calculate the average outage probability of the system and then attempt to express it by a simple approximate expression. The simulation results are presented to verify the accuracy of the derivations. Similar to deterministic networks, the cooperative transmission in random networks outperforms direct transmission at a high signal-to-noise ratio (SNR).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.107-112
• /
• 2009

Spectral efficiency of current two-phase cooperative communications protocols is low since in the second time the relay forwards the same signal received from the source to the destination, the source keeps silent in this time. In this paper, we propose a novel cooperative communications protocol where the signal needed to transmit to the destination is sent in both phases, the source and the relay also transmit different signal to the destination thus no loss of spectral efficiency. This protocol performs signal selection based on log-likelihood ratio (LLR) at relay and maximum likelihood (ML) detection at destination. While existing protocols pay for a worse performance than direct transmission in the low SNR regime which is of special interest in ad hoc networks, ours is better over the whole range of SNR. In addition, the proposal takes advantages of bandwidth efficiency, long delay and interference among many terminals in ad hoc network. Simulation results show that the proposed protocol can significantly save total energy for wireless ad hoc networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4357-4378
• /
• 2017

In cooperative multi-relay networks, the relay nodes which are selected are very important to the system performance. How to choose the best cooperative relay nodes is an optimization problem. In this paper, multi-relay selection schemes which consider either single objective or multi-objective are proposed based on evolutionary algorithms. Firstly, the single objective optimization problems of multi-relay selection considering signal to noise ratio (SNR) or power efficiency maximization are solved based on the quantum bee colony optimization (QBCO). Then the multi-objective optimization problems of multi-relay selection considering SNR maximization and power consumption minimization (two contradictive objectives) or SNR maximization and power efficiency maximization (also two contradictive objectives) are solved based on non-dominated sorting quantum bee colony optimization (NSQBCO), which can obtain the Pareto front solutions considering two contradictive objectives simultaneously. Simulation results show that QBCO based multi-relay selection schemes have the ability to search global optimal solution compared with other multi-relay selection schemes in literature, while NSQBCO based multi-relay selection schemes can obtain the same Pareto front solutions as exhaustive search when the number of relays is not very large. When the number of relays is very large, exhaustive search cannot be used due to complexity but NSQBCO based multi-relay selection schemes can still be used to solve the problems. All simulation results demonstrate the effectiveness of the proposed schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5282-5300
• /
• 2017

Multi-hop cellular networks (MCNs) reduce the transmit power and improve the system performance. Recently, several research studies have been conducted on MCNs. The mobile relay selection scheme is a rising issue in the design of MCNs that achieves these advantages. The conventional opportunistic relaying (OR) is performed on the single factor for maximum signal-to-interference-plus-noise ratio (SINR). In this paper, a comprehensive OR scheme based on Bi-Target is proposed to improve the system throughput and reduce the relay handover by constraining the amount of required bandwidth and SINR. Moreover, the proposed algorithm captures the variability and the mobility that makes it more suitable for dynamic real scenarios. Numerical and simulation results show the superiority of the proposed algorithm in both enhancing the overall performance and reducing the handover.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.21-27
• /
• 2019

In this paper, we investigate the secrecy outage probability when using a partial relay selection scheme in cooperative communication systems based on decode-and-forward with multi-relay. It is assumed that both the receiving node and the eavesdropping node receive signals at both the transmitting node and the relaying node. The two received signals are used to obtain the diversity gain using the MRC scheme. In this paper, we compute the theoretical formula of secrecy outage probability and compare the theoretical value with the simulation value to prove that equation is valid. The simulation results show how the secrecy outage probability varies with the number of relays.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5343-5364
• /
• 2016

Considering the tradeoff between energy consumption and outage behavior in buffer-aided relay selection, a novel energy-efficient buffer-aided optimal relay selection scheme with power adaptation and Inter-Relay Interference (IRI) cancellation is proposed. In the proposed scheme, energy consumption minimization is the objective with the consideration of relay buffer state, outage probability and relay power control, in order to eliminate IRI. The proposed scheme selects a pair of optimal relays from multiple candidate relays, denoted as optimal receive relay and optimal transmit relay respectively. Source-relay and relay-destination communications can be performed within a time-slot, which performs as Full-Duplex (FD) relaying. Markov chain model is applied to analyze the evolution of relay buffer states. System steady state outage probability and achievable diversity order are derived respectively. In addition, packet transmission delay and power reduction performance are investigated with a specific analysis. Numerical results show that the proposed scheme outperforms other relay selection schemes in terms of outage behavior with power adaptation and IRI cancellation in the same relay number and buffer size scenario. Compared with Buffer State relay selection method, the proposed scheme reduces transmission delay significantly with the same amount of relays. Average transmit power reduction can be implemented to relays with the increasing of relay number and buffer size, which realizes the tradeoff between energy-efficiency, outage behavior and delay performance in green cooperative communications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2831-2847
• /
• 2017

In this paper, a joint destination-relay selection and antenna mode selection scheme for full-duplex (FD) relay network is investigated, which consists of one source node, N FD amplify-and-forward (AF) relays and M destination nodes. Multiple antennas are configured at the source node, and beamforming technique is adopted. Two antennas are employed at each relay, one for receiving and the other for transmitting. Only one antenna is equipped at each destination node. In the proposed scheme, the best destination node is firstly selected according to the direct links between the source node and destination nodes. Then the transmit and receive mode of two antennas at each relay is adaptively selected based on the relaying link condition. Meanwhile, the best relay with the optimal Tx/Rx antenna configuration is selected to forward the signals. To characterize the performance of the proposed scheme, the closed-form expression of the outage probability is derived; meanwhile, the simple asymptotic expressions are also obtained. Our analysis shows that the proposed scheme obtains the benefits of multi-relay diversity and multi-destination diversity. Moreover, extra space diversity in the medium SNR region can be achieved due to the antenna selection at the relay. Finally, Monte-Carlo simulations are provided to consolidate the analytical results, and show the effectiveness of the proposed scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.273-288
• /
• 2010

In this paper, we propose a cooperative multi-relay scheme for a secondary system to achieve spectrum access along with a primary system. In the primary network, a primary transmitter (PT) transmits the primary signal to a primary receiver (PR). In the secondary network, N secondary transmitter-receiver pairs (ST-SR) selected by a centralized control unit (CCU) are ready to assist the primary network. In particular, in the first time slot, PT broadcasts the primary signal to PR, which is also received by STs and SRs. At STs, the primary signal is regenerated and linearly combined with the secondary signal by assigning fractions of the available power to the primary and secondary signals respectively. The combined signal is then broadcasted by STs in a predetermined order. In order to achieve diversity gain, STs, SRs and PT will combine received replicas of the primary signal, using selection combining technique (SC). We derive the exact outage probability for the primary network as well as the secondary network. The simulation results are presented to verify the theoretical analyses.