<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Success Access Probability Analysis Using Virtual Preambles Via Random Access Channel</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ivan E. Sinitsyn</string-name>
          <email>iesinitsyn@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Elvira R. Zaripova</string-name>
          <email>zaripova_er@rudn.university</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yulia V. Gaidamaka</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vsevolod S. Shorgin</string-name>
          <email>vshorgin@ipiran.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Applied Probability and Informatics Peoples' Friendship University of Russia (RUDN University)</institution>
          <addr-line>6 Miklukho-Maklaya st., Moscow, 117198, Russian Federation</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences</institution>
          <addr-line>44-2 Vavilova st., Moscow, 119333, Russian Federation</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>67</fpage>
      <lpage>74</lpage>
      <abstract>
        <p>Now rapid growth of number of the devices communicating among themselves in LTE (Long-Term Evolution) communication networks is observed, especially growth of number of machine-to-machine (M2M) devices should be noted because the number of devices will exceed 50 billion in recent years. To simplify low-cost network connection of a set of devices, communications of machine type (Machine-type communications, MTC) evolved in low-cost MTC (LC-MTC) in 3GPP standarts. LC-MTC have to cope with intensive access through a set of narrow-band channels of random access (RACH) of LTE frequencies appropriated in the range efectively. With increase in quantity and density of placement of MTC-devices the scheme of random access for LC-MTC RACH has to be improved. In this paper we suggest to use the concept of virtual preambles in the random access procedure and we carry out the success access probability and an average delay analysis via a random access channel.</p>
      </abstract>
      <kwd-group>
        <kwd>and phrases</kwd>
        <kwd>random access channel</kwd>
        <kwd>collision</kwd>
        <kwd>access success probability</kwd>
        <kwd>low-cost MTC</kwd>
        <kwd>preamble</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Copyright © 2018 for the individual papers by the papers’ authors. Copying permitted for private and
academic purposes. This volume is published and copyrighted by its editors.</p>
      <p>In: K. E. Samouylov, L. A. Sevastianov, D. S. Kulyabov (eds.): Selected Papers of the VIII Conference
“Information and Telecommunication Technologies and Mathematical Modeling of High-Tech Systems”,
Moscow, Russia, 20-Apr-2018, published at http://ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Machine-to-machine communications are extremely important for efective data
transmission from devices in a communication network for ensuring various services of
the Internet of Things, for example, such as applications for the smart house, logistic
tracking, health care, safety, observation and clever measurement [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1–5</xref>
        ]. It is expected
