JOURNAL ARTICLE

Distributed Opportunistic Packet Scheduling Policy in Wireless LANs

Abstract

Due to the fluctuations of wireless channels, we can use opportunistic scheduling to exploit multiuser diversity. The conventional opportunistic scheduling is not applied to wireless LANs due to the absence of channel report function. In this paper, we propose a distributed opportunistic scheduling scheme for wireless LAN networks without incurring large overhead of channel probing. A proportional fair scheduling, which is one of the opportunistic scheduling schemes, is used for centralized networks, whereas we design distributed proportional fair scheduling (DPFS) scheme and medium access control in distributed manner. We compare the performance of the DPFS with conventional packet scheduling through computer simulation. Simulation results shows the proposed DPFS can achieve higher throughput than conventional scheduling while maintaining fairness among receivers.

Keywords:
Computer science Maximum throughput scheduling Scheduling (production processes) Round-robin scheduling Computer network Fair-share scheduling Proportionally fair Dynamic priority scheduling Distributed computing Network packet Fixed-priority pre-emptive scheduling Wireless Wireless network Rate-monotonic scheduling Engineering Quality of service Telecommunications

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
9
Refs
0.12
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Advanced Wireless Network Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Wireless Networks and Protocols
Physical Sciences →  Computer Science →  Computer Networks and Communications
Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.