Delay-constrained optimized packet aggregation in high-speed wireless ad hoc networks

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, high-speed WLANs are introduced to service growing demand of delay-sensitive and multimedia applications. To improve efficiency at the MAC layer of high-speed WLANs, few researches have tried to utilize approaches such as Aggregation in which a number of packets concatenated into a larger frame to reduce protocol overheads. Since transmitting larger frames causes increases in delay and jitter which are crucial, especially in delay-sensitive and multimedia applications, selecting the best aggregated frame size is significant. In this paper, we propose an analytical model for optimized packet aggregation (OPA) that finds the optimized aggregation size with regard to delay constraints of nodes. OPA enhances one of the aggregation methods, aggregation with fragment retransmission (AFR) scheme, and models aggregation by a constrained convex optimization problem to maximize network throughput while constraining the delay. Simulation results show that OPA increases throughput and decreases the average delay as well. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Teymoori, P., Yazdani, N., & Sehati, A. (2012). Delay-constrained optimized packet aggregation in high-speed wireless ad hoc networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 72 LNICST, pp. 389–400). https://doi.org/10.1007/978-3-642-29157-9_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free