A Performance Evaluation of CF-Poll Piggyback Algorithm for HCCA 


Vol. 31,  No. 9, pp. 785-791, Sep.  2006


PDF
  Abstract

A CF-Poll frame which contains the channel reservation time can be piggybacked in QoS-Data frame to increase the channel efficiency in HCCA. However, if any QSTA in the network uses the low physical transmission rate, the QoS-Data frame which includes the CF-Poll frame must be transmitted by the minimum transmission rate. Therefore, it can cause the decrease of the channel efficiency and the increase of the frame transmission delay for other traffic streams when any QSTA has the low physical transmission rate. In this paper, we define this phenomenon as the piggyback problem at the low physical transmission rate and evaluate the effect of this problem. In the simulation results, when a CF-Poll piggyback is used, the delay is increased about 25% if any QSTA has the low physical transmission rate, while the delay is decreased about 7.8% if all QSTA has the high physical transmission rate. We also found that the gain of the CF-Poll piggyback mechanism is achieved when all QSTA has higher physical transmission rate than 24 or 36Mbps.

  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. Lee, J. Kim, S. Cho, "A Performance Evaluation of CF-Poll Piggyback Algorithm for HCCA," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 9, pp. 785-791, 2006. DOI: .

[ACM Style]

Hyun-Jin Lee, Jae-Hyun Kim, and Sung-Hyun Cho. 2006. A Performance Evaluation of CF-Poll Piggyback Algorithm for HCCA. The Journal of Korean Institute of Communications and Information Sciences, 31, 9, (2006), 785-791. DOI: .

[KICS Style]

Hyun-Jin Lee, Jae-Hyun Kim, Sung-Hyun Cho, "A Performance Evaluation of CF-Poll Piggyback Algorithm for HCCA," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 9, pp. 785-791, 9. 2006.