Scheduling In Dynamic Spectrum Access Networks Using Graph Coloring

Keywords

Conflict graphs; Dynamic spectrum access; Graph coloring; Scheduling

Abstract

In a dynamic access network, multiple secondary users access and share channels that are not used by the primary users. Uncoordinated and random channel access by the secondary users access leads to decreased secondary network throughput as users in the close proximity interfere with each other. In order to better utilize the channels, we propose a scheduling technique that assigns unique time slots to all secondary users for transmission. The interference among nodes is captured using a conflict graph. Greedy graph coloring technique is applied to find time slots for every user using an approximation for the maximum number of interfering users in a Poisson distributed network. With the simulation experiments, we show how the performance of the proposed scheduling mechanism is for various network parameters.1

Publication Date

9-24-2015

Publication Title

2015 International Conference on Advances in Computing, Communications and Informatics, ICACCI 2015

Number of Pages

20-23

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/ICACCI.2015.7275578

Socpus ID

84946237363 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84946237363

This document is currently not available here.

Share

COinS