<rss version="2.0" xmlns:atom="https://www.w3.org/2005/Atom">
  <channel>
    <title>Transport Research International Documentation (TRID)</title>
    <link>https://trid.trb.org/</link>
    <atom:link href="https://trid.trb.org/common/TRIS Suite/feeds/RSS.aspx?s=PHNlYXJjaD48cGFyYW1zPjxwYXJhbSBuYW1lPSJkYXRlaW4iIHZhbHVlPSJhbGwiIC8%2BPHBhcmFtIG5hbWU9InN1YmplY3Rsb2dpYyIgdmFsdWU9Im9yIiAvPjxwYXJhbSBuYW1lPSJ0ZXJtc2xvZ2ljIiB2YWx1ZT0ib3IiIC8%2BPHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7UmFuZG9tIGFjY2VzcyBjaGFubmVsJnF1b3Q7IiBvcmlnaW5hbF92YWx1ZT0iJnF1b3Q7UmFuZG9tIGFjY2VzcyBjaGFubmVsJnF1b3Q7IiAvPjwvZmlsdGVycz48cmFuZ2VzIC8%2BPHNvcnRzPjxzb3J0IGZpZWxkPSJwdWJsaXNoZWQiIG9yZGVyPSJkZXNjIiAvPjwvc29ydHM%2BPHBlcnNpc3RzPjxwZXJzaXN0IG5hbWU9InJhbmdldHlwZSIgdmFsdWU9InB1Ymxpc2hlZGRhdGUiIC8%2BPC9wZXJzaXN0cz48L3NlYXJjaD4%3D" rel="self" type="application/rss+xml" />
    <description></description>
    <language>en-us</language>
    <copyright>Copyright © 2026. National Academy of Sciences. All rights reserved.</copyright>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <managingEditor>tris-trb@nas.edu (Bill McLeod)</managingEditor>
    <webMaster>tris-trb@nas.edu (Bill McLeod)</webMaster>
    <image>
      <title>Transport Research International Documentation (TRID)</title>
      <url>https://trid.trb.org/Images/PageHeader-wTitle.jpg</url>
      <link>https://trid.trb.org/</link>
    </image>
    <item>
      <title>A Centralized Preamble Detection-Based Random Access Scheme for LTE CoMP Transmission</title>
      <link>https://trid.trb.org/View/1422411</link>
      <description><![CDATA[For the coordinated multipoint (CoMP) transmission in Long-Term Evolution (LTE) systems, its performance is greatly impacted by the estimation of timing offsets (TOs) between cell-edge user equipment (UE) and transmit points, which is supposed to be dealt with by using the random access (RA) procedure. Available RA schemes for the CoMP transmission offer poor RA performance in terms of multiuser detection, TO estimation, power estimation, and access delays. To improve the RA performance and fully exploit the CoMP structure, in this paper, the authors propose a novel centralized parallel RA (CP-RA) scheme, which performs in threefold. First, a novel RA subchannel allocation scheme is proposed to suppress mutual interference between coordinated users and noncoordinated users. Second, an iterative parallel interference cancelation (IPIC)-based multiuser detection and estimation algorithm is proposed on the basis of the space-alternating generalized expectation-maximization (SAGE) algorithm. Finally, the coordinated diversity of the system structure could be exploited to implement centralized multiuser detection. Analyses and simulation results show that the proposed RA scheme is able to provide satisfied RA performance compared with existing schemes.]]></description>
      <pubDate>Fri, 23 Sep 2016 11:19:05 GMT</pubDate>
      <guid>https://trid.trb.org/View/1422411</guid>
    </item>
    <item>
      <title>Estimation and Adaptation for Bursty LTE Random Access</title>
      <link>https://trid.trb.org/View/1404108</link>
      <description><![CDATA[With the potential to generate numerous connection requests, an explosive growth in the volume of data traffic and the number of mobile and machine-to-machine devices has drawn new attention to the radio access network. Surging random-access attempts cause not only severe preamble collisions but downlink resource shortage as well, thus degrading the performance of the random-access procedure. However, the effect of downlink resource shortage on system performance has yet to be comprehensively studied. In addition, most existing random-access contention resolution mechanisms sacrifice random-access channel (RACH) throughput for a high success probability, and thus, the price is that low-throughput mechanisms need a lot of time to deal with access attempts. In this paper, the authors evaluate the medium-access-control (MAC)-level performance for the four-step random-access procedure in Long-Term Evolution (LTE) systems, both with and without constrained downlink resources. Furthermore, the authors propose a novel RACH contention resolution scheme, i.e., the dynamic backoff (DB) scheme. DB can achieve high RACH throughput, yielding a high random-access success probability under various RACH overloaded scenarios.]]></description>
      <pubDate>Thu, 28 Apr 2016 14:47:06 GMT</pubDate>
      <guid>https://trid.trb.org/View/1404108</guid>
    </item>
    <item>
      <title>Random-Access Channel Queuing Model</title>
      <link>https://trid.trb.org/View/1404105</link>
      <description><![CDATA[In the Long-Term Evolution (LTE) mobile communication standard, there is provision for a random-access channel (RACH), which provides users the opportunity to gain access to the network. Future fourth-generation and fifth-generation systems will undoubtedly also have some similar scheme. Therefore, better understanding of such systems is desirable. To this end, the authors present, in this paper, an abstract representation of the RACH queue that is in the form of a leaky Markov “ball and urn” model, where the number of balls in M successive bins represents the number of users contending for access after each of M attempts. The authors analyze this model by evolving a multidimensional probability distribution for the number of balls in each bin, from which the individual probabilities are then determined as marginals. In particular, the probability of the  M th bin will determine the probability of access or failure. An efficient computational scheme is developed to evolve the bin probabilities, and the results are shown to be in excellent agreement with Monte Carlo simulation, which, for  M=mbox{3} , requires 10,000 times longer run time.]]></description>
      <pubDate>Thu, 28 Apr 2016 14:46:53 GMT</pubDate>
      <guid>https://trid.trb.org/View/1404105</guid>
    </item>
  </channel>
</rss>