<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05276879</id>
  <dt>a</dt>
  <an>05276879</an>
  <augroup>
    <au>Al-Mefleh, Haithem</au>
    <au>Chang, J.Morris</au>
  </augroup>
  <ti>High performance distributed coordination function for wireless lans.</ti>
  <so>Das, Amitabha (ed.) et al., NETWORKING 2008 ad hoc and sensor networks, wireless networks, next generation internet. 7th international IFIP-TC6 networking conference Singapore, May 5--9, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79548-3/pbk). Lecture Notes in Computer Science 4982, 812-823 (2008).</so>
  <py>2008</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-540-79549-0_71</li>
  </ligroup>
  <abgroup>
    <ab>Summary: The performance of DCF, the basic MAC scheme in IEEE 802.11, degrades under larger network sizes, and higher loads due to higher contention and so more idle slots and higher collision rates. We propose a new high-performance DCF (HDCF) protocol that achieves a higher and more stable performance while providing fair access among all users. In HDCF, the transmitting stations randomly select the next transmitter and so active stations do not contend for the channel, and an interrupt scheme is used by newly transmitting stations without contending with the existing active stations. Thus, HDCF achieves collision avoidance and fairness without idle slots added by the backoff algorithm used in DCF. For evaluation, we provide Opnet simulation that considers saturated and non-saturated stations. Results show that HDCF outperforms DCF in terms of throughput, and long-term and short-term fairness with gains up to 391.2\% of normalized throughput and 26.8\% of fairness index.</ab>
    <rv></rv>
  </abgroup>
</item>