Opportunistic Scheduling with Frame Aggregation for Next Generation Wireless LANs

Ciftcioglu, Ertugrul Necdet; Gürbüz, Özgür

doi:10.1109/icc.2006.255411

Cited by 10 publications

(9 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to average overall throughput, we evaluated the fairness performance of the scheduling algorithms. To evaluate fairness performance, we defined unfairness index in (12) [1]. where T i is the average throughput of receiver i and N is the number of total receiver in the system.…”

Section: Simulation and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Proportional Fair Scheduling for IEEE802.11 Wireless LANs

Park

2009

Wireless Pers Commun

View full text Add to dashboard Cite

In the time varying wireless channel, opportunistic scheduling is one of the important techniques to achieving the rich diversities inherent in wireless communications. However, most existing scheduling schemes require centralized scheduling and little work has been done on developing distributed algorithms The proportional fair scheduling is one of the representative opportunistic scheduling for centralized networks. In this paper, we propose distributed proportional fair scheduling (DPFS) scheme for wireless LAN network. In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains higher network throughput than conventional scheduling schemes while maintaining fairness among users.

show abstract

Section: Simulation and Resultsmentioning

confidence: 99%

“…Scheduling is an essential element of MAC layer due to its effect on the overall behavior in the system [1]. Opportunistic scheduling maximizes the system throughput by using the channel variation and multiuser diversity.…”

Section: Introductionmentioning

confidence: 99%

Distributed Proportional Fair Scheduling for IEEE802.11 Wireless LANs

Park

2009

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…The time interval of MAC was assumed as 10ms, and the packet arrival rates of primary users are assumed to be 0.02, 0.01, 0.005 per 1 MAC. To evaluate fairness performance, the authors defined unfairness index in (9) [8].…”

Section: Simulation and Resultsmentioning

confidence: 99%

Distributed Channel Allocation for Ad-hoc Multichannel Cognitive Radio Networks

Kwon¹,

Park

2016

IJCA

View full text Add to dashboard Cite

Cognitive radio network was proposed to use the spectrum resource more efficiently. In a multichannel ad-hoc cognitive radio network, there is no central station and requires distributed channel scheduling. An important requirement of the cognitive radio network is to avoid interference to primary networks. In this paper, the authors propose the distributed packet scheduling scheme for ad-hoc multichannel cognitive radio networks. Each secondary user calculates independently its own priority with probabilistic manner and selects one of multi channels considering the primary user's traffic pattern to minimize interference to the primary networks.

show abstract

“…Small aggregation size will end up in low throughput even though high data rates are used.E. Ciftcioglu [18], have proposed an aggregate opportunistic scheduling (AQS) by…”

Section: August 2014mentioning

confidence: 99%

Scheduler Algorithm for IEEE802.11n Wireless LANs

Maqhat¹,

Baba²,

Rahman³

et al. 2014

IJFCC

View full text Add to dashboard Cite

Abstract-The IEEE 802.11n network main feature is to support high throughput of more than 100Mbps at the MAC layer. To achieve this, the 802.11n Task Group has introduced frame aggregation technique which reduces the overhead and increases the channel utilization efficiency. Some recent researches have enabled an A-MSDU selective retransmission which makes it robust against error. In this paper, we propose a scheduler based on an A-MSDU aggregation mechanism that supports small size and high sensitivity traffics, and enable prioritization according to the QoS requirements of the traffic classes.

show abstract

Opportunistic Scheduling with Frame Aggregation for Next Generation Wireless LANs

Cited by 10 publications

References 9 publications

Distributed Proportional Fair Scheduling for IEEE802.11 Wireless LANs

Distributed Proportional Fair Scheduling for IEEE802.11 Wireless LANs

Distributed Channel Allocation for Ad-hoc Multichannel Cognitive Radio Networks

Scheduler Algorithm for IEEE802.11n Wireless LANs

Contact Info

Product

Resources

About