A Hidden-Node-Aware Grouping Algorithm for Improving Throughput of IEEE 802.15.4 


Vol. 36,  No. 8, pp. 702-711, Aug.  2011


PDF
  Abstract

This paper proposes a HAG(Hidden-Node-Aware Grouping) algorithm for IEEE 802.15.4 networks to enhance the performance by eliminating collisions resulted from the hidden node problem without adopting the RTS/CTS packet exchanges. To solve the hidden node problem, the HAG algorithm organizes nodes into disjoint transmission groups by dynamically allocating hidden nodes into separate groups which take turns in a round robin way for their transmission. For dynamic group adjustment, it periodically evaluates the presence of hidden nodes based on subordinate nodes’ receipt reports. To accurately measure its behavior, this paper also builds an analytical model to estimate its throughput fluctuation over various network topologies. The mathematical model along with simulation results confirmed that the HAG technique gracefully degraded the throughput of IEEE 802.15.4 networks whereas the standard IEEE 802.15.4 networks suffer severe throughput fallout as hidden nodes become populated.

  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]

J. Um, J. Ahn, K. Lee, "A Hidden-Node-Aware Grouping Algorithm for Improving Throughput of IEEE 802.15.4," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 8, pp. 702-711, 2011. DOI: .

[ACM Style]

Jin-Yeong Um, Jong-Suk Ahn, and Kang-Woo Lee. 2011. A Hidden-Node-Aware Grouping Algorithm for Improving Throughput of IEEE 802.15.4. The Journal of Korean Institute of Communications and Information Sciences, 36, 8, (2011), 702-711. DOI: .

[KICS Style]

Jin-Yeong Um, Jong-Suk Ahn, Kang-Woo Lee, "A Hidden-Node-Aware Grouping Algorithm for Improving Throughput of IEEE 802.15.4," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 8, pp. 702-711, 8. 2011.