Efficient MAC Protocol for Achieving Fairness in Wireless Ad-hoc Networks under the DCF 


Vol. 29,  No. 8, pp. 928-936, Aug.  2004


PDF
  Abstract

This paper proposes simple and effective Contention Window (CW) adjusting algorithm to wive the fairness problem of the IEEE 802 11 under the Distributed Coordination Function (DCF) This adjusting algorithm can support variable packet length as well as both RTS/CTS access method and hidden nodes Simulation results "how that fairness problem can be very severe in the original MAC protocol of the wireless network In case of Implement out algorithm, fair sharing was enlarged prominently and the tairness sharing was improved about maximum 30%

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Lim and S. Park, "Efficient MAC Protocol for Achieving Fairness in Wireless Ad-hoc Networks under the DCF," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 8, pp. 928-936, 2004. DOI: .

[ACM Style]

Hee-Sun Lim and Sung-Kwon Park. 2004. Efficient MAC Protocol for Achieving Fairness in Wireless Ad-hoc Networks under the DCF. The Journal of Korean Institute of Communications and Information Sciences, 29, 8, (2004), 928-936. DOI: .

[KICS Style]

Hee-Sun Lim and Sung-Kwon Park, "Efficient MAC Protocol for Achieving Fairness in Wireless Ad-hoc Networks under the DCF," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 8, pp. 928-936, 8. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880