June 29, 2017

Self-similarity in Urban Wireless Networks: Hyperfractals

  • Jacquet P.
  • Popescu D.

We introduce a model of Poisson patterns of fixed and mobile nodes on lines designed for urban wireless networks. The pattern obeys to “Hyperfractal” rules of dimension larger than 2. The hyperfractal pattern is the best suitable to capture the traffic over the streets and highways in a city. We show that the network capacity under ad hoc routing algorithms scales much better than with the classic uniform Poisson shot model. The scaling effect depends on the hyperfractal dimensions. We show this results in two different routing models: nearest neighbor routing with no collision, minimum delay routing model assuming slotted Aloha and signal to interference ratio (SIR) capture condition, power-path loss and Rayleigh fading. The novelty of the model is that, in addition to capturing the irregularity and variability of the node configuration, it exploits self-similarity, a characteristic of urban wireless networks.

View Original Article

Recent Publications

June 19, 2017


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