May 08, 2017

Coexistence-aware dynamic channel allocation for 3.5 GHz shared spectrum systems

The paradigm of shared spectrum allows secondary devices to opportunistically access spectrum bands underutilized by primary owners. As the first step, the FCC targeted sharing the 3.5 GHz (3550–3700 MHz) federal spectrum with commercial systems. The proposed rules require a Spectrum Access System to implement a three-tiered spectrum management framework, and one of its key functions is dynamic channel allocation (CA) for secondary devices. In this paper, we introduce coexistence-aware radio-channel-pair conflict graphs to capture pairwise interference, spatial channel availability variations, channel contiguity, and coexistence opportunities. We develop a super-radio formation algorithm to identify valid super-radios, i.e., a set of radios that can coexist on the same channel(s) via WiFi-like carrier-sensing mechanisms. With the proposed generic graph representation, we formulate CA as conflict-free max-demand CA with a min-demand constraint, and develop algorithms based on maximum weighted independent set. Preliminary results demonstrate good performance of proposed algorithms and benefits of coexistence.

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