Design and analysis of multiple access algorithms

Date: 1 February 2017

Venue: Campus Middelheim, G0.10 - Middelheimlaan 1 - 2020 Antwerpen

Time: 4:00 PM

PhD candidate: Robbe Block

Principal investigator: Benny Van Houdt

Short description: PhD defence Robbe Block - Faculty of Science - Department of Mathematics and Computer Science


Wireless devices and communication protocols are not new and over the years, many different algorithms have been designed and analyzed. However, the explosive growth of the number of wireless devices and ever-increasing demand for speed and reliability leads to new challenges and developments in this area such as cognitive radio, 5G networks, software defined networking, etc. In addition to these new challenges, a number of old problems remain unresolved in the current literature, e.g., the maximum stable throughput of the basic binary tree algorithm with variable packet lengths.

The aim of this thesis is twofold. On one hand, we want to resolve some of the open problems of random access algorithms in a classical setting and on the other hand, we want to see how some of these algorithms behave in a more modern setting with the new challenges in mind (e.g. a multichannel environment or systems with opportunistic spectrum access capabilities). The emphasis is put on how to develop stochastic models for the considered (classes of) random access algorithms and how to use these models to gain insights about their performance.