QoS aware distributed matching algorithm for link scheduling in wireless networks

In this paper we propose a QoS aware algorithm for link scheduling in wireless networks. The proposed algorithm uses generalization and modification to a recently presented distributed matching algorithm which computes the matching in O(1) but does not consider QoS aspects. We make some enhancement...

Full description

Saved in:
Bibliographic Details
Main Authors: Ghiasian, A., Saidi, H.
Format: Conference Proceeding
Language:English
Subjects:
Delay
Distributed link scheduling
Interference
Matching
Processor scheduling
Protocols
Quality of service
Scheduling algorithm
Signal to noise ratio
Telecommunication traffic
Throughput
Wireless networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we propose a QoS aware algorithm for link scheduling in wireless networks. The proposed algorithm uses generalization and modification to a recently presented distributed matching algorithm which computes the matching in O(1) but does not consider QoS aspects. We make some enhancement on the original algorithm to improve its delay and throughput performance. Also, by defining a new regulator parameter, it becomes possible to control the behavior of the algorithm in accordance with different classes of traffic. Simulation results confirm the improvements.
ISSN:2157-0221
2157-023X
DOI:10.1109/ICUMT.2009.5345595