that more than 50 billion devices will be connected to network to serve the needs of
Internet of Things and the demand for the efective systems of MTC communications
considerably will increase [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The 3rd Generation Partnership Project (3GPP) has
started process of standardization of machine-type communications based on LTE and
LTE-Advanced technologies. MTC is standardized in the 10th release (Release-10) and
evolved in low-cost MTC (LC-MTC) in release 13 for cost-efective connectivity at a
large number of MTC devices.
      </p>
      <p>
        To reduce the cost of LC-MTC equipment the 3GPP RAN working group has ofered
new structure of RACH where the LTE network appropriates several narrow-band
random access channels (NarrowBand-RACH, NB-RACH) within its bandwidth. The
LC-MTC device chooses one of available NB-RACH channels, performing a session
initiation procedure for the chosen RACH channel. Unlike the classical procedure
where the MTC device doesn’t choose the physical channel, in new structure with the
additional identifier the choice of the concrete channel can reduce the collisions arising at
session initiation procedure. Thus, introduction of additional identifiers will reduce the
consumed amount of energy [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The growing number of MTC devices has led to many
studies being carried out on alleviation of overloads and on reduction of the possible
collisions emerging at session initiation on a radio channel of RACH [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        Standard solutions on alleviation of possible overloads in RACH can be two types:
based on push and pull technology. In the decisions based on push technology, the
procedure of session initiation is started by autonomous requests from MTC devices.
For avoidance of collisions each MTC device has to generate a unique preamble for
session initiation within the restrictions [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], predetermined or provided by network,
besides sending a preamble is possible in a certain time-slot (Access Grant Time Interval,
AGTI) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. In the decisions based on pull technology, the session initiation procedure is
operated by commands of the base station (eNodeB, eNB). The base station synchronizes
access for each MTC device or group of devices via the paging channel. Then the MTC
devices are only called to initiate the procedure of random access [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>In this paper the concept of virtual preambles for more efective recognition of
LC-MTC devices and reduction of collisions is ofered.</p>
      <p>2.</p>
    </sec>
    <sec id="sec-3">
      <title>Concept of Virtual Preamble</title>
      <p>The session initiation procedure, by the so-called rule of four handshakes, assumes
successful sending a preamble on the first step and successful reception of the response
message of RAR (Random-Access-Response) on the second step.</p>
      <p>The existing session initiation procedure on a radio channel of RACH means existence
of  preambles,   physical channels PRACH (Physical Random Access
Channel) for sending a preamble and PDCCH channel (Physical Downlink Control
Channel) on the descending communication line for a mandrel of the response message
of RAR.</p>
      <p>
        The new scheme session initiation ofered for LC-MTC RACH uses new channel
EPDCCH (Enchanced Physical Downlink Control Channel) which number can be the
additional identifier in a so-called virtual preamble instead of PDCCH channel [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The
sheaf with the EPDCCH channel number increases quantity of virtual preambles by the
coeficient equal to the number of EPDCCH channels, Fig. 1.
      </p>
      <p>
        For LC-MTC the device can choose the EPDCCH channel number for the response
message of RAR, then for the base station such preamble will difer from other
preambles [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In the existing scheme of a preamble transfer from the MTC device to the
base station for the existing session initiation procedure without binding to the PRACH
index. In the presence of one identifier with number of a preamble perhaps at once of
time it is unique to distinguish no more than  preambles. In the presence of the
second identifier in the form of EPDCCH channel the base station will distinguish a
preamble by not only according to her number but on a linking of number of a preamble
with the virtual identifier of EPDCCH channel. When receiving two preambles with one
number of a preamble the base station will distinguish these preambles on the virtual
identifier of EPDCCH channel, and such approach will reduce the arising collisions that
will serve increase in success access probability, reduction of average access delay and
other measures.
      </p>
      <p>The number of virtual identifiers of a preamble can linearly be scaled with the number
of the integrated indexes of PRACH. In the ofered LC — MTC RACH structure each
EPDCCH channel can be logically connected to several PRACH channels.</p>
      <p>In the course of session initiation the virtual preamble actually isn’t transferred, but
implicitly distinguished between the base station and LC-MTC devices. Therefore the
LC-MTC devices using the ofered scheme can be compatible to those MTC devices
which use the outdated scheme of session initiation.</p>
      <p>3.</p>
    </sec>
    <sec id="sec-4">
      <title>Success access probability and average delay analysis</title>
      <p>We analyze the following measures: collision probability, defined as the ratio between
the number of occurrences when two or more MTC devices send a random access
attempt using exactly the same preamble and the overall number of opportunities (with
or without access attempts) in the period; access success probability, defined as the
probability to successfully complete the random access procedure within the maximum
number of preamble transmissions; an average access delay, defined as the delay for each
random access procedure between the first random access attempt and the completion
of the random access procedure, for the successfully accessed MTC devices.</p>
      <p>
        The dependence of session initiation procedure measures on a collision probability
is investigated in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The same methods of a Markov chain construction were applied
in [
        <xref ref-type="bibr" rid="ref11 ref12 ref13">11–13</xref>
        ]. An influence of introduction of the additional identifier of EPDCCH channel
on these characteristics remains interesting.
      </p>
      <p>
        The success access probability is presented by a formula (1) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]:
 () = 1 − ( + (1 − )+1)+1
(1)
where  — the collision probability of a preamble, and  — probability of unsuccessful
transfer of the HARQ message Msg3,  and  — restrictions for the number of
retranslations of a preamble and the HARQ message respectively. The probability of a
preamble collision  is estimated by a formula (2) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]:
where  — intensity of session initiation requests.
      </p>
      <p>
        Number  — of the reserved session initiation opportunities (attempts) in a second
is presented by formula (3) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]:
      </p>
      <p>
        = 1 − /
 = ℎ *  * 200.
(2)
(3)
Also we analyse an average session initiation delay  using formula (4) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]:
 = ( 1+ 3+ 4) +
4 ·
 − ( + 1) +1 +  +2
(1 − ) (1 − +1)
      </p>
      <p>+
+ ( 1+ 2) · (1 − ) (1 − +1) (1 −  +1)
 (︀ 1 − ( + 1)   +   +1)︀</p>
      <p>+
+ ( 3 +  4 −
2) ·
+1 (︀ 1 − ( + 1)   +   +1)︀
(1 − +1) (1 −  +1)
, (4)
where  =  + +1(1 − ) is the probability of preamble retransmission.
4.</p>
    </sec>
    <sec id="sec-5">
      <title>Numerical experiment</title>
      <p>We analyze the dependence of a collision probability (Fig. 2)and success access
probability (Fig. 3) on number of LC-MTC devices in a cell and number of EPDCCH
channels on which RAR messages are transferred. Data from Table 1 is used for
estimations.</p>
      <p>With introduction of the additional identifier in the form of the EPDCCH channel
number reduction of collision probability and increase in success access probability in
connection for the subsequent transfer of small data is observed. Graphics in Fig. 2 and
Fig. 3 ℎ = 1 show measures for the existing session initiation procedure.</p>
      <p>All measures change their values when we apply an additional EPDCCH channel.
For the case ℎ = 2 for 7 000 LC-MTC devices the collision probability of a preamble
will decrease by 1.7 times. Let us show results for the case with two additional EPDCCH
channels. For this case with 30 000 LC-MTC devices the collision probability falls from
value 0.95 to 0.62, at the same time the success access probability rises up from value
0.45 to 0.99.</p>
      <p>Average access delay is also decreasing with the growth of number of physical channels
as shown on Fig. 4 for 30 000 LC-MTC devices average access delay with ℎ = 1 equals
142 ms, for ℎ = 2 channels the value is lower by 1.5 times and for ℎ = 3 channels
the value drops by 2.15 times.</p>
      <p>5.</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>The additional identifier approach allows to reduce the collision probability that
influences all the indicators participating in the session initiation procedure for MTC
devices on RACH radio channel. Introduction of additional identifiers increases the
success access probability and reduces the average access delay. The analysis of success
access probability and average delay is shown in the current paper.</p>
      <p>
        As further research we plan to apply this approach for analysis of new RACH
mechanisms, for example, so called CAM RACH (critical alarm messages RACH) for
Emergency Alarm Messages, or to another preliminary measures [
        <xref ref-type="bibr" rid="ref15 ref16 ref17 ref18 ref19 ref20 ref21 ref22">15–22</xref>
        ].
      </p>
      <p>Random access related system parameters</p>
      <sec id="sec-6-1">
        <title>Parameters</title>
        <p>Total number of RACH opportunities
Maximum number of preamble (Msg1)
retransmissions
Maximum number of HARQ
retransmissions for Msg3
Total number of preambles in a RA slot
Probability of unsuccessful transfer of
the HARQ message (Msg3)
Number of physical channels
Time interval before sending Msg3 or
preamle retransmission
Time interval for Backof window
Time interval between successful
receiving Msg2 and sending Msg3
Time interval for sending Msg3, waiting
and processing Msg4





ℎ
1
2
3
4</p>
      </sec>
      <sec id="sec-6-2">
        <title>Notation Value 10800; 21600; 32400 90</title>
        <p>250
240
130
1; 2; 3</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>The publication has been prepared with the support of the “RUDN University
Program 5-100” and funded by RFBR according to the research projects No 17-07-00845,
16-07-00766.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>K. E.</given-names>
            <surname>Samouylov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. V.</given-names>
            <surname>Gaidamaka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. A.</given-names>
            <surname>Gudkova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. R.</given-names>
            <surname>Zaripova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Y.</given-names>
            <surname>Shorgin</surname>
          </string-name>
          ,
          <article-title>Baseline Analytical Model for Machine-Type Communications over 3GPP RACH in LTE-Advanced Networks</article-title>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Czachórski</surname>
          </string-name>
          et al. (Eds.):
          <source>ISCIS</source>
          <year>2016</year>
          , CCIS
          <volume>659</volume>
          (
          <year>2016</year>
          )
          <fpage>203</fpage>
          -
          <lpage>213</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Y.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <article-title>Eficient Random-Access Scheme for Massive Connectivity in 3GPP Low-Cost Machine-Type Communications</article-title>
          ,
          <source>IEEE Transactions on Vehicular Technology</source>
          <volume>66</volume>
          (
          <issue>7</issue>
          ) (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>M.</given-names>
            <surname>Islam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Taha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Akl</surname>
          </string-name>
          ,
          <article-title>A Survey of Access Management Techniques in Machine Type Communications</article-title>
          ,
          <source>IEEE Communications Magazine</source>
          ,
          <volume>52</volume>
          (
          <issue>4</issue>
          ) (
          <year>2014</year>
          )
          <fpage>74</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <source>3GPP TS 22.368 v13.1</source>
          .0,
          <string-name>
            <given-names>Technical</given-names>
            <surname>Specification</surname>
          </string-name>
          Group Services and
          <article-title>System Aspects; Service Requirements for Machine-Type Communications (MTC); Stage 1 (Release 13)</article-title>
          , Dec.
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>A.</given-names>
            <surname>Metnitzer</surname>
          </string-name>
          ,
          <article-title>Nokia Siemens Networks Machine2Machine Solution</article-title>
          ,
          <source>In Proc. International Convention of MIPRO</source>
          , May
          <year>2011</year>
          , pp.
          <fpage>386</fpage>
          -
          <lpage>388</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>T.</given-names>
            <surname>Taleb</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Kunz</surname>
          </string-name>
          ,
          <source>Machine Type Communications in 3GPP Networks: Potential</source>
          , Challenges, and Solutions,
          <source>IEEE Communications Magazine</source>
          <volume>50</volume>
          (
          <issue>3</issue>
          ) (
          <year>2012</year>
          )
          <fpage>178</fpage>
          -
          <lpage>184</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>M.</given-names>
            <surname>Hasan</surname>
          </string-name>
          , E. Hossain, and
          <string-name>
            <given-names>D.</given-names>
            <surname>Niyato</surname>
          </string-name>
          ,
          <article-title>Random Access for Machineto-Machine Communication in LTE-Advanced Networks: Issues and Approaches</article-title>
          ,
          <source>IEEE Communications Magazine</source>
          <volume>51</volume>
          (
          <issue>6</issue>
          ) (
          <year>2013</year>
          )
          <fpage>86</fpage>
          -
          <lpage>93</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <source>3GPP TR 37.868 v11.0</source>
          .0,
          <string-name>
            <given-names>Technical</given-names>
            <surname>Specification</surname>
          </string-name>
          Group Radio Access Network;
          <article-title>Study on RAN Improvements for Machine-type Communications</article-title>
          ,
          <source>Sep</source>
          .
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>S. Y.</given-names>
            <surname>Lien</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-C. Chen</surname>
            , and
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Toward Ubiquitous Massive Accesses in 3GPP Machine-to-Machine Communications</article-title>
          ,
          <source>IEEE Communications Magazine</source>
          <volume>49</volume>
          (
          <issue>4</issue>
          ) (
          <year>2011</year>
          )
          <fpage>66</fpage>
          -
          <lpage>74</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>C. H. Wei</surname>
            , R. G. Cheng, and
            <given-names>S. L.</given-names>
          </string-name>
          <string-name>
            <surname>Tsao</surname>
          </string-name>
          ,
          <article-title>Performance Analysis of Group Paging for Machine-Type Communications in LTE Networks</article-title>
          ,
          <source>IEEE Transactions on Vehicular Technology</source>
          <volume>62</volume>
          (
          <issue>7</issue>
          ) (
          <year>2013</year>
          )
          <fpage>3371</fpage>
          -
          <lpage>3382</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>A.</given-names>
            <surname>Ometov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Sopin</surname>
          </string-name>
          , I. Gudkova,
          <string-name>
            <given-names>S.</given-names>
            <surname>Andreev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. V.</given-names>
            <surname>Gaidamaka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koucheryavy</surname>
          </string-name>
          ,
          <article-title>Modeling Unreliable Operation of mmWave-Based Data Sessions in Mission-Critical PPDR Services, IEEE Access 5 (2017), art</article-title>
          . no.
          <issue>8055435</issue>
          , pp.
          <fpage>20536</fpage>
          -
          <lpage>20544</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>D.</given-names>
            <surname>Efrosinin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Samouylov</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gudkova</surname>
          </string-name>
          ,
          <article-title>Busy period analysis of a queueing system with breakdowns and its application to wireless network under licensed shared access regime</article-title>
          ,
          <source>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          ,
          <source>LNCS</source>
          <volume>9870</volume>
          (
          <year>2016</year>
          )
          <fpage>426</fpage>
          -
          <lpage>439</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>K.</given-names>
            <surname>Samouylov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Naumov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Sopin</surname>
          </string-name>
          , I. Gudkova,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shorgin</surname>
          </string-name>
          ,
          <article-title>Sojourn time analysis for processor sharing loss system with unreliable server</article-title>
          ,
          <source>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          <volume>9845</volume>
          (
          <year>2016</year>
          )
          <fpage>284</fpage>
          -
          <lpage>297</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Ericsson</surname>
          </string-name>
          R1
          <article-title>-061369 TSG-RAN WG1 45 LTE random-access capacity and collision probability</article-title>
          , Shanghai, China, May 8-
          <issue>12</issue>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>D.</given-names>
            <surname>Sijabat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Harwahyu</surname>
          </string-name>
          and R. G. Cheng,
          <article-title>Energy-Eficiency of RACH-Based small data transmission scheme in LTE networks</article-title>
          ,
          <source>2017 40th International Conference on Telecommunications and Signal Processing (TSP)</source>
          ,
          <source>Barcelona</source>
          (
          <year>2017</year>
          )
          <fpage>106</fpage>
          -
          <lpage>109</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>N.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Condoluci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nallanathan</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Dohler</surname>
          </string-name>
          ,
          <article-title>RACH Preamble Repetition in NB-IoT Network</article-title>
          , in IEEE Communications Letters, no.
          <volume>99</volume>
          (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>A. H. E. Fawal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Mansour</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Le Roy</surname>
            ,
            <given-names>D. Le</given-names>
          </string-name>
          <string-name>
            <surname>Jeune</surname>
            and
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Hamié</surname>
          </string-name>
          ,
          <article-title>RACH overload congestion mechanism for M2M communication in LTE-A: Issues and approaches</article-title>
          ,
          <source>2017 International Symposium on Networks, Computers and Communications (ISNCC)</source>
          ,
          <source>Marrakech</source>
          (
          <year>2017</year>
          )
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>S.</given-names>
            <surname>Vural</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bucknell</surname>
          </string-name>
          , G. Foster,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tafazolli</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Muller</surname>
          </string-name>
          ,
          <article-title>Dynamic Preamble Subset Allocation for RAN Slicing in 5G Networks, in IEEE Access 6 (</article-title>
          <year>2018</year>
          )
          <fpage>13015</fpage>
          -
          <lpage>13032</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>K. Taleb Ali</surname>
            ,
            <given-names>S. Ben</given-names>
          </string-name>
          <string-name>
            <surname>Rejeb</surname>
            and
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Choukair</surname>
          </string-name>
          ,
          <article-title>A congestion control approach based on dynamic ACB of diferentiated M2M services in 5G/HetNet, 2017 13th International Wireless Communications</article-title>
          and Mobile Computing Conference (IWCMC),
          <source>Valencia</source>
          (
          <year>2017</year>
          )
          <fpage>1126</fpage>
          -
          <lpage>1131</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>V.</given-names>
            <surname>Schrader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Vilgelm</surname>
          </string-name>
          and
          <string-name>
            <given-names>W.</given-names>
            <surname>Kellerer</surname>
          </string-name>
          ,
          <article-title>On Random Access Channel Performance and M2M Support in Standalone LTE Unlicensed</article-title>
          ,
          <source>GLOBECOM 2017 - IEEE Global Communications Conference</source>
          , Singapore (
          <year>2017</year>
          )
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21. L.
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Cao</surname>
            and
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Yuan</surname>
          </string-name>
          ,
          <article-title>On uplink non-orthogonal multiple access for 5g: opportunities and challenges</article-title>
          ,
          <source>in China Communications</source>
          <volume>14</volume>
          (
          <issue>12</issue>
          ) (
          <year>2017</year>
          )
          <fpage>142</fpage>
          -
          <lpage>152</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Chih-Min Chao</surname>
          </string-name>
          and
          <string-name>
            <surname>Chia-Tsun</surname>
            <given-names>Chen</given-names>
          </string-name>
          ,
          <article-title>Ratio adjustable channel hopping enhancement for heterogeneous cognitive radio networks</article-title>
          ,
          <source>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</source>
          , Paris (
          <year>2017</year>
          )
          <fpage>1093</fpage>
          -
          <lpage>1098</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>