The performance of the adaptive aggregation mechanism (AAM) in lossy wireless networks

The adaptive packet aggregation algorithm AAM has been shown to have a superior performance over the FIFO algorithm in terms of a greater average number of sub-packets assembled into an aggregate packet for a given value of average delay. Here, we will show that the AAM algorithm has a superior performance compared to the FIFO algorithm in terms of the aggregation trade-off in achieving the maximum average throughput with the minimum average delay in wireless networks as the average size of an AAM aggregate packet is larger than that of a FIFO aggregate packet. The analysis is based upon ns-3 simulation and includes operation under lossless and lossy channel conditions which includes the impact of PHY rate adaption scheme.