Universal Framework for Wireless Scheduling Problems release_xsxxemenk5honbds55sqlkayae

by Magnus M. Halldorsson, Tigran Tonoyan

Released as a article .

2017  

Abstract

An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and rate adjustment? We propose the first framework for approximation algorithms in the physical model that addresses these questions in full, including rate control. The approximations obtained are doubly logarithmic in the link length and rate diversity. Where previous bounds are known, this gives an exponential improvement. A key contribution is showing that the complex interference relationship of the physical model can be simplified into a novel type of amenable conflict graphs, at a small cost. We also show that the approximation obtained is provably the best possible for any conflict graph formulation.
In text/plain format

Archived Files and Locations

application/pdf  500.3 kB
file_66nyg35byfhitmrwwk6kc7lq3i
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-05-29
Version   v1
Language   en ?
arXiv  1705.10104v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 70cd11b3-441e-4932-a1f7-4692f7e3859f
API URL: JSON