March 20, 2017

Traffic profile based clustering for dynamic TDD in dense mobile networks

  • Baracca P.

Due to the wide spread of many heterogeneous applications and services, the traffic profile of future mobile networks is foreseen to become more variable in time and among different base stations (BSs). Dynamic time division duplex (TDD) has been recognized as an important enabler to cope with this traffic variability, in particular for dense networks with many BSs and few user equipments (UEs) served by each BS. In such a context, one of the main issues consists in developing an incisive scheme to manage the BS-to-BS and UE-to-UE interferences that arise in this scenario. In this work, we propose a novel long-term BS clustering scheme that groups BSs that have a similar traffic profile and would be characterized, without clustering, by strong BS-to-BS interference. Due to the complexity of the optimal solution, we propose an heuristic algorithm that efficiently solves the optimization problem. Numerical results in a dense homogeneous pico BS network show that the proposed scheme strongly outperforms even a baseline dynamic TDD without clustering by ensuring a packet delay reduction up to 35%.

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 ...