Doctoral thesis
OA Policy
English

Bounds and Algorithms for Scheduling Transmissions in Wireless Networks

Contributors

Tonoyan, Tigran

Directors

Rolim, Jose

Defense date

2013-11-26

Abstract

The topic of the thesis is medium access which is one of the fundamental problems in wireless networks: as a result of the spatial nature of wireless signals wireless transmissions experience interference from each other, thus making spatially close simultaneous transmissions conflict with each other. A naturally arising problem in this context is the problem of scheduling where the transmission requests must be organized into a small number of subgroups each of which can transmit simultaneously in one time slot, the ultimate goal being executing all transmission in the minimum time. The thesis considers scheduling problems and related problems in the well known SINR (signal-to-interference-and-noise-ratio) model and extends the current state of the art on the treatment of these problems from a theoretical point of view. Several complexity results and approximation algorithms are presented for the aforementioned problems. A graph-based framework is introduced which is used to obtain results for medium access problems in the SINR model, as well as to extend the idealistic geometric SINR model towards more realistic depiction of real-world networks.

Keywords

  • Wireless Networks
  • Medium Access
  • Scheduling
  • SINR Model

Citation (ISO format)

TONOYAN, Tigran. Bounds and Algorithms for Scheduling Transmissions in Wireless Networks. Doctoral Thesis, 2013. doi: 10.13097/archive-ouverte/unige:32240

Main files (1)

Thesis

Identifiers

1010views
847downloads

Technical informations

Creation

16/12/2013 22:18:00

First validation

16/12/2013 22:18:00

Update

14/03/2023 20:43:57

Status update

14/03/2023 20:43:57

Last indexation

13/05/2025 16:29:47
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated