WSN01-1: Frame Aggregation and Optimal Frame Size Adaptation for IEEE 802.11n WLANs

Lin, Yuxia; Wong, Vincent W. S.

doi:10.1109/glocom.2006.925

Cited by 171 publications

(95 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, the whole A-MSDU must be retransferred, by combining every MSDU via a pattern. This case is dealt with in (Lin and Wong, 2006), where further configurations have been suggested to achieve accuracy in busy networks.…”

Section: A-msdu Aggregationmentioning

confidence: 99%

“…This study aims to come up with a methodical comprehension of the three main improvised processes of IEEE 802.11n MAC layer which include aggregating scheme, block acknowledgment and reversed direction transmission. In past researchers, focus was given on the improved throughput by assessing the standard's efficiency and the aggregation process (Lin and Wong, 2006;Skordoulis et al, 2008;Xiao, 2005). For the outcome of this study, a comprehensive discussion and evaluation will be provided on the reverse direction transmission using single data frame in the 802.11n and the implementation of a new scheme which is divided the data frame from sender and receiver into subframes and send each sub-frame.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design a New Bidirectional Transmission Protocol to Improve the Performance of MAC Layer Based on Very High Speed WLANs

Milad¹,

Noh²,

Shibghatullah³

et al. 2015

Journal of Computer Science

View full text Add to dashboard Cite

This paper presents a new bidirectional transmission protocol with single data frame to computing the performance of MAC layer based on IEEE 802.11n. As high as 600 Mbps of physical data rate is achieved in IEEE 802.11n where high data rate the current MAC layer leads to high performance overhead and low performance of throughput and designing the MAC layer still ongoing to achieve high performance throughput. In this study, a new bidirectional transmission protocol with single data frame has been proposed called BTDF bidirectional transmission data fragmentation, which is divided each data frame from sender to receiver and reverse into subframes and send each subframe, Packets those exceed the size threshold are divided into fragments also where the corrupted subframe will be retransmitted during the disruption of transmission. We have implemented this scheme in NS2 simulator to show the results for TCP and HDTV traffics and compared with literature.

show abstract

Section: A-msdu Aggregationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Design a New Bidirectional Transmission Protocol to Improve the Performance of MAC Layer Based on Very High Speed WLANs

Milad¹,

Noh²,

Shibghatullah³

et al. 2015

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…Dynamic packet size optimization and channel selection for cognitive radio sensor networks is studied in [29]. Finally, [30] studies frame aggregation schemes in 802.11n WLAN with channel errors and proposes optimal frame size adaptation algorithm.…”

Section: Packet Length Adaptationmentioning

confidence: 99%

Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols

Katila

Buratti

Abrignani

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

In this paper, we consider a beyond-5G scenario, where two types of users, denoted as scheduled and uncoordinated nodes, coexist on the same set of radio resources for sending data to a base station. Scheduled nodes rely solely on a centralized scheduler within the base station for the assignment of resources, while uncoordinated nodes use an unslotted Carrier Sense Multiple Access (CSMA) protocol for channel access. We propose and evaluate through simulations: (a) a novel centralized resource scheduling algorithm, called Neighbors-Aware Proportional Fair (N-PF) and (b) a novel packet length adaptation algorithm, called Channel-Aware (CA) Packet Length Adaptation algorithm for the scheduled nodes. The N-PF algorithm considers the uplink channel state conditions and the number of uncoordinated nodes neighboring each scheduled node in the aggregate scheduling metric, in order to maximize packet transmission success probability. The CA algorithm provides an additional degree of freedom for improving the performance, thanks to the fact that scheduled nodes with lower number of hidden terminals, i.e., having higher packet capture probability, are assigned longer packet transmission opportunities. We consider two benchmark schemes: Proportional Fair (PF) algorithm, as a resource scheduling algorithm, and a discrete uniform distribution (DUD) scheme for packet lengths distribution. Simulation results show that the proposed schemes can result in significant gain in terms of network goodput, without compromising fairness, with respect to two benchmark solutions taken from the literature.Keywords: Proportional Fair, Neighbors-Aware, Scheduling, Unslotted CSMA, Packet delivery rate, Fairness, Packet length adaptation BackgroundIn future wireless systems, such as 5G and beyond, the current dominating human-centric communication systems will be complemented by a tremendous increase in the number of smart devices, i.e., things, equipped with radio devices, possibly sensors, and uniquely addressable [1]. This will result in explosion of wireless traffic volume [2] and consequently exponential growth in demand of radio spectrum. However, the radio spectrum resource will remain limited, and thus, efficient radio resource utilization techniques, such as advanced medium access control (MAC) schemes, will be of paramount importance.*Correspondence: charlesjumaa.katila@unibo.it Electrical, Electronics and Information Engineering Department, University of Bologna, Bologna, Italy Based on the above motivation, we envision a novel scenario, where some users (hereafter denoted as scheduled nodes), synchronized and coordinated by a base station (BS), coexist on the same set of radio resources with some other users (hereafter denoted as uncoordinated nodes), asynchronous with the BS and among them. As shown in Fig. 1, scheduled nodes could be user equipment (i.e., cellular users), while uncoordinated nodes could be things of the Internet of Things (IoT) paradigm, i.e., cars, machines, buildings [3].In wireless networks, MAC prot...

show abstract

“…The reference [24] proposes a dynamic and distributed aggregation mechanism which addresses the performance anomaly in both UDP and TCP scenarios by achieving time-based fairness in nearly all of the tested configurations. There are also existing results on optimal aggregation policies in 802.11n that can substantially increase aggregate throughput [25]. The reference [26] formulates DCF with respect to mixed data rates and packet sizes, and offers an adaptive packet size adjustment method.…”

Section: Related Workmentioning

confidence: 99%

Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs

Yazıcı

Akar

2013

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-Conventional multi-rate IEEE 802.11 Wireless LANs (WLANs) are associated with the so-called performance anomaly to describe the phenomenon of high bit rate nodes being dragged down by slower nodes. This anomaly is known to be an impediment to obtaining high cumulative throughputs despite the employment of effective link adaptation mechanisms. To cope with the performance anomaly, air-time fairness has been proposed as an alternative to throughput fairness, the latter being a main characteristic of the IEEE 802.11 Distributed Coordination Function (DCF). In this paper, we propose a novel distributed air-time fair MAC (Medium Access Control) without having to change the operation of the conventional DCF. In the proposed MAC, each node in the system runs multiple instances of the conventional DCF back-off algorithm where the number of DCF instances for the nodes can be chosen in a distributed manner. Both analytical and simulation-based results are provided to validate the effectiveness of the proposed air-time fair MAC.

show abstract

WSN01-1: Frame Aggregation and Optimal Frame Size Adaptation for IEEE 802.11n WLANs

Cited by 171 publications

References 9 publications

Design a New Bidirectional Transmission Protocol to Improve the Performance of MAC Layer Based on Very High Speed WLANs

Design a New Bidirectional Transmission Protocol to Improve the Performance of MAC Layer Based on Very High Speed WLANs

Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols

Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs

Contact Info

Product

Resources

About