June 29, 2017

Making the Case for Dynamic Wireless Infrastructure Sharing: a Techno-Economic Game

  • Capone A.
  • Lieto A.
  • Malanchini I.
  • Suryaprakash V.

Dynamic and flexible radio resource management in a multi-tenant shared infrastructure is an effective strategy to improve the quality experienced by end users. In this framework, we propose a techno-economic model that allows network operators to compete and dynamically select the quality target to deliver to their customers, while simultaneously maximizing the profit. In order to understand the willingness of the network operators in the engagement on a sharing scenario, we develop a non-cooperative game wherein the Nash Equilibria show the disposition of operators to meet the customers' requirements. At the same time, the proposed framework show how it is challenging the definition of a new business market when scarcity of resources is assumed.

View Original Article

Recent Publications

June 19, 2017

COMBINING BELIEF PROPAGATION AND SUCCESSIVE CANCELLATION LIST DECODING OF POLAR CODES ON A GPU PLATFORM

  • Cammerer S.
  • Hoydis J.
  • Leible B.
  • Stahl M.
  • Ten Brink S.

The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm. In this work, we implement the powerful successive cancellation list (SCL) decoder on a GPU and identify the bottlenecks of this algorithm with ...

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