Adaptive Beacon Scheduling Algorithm to Reduce End-to-End Delay in Cluster-tree based LR-WPAN 


Vol. 34,  No. 3, pp. 255-263, Mar.  2009


PDF
  Abstract

In this paper, we propose an adaptive beacon scheduling algorithm to control a reception period of actual data according to variation of amount of traffic in IEEE 802.15.4 LR-WPAN(Low Rate-Wireless Personal Area Network) with the cluster-tree topology. If a beacon interval is shortened, the amount of the traffic a node receives can be increased while consumption of the energy can be also increased. In this sense, we can achieve optimal energy consumption by controlling the beacon interval when the amount of data to be received is being decreased. The result of simulation using NS-2 shows that the proposed algorithm improves performances in terms of packet loss rate and end-to-end delay compared with algorithm using a fixed beacon interval. For a design of cluster-tree based LR-WPAN managing delay-sensitive services, the proposed algorithm and the associated results can be applied usefully.

  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. Kang, H. Park, J. Lee, "Adaptive Beacon Scheduling Algorithm to Reduce End-to-End Delay in Cluster-tree based LR-WPAN," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 3, pp. 255-263, 2009. DOI: .

[ACM Style]

Jae-Eun Kang, Hak-Rae Park, and Jong-Kyu Lee. 2009. Adaptive Beacon Scheduling Algorithm to Reduce End-to-End Delay in Cluster-tree based LR-WPAN. The Journal of Korean Institute of Communications and Information Sciences, 34, 3, (2009), 255-263. DOI: .

[KICS Style]

Jae-Eun Kang, Hak-Rae Park, Jong-Kyu Lee, "Adaptive Beacon Scheduling Algorithm to Reduce End-to-End Delay in Cluster-tree based LR-WPAN," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 3, pp. 255-263, 3. 2009.