<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">18481</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2021.018481</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Adaptive Relay Selection Scheme for Minimization of the Transmission Time</article-title>
<alt-title alt-title-type="left-running-head">Adaptive Relay Selection Scheme for Minimization of the Transmission Time</alt-title>
<alt-title alt-title-type="right-running-head">Adaptive Relay Selection Scheme for Minimization of the Transmission Time</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western">
<surname>Na</surname>
<given-names>Yu-Jin</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western">
<surname>Jung</surname>
<given-names>Ji-Sung</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western">
<surname>You</surname>
<given-names>Young-Hwan</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Song</surname>
<given-names>Hyoung-Kyu</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
<email>songhk@sejong.ac.kr</email>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Information and Communication Engineering, and Convergence for Intelligent Drone, Sejong University</institution>, <addr-line>Seoul, 05006, Korea</addr-line></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Engineering, and Convergence for Intelligent Drone, Sejong University</institution>, <addr-line>Seoul, 05006, Korea</addr-line></aff>
</contrib-group>
<author-notes>
<corresp id="cor1">&#x002A;Corresponding Author: Hyoung-Kyu Song. Email: <email>songhk@sejong.ac.kr</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-05-31"><day>31</day><month>05</month><year>2021</year></pub-date>
<volume>69</volume>
<issue>1</issue>
<fpage>1361</fpage>
<lpage>1373</lpage>
<history>
<date date-type="received"><day>09</day><month>3</month><year>2021</year></date>
<date date-type="accepted"><day>10</day><month>4</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Na et al.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Na et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_18481.pdf"></self-uri>
<abstract>
<p>As the installation of small cells increases, the use of relay also increases. The relay operates as a base station as well as just an amplifier. As the roles and types of relays become more diverse, appropriate relay selection technology is an effective way to improve communication performance. Many researches for relay selection have been studied to secure the reliability of relay communication. In this paper, the relay selection scheme is proposed for a cooperative system using decode-and-forward (DF) relaying scheme in the mobile communication system. To maintain the transmission rate, the proposed scheme classifies a candidate group considering the outage probability of multiple relays. For the applicable candidate group, the proposed scheme selects the relay considering the amount of data allocated to each user. Therefore, the proposed scheme defines the unit transmission time through each user&#x2019;s data and relay capacity. Finally, the proposed scheme selects a relay that minimizes the total transmission time through the relay transmission time that calculates the unit transmission time for all users. With this adaptive relay selection scheme, an optimal relay can be assigned for each user. For the same transmission rate and the amount of data, the proposed scheme improves the performance of transmission time and reliability. Simulation results show that the proposed scheme reduces the total transmission time for the same amount of data and signal to noise ratio (SNR).</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Relay selection</kwd>
<kwd>cooperative relay</kwd>
<kwd>MIMO</kwd>
<kwd>outage probability</kwd>
<kwd>transmission time</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>In upcoming years, the usage of mobile traffic is expected to be massive, and throughput of communication is getting higher. As the usage of mobile data is increased, mobile network is needed to provide higher performance in terms of throughput, latency and reliability.</p>
<p>Current mobile network systems such as long-term evolution (LTE) and 5G new radio (NR) are deployed in a variety of ways to meet the actual needs and possibilities. Meanwhile, there are many cases where sufficient reliability and throughput are not guaranteed in the wireless communication system. For example, in the mmWave bands, although a shorter transmission time interval can be used because of low frequency selectivity, the cell coverage would be limited because of higher path loss, which would inevitably lead to the use of small cell sizes [<xref ref-type="bibr" rid="ref-1">1</xref>]. Also, cells are overloaded due to increased space density and mobile devices [<xref ref-type="bibr" rid="ref-2">2</xref>]. Therefore, the design of a new cell is required.</p>
<p>The future communication network may be a heterogeneous layer network consisting of macrocells, traditional micro/picocells, new local small cells, and relay and other low-power nodes [<xref ref-type="bibr" rid="ref-3">3</xref>]. Specifically, the relay system can be used in various ways in the future wireless mobile communication network. The relay system is one of the techniques to provide sufficient coverage and reliability in the wireless communication system. The relay is used to overcome poor wireless link conditions in a cooperative communication system. By implementing a relay node, the relay node handles and routes data traffic between source and destination. Therefore, the SNR and capacity can be increased. Also, relays can improve the topology, network robustness and power consumption of mobile communication systems. As the wireless backhaul secures sufficient capacity, the mobile station can be a solution for the mobile communication systems that can configure a mobile cell architecture [<xref ref-type="bibr" rid="ref-4">4</xref>&#x2013;<xref ref-type="bibr" rid="ref-6">6</xref>]. The relay supports mobile group access and can provide new services by supporting access nodes in the Internet of things (IoT) network [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-7">7</xref>].</p>
<p>There are many researches related to relay technologies [<xref ref-type="bibr" rid="ref-8">8</xref>&#x2013;<xref ref-type="bibr" rid="ref-10">10</xref>]. A relay node can assist a pair of users with one-way (OW) or two-way (TW) traffic patterns [<xref ref-type="bibr" rid="ref-11">11</xref>]. For the same data rate, two-way relaying protocol improves transmission power consumption and spectral than one-way relaying protocol [<xref ref-type="bibr" rid="ref-12">12</xref>]. For this reason, two-way relaying protocols have been studied actively to improve performance [<xref ref-type="bibr" rid="ref-13">13</xref>].</p>
<p>To enhance the capacity and reliability, the multiple-input multiple-output (MIMO) relay system can be considered. MIMO techniques provide higher capacity gain using diversity and multiplexing in a relay system.</p>
<p>This paper proposes the adaptive relay selection scheme to enhance the transmission time of the wireless system. The proposed scheme not only considers the link capacity but also the buffered data traffic of active users. Specifically, the proposed scheme classifies the available relay group and then considers the amount of data assigned to each user. Therefore, the proposed scheme reduces the transmission time while the transmission rate is maintained.</p>
<p>This paper is organized as follows. Section 2 introduces the system model. Section 3 explains the conventional schemes. Section 4 describes the algorithm and advantage of the proposed scheme. Simulation results are shown in Section 5. Finally, Section 6 gives the brief conclusions.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>System Model</title>
<p><?A3B2 "fig1",5,"anchor"?><xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows the heterogeneous dense network consisting of multi-small cells. <?A3B2 "fig2",5,"anchor"?><xref ref-type="fig" rid="fig-2">Fig. 2</xref> is one of the small cells in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. Also, <xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows two-hop MIMO relay wireless system model in a wireless network. The system consists of one source node (<inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>S</mml:mi></mml:math></inline-formula>) node and each user <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>M</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. <?A3B2 "fig3",5,"anchor"?><xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows the buffers for <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The amount of data <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> can be changed, and the buffer size can be changed accordingly. Also, <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> requires different amount of data. The number of antennas on <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>S</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the same as <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Furthermore, multiple relays exist in the system model. Each relay node is expressed as <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> has <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> antennas for the receiving and transmitting data. A set of <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> uses the decode-and-forward (DF) protocol. Since DF protocol demodulates received signal and re-encodes the signal before retransmission of the signal, the effect of noise can be reduced. Direct links <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:mo>(</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are assumed to be too weak and cannot support the transmission of high quality [<xref ref-type="bibr" rid="ref-13">13</xref>]. Therefore, direct links <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:mo>(</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are not considered. Non-direct links (<inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:mo>(</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>) are only available. In addition, it is assumed that each node operating as a transmitter knows channel state information (CSI) through feedback according to transmission of a pilot signal to the receiver node.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The heterogeneous network for multi-small cells</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-1.png"/>
</fig>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Two-hop MIMO relaying system</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-2.png"/>
</fig>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Assigned buffers for each user</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-3.png"/>
</fig>
<p>System model uses two time slots for signal transmission. <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>S</mml:mi></mml:math></inline-formula> transmits signal to <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> during the first time slot. The received signal at <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is as follows,</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">n</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">r</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is the transmitted signal vector from <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>S</mml:mi></mml:math></inline-formula>. <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> channel between <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>S</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p>Furthermore, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is modeled as Rayleigh fading. <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow></mml:math></inline-formula> is a signal transmitted from <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>S</mml:mi></mml:math></inline-formula>. And <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mrow><mml:mi mathvariant="bold">n</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">r</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is an additive white Gaussian noise (AWGN) vector with zero mean and variance <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> at <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p>During the second time slots, <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> transmits a signal to <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>S</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is selected as a relay among a set of <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The received signals at <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are as follows,</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="bold">y</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">G</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:msup><mml:mrow><mml:mover><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">n</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where transmitted signal from a set of <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mrow><mml:mi mathvariant="bold">y</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">y</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="bold">y</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>. <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">G</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> compound channel between <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and a set of <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. A compound channel is a combination of channels between relays that can be used to transmit to the same destination. Furthermore, <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">G</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">g</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">g</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is modeled as Rayleigh fading. <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:msup><mml:mrow><mml:mover><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msup><mml:mrow><mml:mover><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is retransmitted signal from <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> receives different signals. <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mrow><mml:mi mathvariant="bold">n</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is an AWGN vector.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>The Conventional Relay Selection Schemes</title>
<p>This section describes two conventional relay selection schemes. Many researchers have studied for the methods to select relays in different communication environments [<xref ref-type="bibr" rid="ref-14">14</xref>&#x2013;<xref ref-type="bibr" rid="ref-16">16</xref>]. In each research, there are various schemes for selecting relays, but eventually the relay with the best channel conditions is selected. In other words, the channel condition of <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>R</mml:mi></mml:math></inline-formula> determines the communication performance. Accordingly, the most conventional schemes use channel magnitude from <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>R</mml:mi></mml:math></inline-formula>. Among the conventional schemes, the relay selection schemes that provide the basis for other researches are as follows.</p>
<sec id="s3_1">
<label>3.1</label>
<title>The Frobenius Norm-Based Selection Scheme</title>
<p>Norm usually uses the Frobenius norm, which is <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msub><mml:mrow><mml:mi mathvariant="normal">L</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>-norm, to indicate the distance from the origin. The Frobenius norm is defined for a channel matrix of <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>R</mml:mi></mml:math></inline-formula> as follows,</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>R</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>R</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> means the Frobenius norm of <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>R</mml:mi></mml:math></inline-formula>. <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is an element of <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> consisting of <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> with the absolute value is expressed as <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula>. The Frobenius norm of <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>R</mml:mi></mml:math></inline-formula> is the square root of a sum of all <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>.</p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>R</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p>And the diagonal entry in <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow></mml:math></inline-formula> is the sum of the squares of each column of <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Therefore, the sum of the diagonal entries of <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow></mml:math></inline-formula> is equal to the total sum of <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>. Furthermore, it is same with the sum of an eigenvalue <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow></mml:math></inline-formula>. <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula> means the square of the singular value of <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref> presents the singular value decomposition (SVD) of <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> can be described as follows,</p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold">U</mml:mi></mml:mrow><mml:mi mathvariant="bold">&#x03A3;</mml:mi><mml:msup><mml:mrow><mml:mi mathvariant="bold">V</mml:mi></mml:mrow><mml:mrow><mml:mi>H</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi mathvariant="bold-italic">U</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mrow><mml:mi mathvariant="bold">V</mml:mi></mml:mrow></mml:math></inline-formula> are unitary matrix. <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi mathvariant="bold">&#x03A3;</mml:mi></mml:math></inline-formula> is a diagonal matrix with the singular value. <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is a component of <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi mathvariant="bold">&#x03A3;</mml:mi></mml:math></inline-formula>. The sum of an eigenvalue <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow></mml:math></inline-formula> is equal to the sum of <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula>. In other words, the Frobenius norm depends on singular value. The Frobenius norm-based selection scheme calculates <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref> for each candidate relay channel and selects the relay with the largest Frobenius norm.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>The MIMO Capacity-Based Selection Scheme</title>
<p>Among the relay selection schemes, the scheme using MIMO relay channel capacity is frequently used [<xref ref-type="bibr" rid="ref-17">17</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>]. The MIMO channel capacity of the <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>k</mml:mi></mml:math></inline-formula>-th relay is as follows,</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>log</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo movablelimits="true" form="prefix">det</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="bold">I</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mi>&#x03C1;</mml:mi><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>H</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mrow><mml:mi mathvariant="bold">I</mml:mi></mml:mrow></mml:math></inline-formula> denotes the identity matrix. <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi>&#x03C1;</mml:mi></mml:math></inline-formula> denotes average SNR at each antenna of the relay as <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mfrac></mml:mstyle></mml:math></inline-formula>. <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the transmitting power of the signal and <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is noise power. <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> means the Hermitian conjugate transpose matrix of <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Therefore <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref> can be approximated as follows,</p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:msub><mml:mi>log</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mi>&#x03C1;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math>
</disp-formula></p>
<p>As a <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula> increases, available channel capacity also increases. The MIMO capacity-based selection scheme selects relay with the largest capacity using <xref ref-type="disp-formula" rid="eqn-6">Eqs. (6)</xref> or <xref ref-type="disp-formula" rid="eqn-7">(7)</xref>.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>The Proposed Selection Scheme</title>
<p>The relay selection scheme to reduce the total transmission time is proposed. The selection process consists of two selection steps. In the first step, the transmitter organizes a relay group by selecting qualified relays. According to the result of the first step, in the second step, relays for transmission are selected to minimize the total transmission time. The selection process is described in the following subsection.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Classification of Relay Candidate Group</title>
<p>For reliability of relaying, qualified <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is selected. For the selection, <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:mi>S</mml:mi></mml:math></inline-formula> calculates probability that outage does not happen for each <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> based on reported CSI. Residual capacity of the links between <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:mi>S</mml:mi></mml:math></inline-formula> and each <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is calculated as follows,</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes normalized channel capacity of <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> is the number of bits in <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow></mml:math></inline-formula>. <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:msub><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the residual capacity of the link between <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:mi>S</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. If outage happens, <inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:msub><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> becomes zero. In other words, <inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:mi>S</mml:mi></mml:math></inline-formula> decides that the link is valid when the <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is greater than <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow></mml:math></inline-formula>. Among the <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the relay that meets the non-zero condition of <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref> is defined as <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The group of the qualified relays is expressed as follows,</p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">G</mml:mi></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2223;</mml:mo><mml:msub><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn><mml:mo>}</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math>
</disp-formula></p>
<p>The selection process is summarized as follows:</p>
<p>(1) Inputs:</p>
<p> <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:mi>&#x03B2;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0pt" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>N</mml:mi></mml:math></inline-formula></p>
<p>(2) initialize:</p>
<p> <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>g</mml:mi><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></p>
<p> <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">G</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>(3) for <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>:</mml:mo><mml:mi>N</mml:mi><mml:mspace width="thinmathspace" /></mml:math></inline-formula></p>
<p>(4) if <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:msub><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mtext>then</mml:mtext></mml:math></inline-formula></p>
<p>(5) <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:mi>g</mml:mi><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>g</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula></p>
<p>(6) <inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></p>
<p>(7) <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">G</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">&#x2190;</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></p>
<p>(8) end if</p>
<p>(9) end for</p>
<p>(10) if <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:mi>G</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>2</mml:mn><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mtext>then</mml:mtext></mml:math></inline-formula></p>
<p>(11) break</p>
<p>(12) <inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> with largest <inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is selected as <inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></p>
<p>(13) else</p>
<p>(14) Go to the second process</p>
<p>(15) end if</p>
<p>The line of (10) explains processing for low SNR environment. The low SNR environment can make every <inline-formula id="ieqn-117"><mml:math id="mml-ieqn-117"><mml:msub><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> zero and outage happens in all links. In this case, <inline-formula id="ieqn-118"><mml:math id="mml-ieqn-118"><mml:mi>S</mml:mi></mml:math></inline-formula> can stop transmission until qualified link is detected.</p>
<p>However, to prevent waste of bandwidth, in proposed algorithm, <inline-formula id="ieqn-119"><mml:math id="mml-ieqn-119"><mml:mi>S</mml:mi></mml:math></inline-formula> selects the most favorable relay as <inline-formula id="ieqn-120"><mml:math id="mml-ieqn-120"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> in the coherence time. If any non-correctable errors occur, the relay should notify necessity of retransmission.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Relay Selection to Minimize the Transmission Time</title>
<p>In this section, the process to allocate relays to users is performed for minimization of the total transmission time. In this process, two cases are considered. The cases are determined according to <inline-formula id="ieqn-121"><mml:math id="mml-ieqn-121"><mml:mi>G</mml:mi></mml:math></inline-formula>. If <inline-formula id="ieqn-122"><mml:math id="mml-ieqn-122"><mml:mi>G</mml:mi></mml:math></inline-formula> is lower than two, the case is low SNR case. In the low SNR case, the most favorable relay is determined as <inline-formula id="ieqn-123"><mml:math id="mml-ieqn-123"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and the data of all users is transmitted through the selected relay. In other words, the transmission time is optimized only if the number of <inline-formula id="ieqn-124"><mml:math id="mml-ieqn-124"><mml:mi>G</mml:mi></mml:math></inline-formula> is larger than one. In the low SNR case, the transmission time is as follows,</p>
<p><disp-formula id="eqn-13">
<label>(10)</label>
<mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover><mml:mfrac><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-125"><mml:math id="mml-ieqn-125"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is normalized channel capacity between <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p>In the other case, <inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:mi>S</mml:mi></mml:math></inline-formula> optimizes the transmission time by using the CSI between the qualified relays and the users. The transmission time between <inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is defined as follows,</p>
<p><disp-formula id="eqn-14">
<label>(11)</label>
<mml:math id="mml-eqn-14" display="block"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>,</mml:mo></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>M</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the amount of data from <inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The amount is considered as random variable and generally the distribution of <inline-formula id="ieqn-133"><mml:math id="mml-ieqn-133"><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is modeled by Poisson distribution. <inline-formula id="ieqn-134"><mml:math id="mml-ieqn-134"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes normalized channel capacity between <inline-formula id="ieqn-135"><mml:math id="mml-ieqn-135"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. According to <xref ref-type="disp-formula" rid="eqn-13">Eq. (10)</xref>, the total transmission time can be described as follows,</p>
<p><disp-formula id="eqn-15">
<label>(12)</label>
<mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>.</mml:mo></mml:math>
</disp-formula></p>
<p>In other words, <inline-formula id="ieqn-137"><mml:math id="mml-ieqn-137"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the total time required to transmit data of all users. To minimize <inline-formula id="ieqn-138"><mml:math id="mml-ieqn-138"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-139"><mml:math id="mml-ieqn-139"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is determined as follows,</p>
<p><disp-formula id="eqn-16">
<label>(13)</label>
<mml:math id="mml-eqn-16" display="block"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:munder><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">g</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">R</mml:mi><mml:mrow><mml:mi mathvariant="normal">g</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">G</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:munder></mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math>
</disp-formula></p>
<p>The detailed description is summarized as follows:</p>
<p>(1) Inputs:</p>
<p> <inline-formula id="ieqn-140"><mml:math id="mml-ieqn-140"><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">G</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-141"><mml:math id="mml-ieqn-141"><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>M</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>(2) Initialize:</p>
<p> <inline-formula id="ieqn-142"><mml:math id="mml-ieqn-142"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></p>
<p>(3) for <inline-formula id="ieqn-143"><mml:math id="mml-ieqn-143"><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>:</mml:mo><mml:mi>M</mml:mi></mml:math></inline-formula></p>
<p>(4) <inline-formula id="ieqn-144"><mml:math id="mml-ieqn-144"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></p>
<p>(5) for <inline-formula id="ieqn-145"><mml:math id="mml-ieqn-145"><mml:mi>g</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>:</mml:mo><mml:mi>G</mml:mi></mml:math></inline-formula></p>
<p>(6) If <inline-formula id="ieqn-146"><mml:math id="mml-ieqn-146"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>g</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></p>
<p>(7) <inline-formula id="ieqn-147"><mml:math id="mml-ieqn-147"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>g</mml:mi></mml:math></inline-formula></p>
<p>(8) end for</p>
<p>(9) end for</p>
<p>The proposed scheme classifies a candidate relay group with non-outage. For a configured group of candidate relays, the relay with the minimum transmission time is selected. The proposed scheme can select a relay that reduces the transmission time while the BER performance through two steps is improved.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Simulation Results</title>
<p><?A3B2 "tbl1",5,"anchor"?><xref ref-type="table" rid="table-1">Tab. 1</xref> shows the simulation parameters. The proposed scheme is simulated with 64 symbols and a 7-path Rayleigh fading channel. Two different modulation schemes of QPSK and 16-QAM are used to analyze the performance according to the modulation order. The zero-forcing (ZF) scheme is used to simplify signal detection. Three distance ranges are used to compare the performance effect of distance and outage. The first distance range is divided into <inline-formula id="ieqn-151"><mml:math id="mml-ieqn-151"><mml:mi>S</mml:mi></mml:math></inline-formula> to <inline-formula id="ieqn-152"><mml:math id="mml-ieqn-152"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-153"><mml:math id="mml-ieqn-153"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> to <inline-formula id="ieqn-154"><mml:math id="mml-ieqn-154"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> based on 0.25. The second distance range is divided into <inline-formula id="ieqn-155"><mml:math id="mml-ieqn-155"><mml:mi>S</mml:mi></mml:math></inline-formula> to <inline-formula id="ieqn-156"><mml:math id="mml-ieqn-156"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-157"><mml:math id="mml-ieqn-157"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> to <inline-formula id="ieqn-158"><mml:math id="mml-ieqn-158"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> based on 0.5. The third distance range is divided into <inline-formula id="ieqn-159"><mml:math id="mml-ieqn-159"><mml:mi>S</mml:mi></mml:math></inline-formula> to <inline-formula id="ieqn-160"><mml:math id="mml-ieqn-160"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-161"><mml:math id="mml-ieqn-161"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> to <inline-formula id="ieqn-162"><mml:math id="mml-ieqn-162"><mml:mi>u</mml:mi></mml:math></inline-formula> based on 1. The maximum total distance of the first and second range is normalized to 1. The third distance range has a higher channel variation than the other distance ranges. <inline-formula id="ieqn-163"><mml:math id="mml-ieqn-163"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> has a random distribution within each distance range. The number of users is two and uses single-user detection by ZF. The number of <inline-formula id="ieqn-164"><mml:math id="mml-ieqn-164"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is four and eight to compare the performance according to the number of relays. The number of all antennas is fixed as 2 to exclude the performance change according to the number of antennas. The simulations iterate 10,000 times for statistics on performance.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Simulation parameters</title>
</caption>
<table>
<colgroup width="30">
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Number of symbols</th>
<th colspan="2">64</th>
</tr>
</thead>
<tbody>
<tr>
<td>Modulation</td>
<td colspan="2">QPSK, 16-QAM</td>
</tr>
<tr>
<td>Channel</td>
<td colspan="2">Rayleigh fading</td>
</tr>
<tr>
<td>MIMO detection</td>
<td colspan="2">Zero forcing</td>
</tr>
<tr>
<td rowspan="5">Distance rate</td>
<td colspan="2">Random distribution</td>
</tr>
<tr>
<td>Source to relay</td>
<td>Relay to destination</td>
</tr>
<tr>
<td>0 to 0.25</td>
<td>0.25 to 1</td>
</tr>
<tr>
<td>0 to 0.5</td>
<td>0.5 to 1</td>
</tr>
<tr>
<td>0 to 1</td>
<td>0 to 1</td>
</tr>
<tr>
<td>Transmit power</td>
<td colspan="2">Normalization to 1</td>
</tr>
<tr>
<td>Number of users</td>
<td colspan="2">2</td>
</tr>
<tr>
<td>Number of relays</td>
<td colspan="2">4, 8</td>
</tr>
<tr>
<td><inline-formula id="ieqn-148"><mml:math id="mml-ieqn-148"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-149"><mml:math id="mml-ieqn-149"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-150"><mml:math id="mml-ieqn-150"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td colspan="2">2</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The simulation graphs show the total transmission time and the maximum performance is normalized to 1. The proposed scheme is compared with the two conventional selection schemes, and the comparison schemes are mentioned in Section 3. The number of <inline-formula id="ieqn-165"><mml:math id="mml-ieqn-165"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is four in <?A3B2 "fig4",5,"anchor"?><xref ref-type="fig" rid="fig-4">Figs. 4</xref>&#x2013;<?A3B2 "fig5",5,"anchor"?><?A3B2 "fig6",5,"anchor"?><xref ref-type="fig" rid="fig-6">6</xref>. When the number of <inline-formula id="ieqn-166"><mml:math id="mml-ieqn-166"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is eight, performance is shown in <?A3B2 "fig7",5,"anchor"?><xref ref-type="fig" rid="fig-7">Figs. 7</xref>&#x2013;<?A3B2 "fig8",5,"anchor"?><?A3B2 "fig9",5,"anchor"?><xref ref-type="fig" rid="fig-9">9</xref>. <xref ref-type="fig" rid="fig-4">Figs. 4</xref> and <xref ref-type="fig" rid="fig-7">7</xref> use 0.25 distance range and <xref ref-type="fig" rid="fig-5">Figs. 5</xref> and <xref ref-type="fig" rid="fig-7">7</xref> use 0.5 distance range. <xref ref-type="fig" rid="fig-6">Figs. 6</xref> and <xref ref-type="fig" rid="fig-9">9</xref> use 1 distance range. All simulation graphs show the performance of 16-QAM and QPSK modulation scheme. The proposed scheme improves the total transmission time than the capacity and Frobenius norm-based scheme. In the same parameter, the capacity and Frobenius norm-based scheme have the same performance.</p>
<p>In <xref ref-type="fig" rid="fig-4">Fig. 4</xref>, the proposed scheme using QPSK modulation shows about 1.5 times faster performance at low SNR than the comparison scheme. At mid-SNR, the proposed scheme using QPSK modulation has about 1.3 times faster performance than the comparison scheme. As SNR increases, the occurrence of outages also decreases and the gain of time performance decreases. The proposed scheme using QAM modulation has about 1.5 times faster performance at low SNR. At mid-SNR, the proposed scheme using QAM modulation has about 1.3 times faster performance than the comparison scheme.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Total time performance (4 relays 0.25 distance)</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-4.png"/>
</fig>
<p>In <xref ref-type="fig" rid="fig-5">Fig. 5</xref>, the proposed scheme using QPSK modulation is about 1.3 times faster than the comparison scheme at low SNR. The proposed scheme using QAM modulation is about 1.15 times faster than the comparison scheme at low SNR. In the middle SNR, all performance gains are reduced between the proposed scheme and the comparison schemes. As the distance between the <inline-formula id="ieqn-167"><mml:math id="mml-ieqn-167"><mml:mi>S</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-168"><mml:math id="mml-ieqn-168"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is averaged, the performance gain of the proposed scheme is reduced.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Total time performance (4 relays 0.5 distance)</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-5.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows that the proposed scheme using QPSK modulation has 1.5 times faster performance gain than the comparison schemes of low SNR. At mid-SNR, the proposed scheme using QPSK modulation shows about 1.4 times faster than the comparison schemes. Compared to <xref ref-type="fig" rid="fig-5">Fig. 5</xref>, the performance gain of the proposed scheme using QAM modulation is similar at low SNR, but increases at medium SNR. When a distance range is 1, the proposed scheme using QPSK modulation has performance improvement at low SNR.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Total time performance (4 relays 1 distance)</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-6.png"/>
</fig>
<p>All schemes in <xref ref-type="fig" rid="fig-4">Figs. 4</xref> and <xref ref-type="fig" rid="fig-7">7</xref> have almost similar performance gain. <xref ref-type="fig" rid="fig-7">Fig. 7</xref> shows that the only proposed scheme has 1.2 times performance gain than the proposed scheme in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. Although the number of <inline-formula id="ieqn-169"><mml:math id="mml-ieqn-169"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> increases, the diversity gain is not linearly increased because the number of <inline-formula id="ieqn-170"><mml:math id="mml-ieqn-170"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is one. For the same reason, the performance of <xref ref-type="fig" rid="fig-8">Fig. 8</xref> is similar to <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Total time performance (8 relays 0.25 distance)</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-7.png"/>
</fig>
<p>In <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, the proposed scheme using QAM modulation is 1.3 times faster than the comparison schemes. The proposed scheme using QPSK modulation has 2 times performance improvement at low SNR than the comparison schemes. At mid-SNR, the proposed scheme using QPSK modulation has 1.8 times performance improvement at low SNR than the comparison schemes. The proposed scheme using QPSK modulation has 1.4 times performance improvement at low SNR compared to <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. At mid-SNR, the proposed scheme using QPSK modulation has 1.4 times performance improvement compared to <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The performance of the proposed scheme using QAM modulation is similar to <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The proposed scheme using QPSK modulation has a different form of performance gain than other Figures. With the QPSK modulation scheme, signal demodulation is easier than the QAM modulation scheme even when the outage occurs.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Total time performance (8 relays 5 distance)</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-8.png"/>
</fig>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Total time performance (8 relays 1 distance)</title>
</caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_18481-fig-9.png"/>
</fig>
<p>The simulation results show that the proposed scheme reduces the performance of the total time than the comparison schemes. As the low SNR, the proposed scheme has higher performance gain. Depending on the distance range, the performance gain of the comparison schemes is same but the performance gain of the proposed scheme can be improved. Especially for distance ranges of 0.25 and 1, the proposed scheme has a performance gain. The performance gain can be increased with more users.</p>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusions</title>
<p>In this paper, a relay selection scheme is proposed for reducing the transmission time. The proposed scheme gets the performance gain from two steps. The available relays in the first step are classified as candidate relay group. According to the result of the first step, the second step is executed. When an applicable case exists, the second step determines a relay considering the transmission time of each user. Through this process, the proposed scheme shows that the total transmission time is improved even at low SNR. Simulation results show that the proposed scheme improves the total transmission time when the same data are transmitted.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> This research was supported by the MSIT (Ministry of Science and ICT), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2019-2018-0-01423) supervised by the IITP (Institute for Information &#x0026; communications Technology Promotion) and was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2020R1A6A1A03038540).</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Q. C.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Niu</surname></string-name>, <string-name><given-names>A. T.</given-names> <surname>Papathanassiou</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>5G network capacity: Key elements and technologies</article-title>,&#x201D; <source>IEEE Vehicular Technology Magazine</source>, vol. <volume>9</volume>, no. <issue>1</issue>, pp. <fpage>71</fpage>&#x2013;<lpage>78</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yuan</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhuang</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Economically optimal MS association for multimedia content delivery in cache-enabled heterogeneous cloud radio access networks</article-title>,&#x201D; <source>IEEE Journal on Selected Areas in Communications</source>, vol. <volume>37</volume>, no. <issue>7</issue>, pp. <fpage>1584</fpage>&#x2013;<lpage>1593</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Zhao</surname></string-name></person-group>, &#x201C;<article-title>The requirements, challenges, and technologies for 5G of terrestrial mobile telecommunication</article-title>,&#x201D; <source>IEEE Communications Magazine</source>, vol. <volume>52</volume>, no. <issue>5</issue>, pp. <fpage>36</fpage>&#x2013;<lpage>43</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Krendzel</surname></string-name></person-group>, &#x201C;<article-title>LTE-A mobile relay handling: Architecture aspects</article-title>,&#x201D; in <conf-name>European Wireless 2013; 19th European Wireless Conf.</conf-name>, <publisher-loc>Guildford, UK</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2013</year>. </mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Pan</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Lin</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>An enhanced handover scheme for mobile relays in LTE-A high-speed rail networks</article-title>,&#x201D; <source>IEEE Transactions on Vehicular Technology</source>, vol. <volume>64</volume>, no. <issue>2</issue>, pp. <fpage>743</fpage>&#x2013;<lpage>756</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Yasuda</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Kishida</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Shen</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Morihiro</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Morioka</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A study on moving cell in 5G cellular system</article-title>,&#x201D; in <conf-name>IEEE 82nd Vehicular Technology Conf.</conf-name>, <publisher-loc>Boston, MA</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2015</year>. </mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Dong</surname></string-name></person-group>, &#x201C;<article-title>Joint relay beamforming and receiver processing for multi-way multi-antenna relay networks</article-title>,&#x201D; <source>IEEE Transactions on Communications</source>, vol. <volume>66</volume>, no. <issue>2</issue>, pp. <fpage>576</fpage>&#x2013;<lpage>588</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Tang</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Tang</surname></string-name></person-group>, &#x201C;<article-title>Relay selection and power allocation for cognitive energy harvesting two-way relaying networks</article-title>,&#x201D; in <conf-name>2015 IEEE 5th Int. Conf. on Electronics Information and Emergency Communication</conf-name>, <publisher-loc>Beijing, China</publisher-loc>, pp. <fpage>163</fpage>&#x2013;<lpage>166</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>A new residual energy based relay selection in two-way buffer-aided relay networks</article-title>,&#x201D; in <conf-name>Int. Conf. on Network and Information Systems for Computers</conf-name>, <publisher-loc>Shanghai, China</publisher-loc>, pp. <fpage>72</fpage>&#x2013;<lpage>76</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Peng</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Relay mode selection and power allocation for hybrid one-way/two-way half-duplex/full-duplex relaying</article-title>,&#x201D; <source>IEEE Communications Letters</source>, vol. <volume>19</volume>, no. <issue>7</issue>, pp. <fpage>1217</fpage>&#x2013;<lpage>1220</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L. R.</given-names> <surname>Ximenes</surname></string-name></person-group>, &#x201C;<article-title>Unified joint symbol and channel estimation with interference subtraction for one-way and two-way MIMO relaying systems</article-title>,&#x201D; in <conf-name>IEEE 10th Latin-American Conf. on Communications</conf-name>, <publisher-loc>Guadalajara</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Xia</surname></string-name></person-group>, &#x201C;<article-title>Hybrid one-way full-duplex/two-way half-duplex relaying scheme</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>5</volume>, pp. <fpage>7737</fpage>&#x2013;<lpage>7745</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Wen</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Cheng</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Yang</surname></string-name></person-group>, <source>Index Modulation for 5G Wireless Communications</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer International Publishing AG</publisher-name>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H. S.</given-names> <surname>Ryu</surname></string-name>, <string-name><given-names>J. S.</given-names> <surname>Lee</surname></string-name> and <string-name><given-names>C. G.</given-names> <surname>Kang</surname></string-name></person-group>, &#x201C;<article-title>Relay selection scheme for orthogonal amplify-and-forward relay-enhanced cellular system in a multi-cell environment</article-title>,&#x201D; in <conf-name>IEEE 71st Vehicular Technology Conf.</conf-name>, <publisher-loc>Taipei, Taiwan</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2010</year>. </mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Narasimhan</surname></string-name></person-group>, &#x201C;<article-title>Spatial multiplexing with transmit antenna and constellation selection for correlated MIMO fading channels</article-title>,&#x201D; <source>IEEE Transactions on Signal Processing</source>, vol. <volume>51</volume>, no. <issue>11</issue>, pp. <fpage>2829</fpage>&#x2013;<lpage>2838</lpage>, <year>2003</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V. N. Q.</given-names> <surname>Bao</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Linh-Trung</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Debbah</surname></string-name></person-group>, &#x201C;<article-title>Relay selection schemes for dual-hop networks under security constraints with multiple eavesdroppers</article-title>,&#x201D; <source>IEEE Transactions on Wireless Communications</source>, vol. <volume>12</volume>, no. <issue>12</issue>, pp. <fpage>6076</fpage>&#x2013;<lpage>6085</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>O.</given-names> <surname>Semiari</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Saad</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Bennis</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Dawy</surname></string-name></person-group>, &#x201C;<article-title>Inter-operator resource management for millimeter wave multi-hop backhaul networks</article-title>,&#x201D; <source>IEEE Transactions on Wireless Communications</source>, vol. <volume>16</volume>, no. <issue>8</issue>, pp. <fpage>5258</fpage>&#x2013;<lpage>5272</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Bononi</surname></string-name> and <string-name><given-names>M.</given-names> <surname>di Felice</surname> </string-name></person-group>, &#x201C;<article-title>A cross layered MAC and clustering scheme for efficient broadcast in VANETs</article-title>,&#x201D; in <conf-name>IEEE Int. Conf. on Mobile Adhoc and Sensor Systems</conf-name>, <publisher-loc>Pisa, Italy</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>8</lpage>, <year>2007</year>. </mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. A.</given-names> <surname>Suraweera</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Soysa</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Tellambura</surname></string-name> and <string-name><given-names>H. K.</given-names> <surname>Garg</surname></string-name></person-group>, &#x201C;<article-title>Performance analysis of partial relay selection with feedback delay</article-title>,&#x201D; <source>IEEE Signal Processing Letters</source>, vol. <volume>17</volume>, no. <issue>6</issue>, pp. <fpage>531</fpage>&#x2013;<lpage>534</lpage>, <year>2010</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
