Enhancing delay and data-loss performance in wireless traffic control

This paper deals with efficient exploitation of resources in wireless IP networks. In the wireless context specifically, making optimal use of the scarce bandwidth has led into engineering wireless compensation mechanisms incorporated in the scheduling process, i.e. channel state dependent (CSD) packet scheduling, as a powerful approach to maximize wireless link utilization. In the literature, the most widely known wireless traffic control solutions are based on fair queuing and hierarchical link-sharing. We propose a wireless traffic control architecture based on dynamically adjusting traffic shaping and earliest deadline scheduling adapted to the wireless context with a CSD packet scheduling approach. Opnet simulations show how this alternative architecture outperforms a well-known fair queuing algorithm, i.e. WFS, on the basis of delay and data-loss metrics and appears particularly effective in traffic control in the presence of little knowledge of flow statistical profiles.