March 20, 2017

Distribution Reshaping for Massive Access Control in Cellular Networks

  • Chao H.
  • Chen Y.

A massive number of the fifth generation (5G) terminals in the network brings challenges to random access design, especially for machine-type communications (MTC). Based on 3rd Generation Partnership Project (3GPP) traffic model, available solutions such as extended access barring (EAB), cannot support all the MTC devices accessing into the network successfully. To solve the problem, we firstly analyze the objective of massive access control and propose the concept of distribution reshaping, with which data arrival distribution with highly coordinated manner can actually be changed into RA attempt distribution without a coordinated manner. Both the relevant application layer and radio interface schemes are proposed. Simulation results show that the proposed radio interface algorithm notably outperforms relevant existing approaches under various metrics. Moreover, it can support 10 times number of devices access the network successfully within averaged access delay of 90 milliseconds. Once the effect of the application layer scheme is superimposed into that of the radio interface scheme, higher throughput and lower access delay are obtained.

View Original Article

Recent Publications

June 04, 2017

A New PRACH Transmission Scheme in Unlicensed Spectrum

  • Luo Z.
  • Meng Y.
  • Tao T.

For the unlicensed spectrum, the occupied bandwidth requirement is demanded by some regulations. The legacy scheme of Physical Random Access Channel (PRACH) for Long Term Evolution (LTE) cannot satisfy it. In this paper, we propose a novel PRACH transmission scheme to satisfy the requirement of unlicensed spectrum based on preamble ...

June 01, 2017

Mutual service processes in Euclidean spaces: existence and ergodicity

  • Baccelli F.
  • Mathieu F.
  • Norros I.

Consider a set of objects, abstracted to points of a spatially stationary point process in R-d, that deliver to each other a service at a rate depending on their distance. Assume that the points arrive as a Poisson process and leave when their service requirements have been fulfilled. We show ...

June 01, 2017

Incentivizing social media users for mobile crowdsourcing

  • Aiello L.
  • Karaliopoulos M.
  • Koutsopoulos I.
  • Micholia P.
  • Morales G.
  • Quercia D.

We focus on the problem of contributor-task matching in mobile crowd-sourcing. The idea is to identify existing social media users who possess domain expertise (e.g., photography) and incentivize them to perform some tasks (e.g., take quality pictures). To this end, we propose a framework that extracts the potential contributors' expertise ...