Mobility

Optimal Packet Size for Network Throughput With Time-Bound Fairness in IEEE 802.11 Networks

Free registration required

Executive Summary

With the popularity of IEEE 802.11 networks, it has become increasingly important to analyze the performance of IEEE 802.11 protocols more accurately. The IEEE 802.11 Distributed Coordination Function (DCF) protocol exhibits fairness problem in scenarios with asymmetric topology. Existing strategies mostly aim at the fairness issue without considering the convergence time to achieve fairness. However, node mobility leads to extensive time-bound communication, such as in delay-tolerant or vehicular networks, where the nodes may communicate in short time scales. In this paper, the authors study how to achieve fairness and at the same time relatively high network throughput when the flows contend in a short time scale.

  • Format: PDF
  • Size: 456.53 KB