Performance Evaluation of Modified Tree Algorithm for Supporting Traffic with Different Priority Requirements

Main Article Content

Warakorn Srichavengsup
Kanticha Kittipeerachon

Abstract

In this paper, we are introducing 3 new algorithms that take high-priority services into account for more delay-sensitive multimedia traffic, namely, CFS, DAP type 1 and DAP type 2 algorithms, an extension of Binary tree algorithm. The CFS algorithm can be derived from Binary tree algorithm by setting the access probability of the first slot for class 1 users equal to 1. DAP type 1 algorithm can be obtained from Binary tree algorithm by adjusting the access probability of the first slot for class 1 users to the desired value. DAP type 2 algorithm can be derived from either Binary tree and DAP type 1 algorithm by adjusting the access probability of the first slot for class 1 users and the access probability of the first slot for class 2 users to the desired values. The goal is to make each type of traffic compliant with QoS requirements. The simulation results show that DAP type 2 algorithm has more feasible QoS indexes than the CFS and DAP type 1 algorithms. So it is more efficient and flexible to adjust system parameters to meet QoS requirements than CFS and DAP type 1 algorithm. In addition, we can conclude that the access probability of the first slot for class 1 users and class 2 users are the important parameters that must be set properly. So that the system can control QoS and still maintain high delay performance.

Article Details

Section
Research Article

References

G. Auer, S. Videv, B. Ghimire, and H. Haas, “Contention free inter-cellular slot reservation,” IEEE Commun. Lett., vol. 13, no. 5, pp. 318–320, May 2009.

W. H. A. Yuen and W. S. Wong, “A contention-free mobility management scheme based on probabilistic paging,” IEEE Trans. Veh. Technol., vol. 50, no. 1, pp. 48–58, Jan. 2001.

Z. H. Wei, B. J. Hu, E. J. Xia, and S. H. Lu, “A contention-free reporting scheme based MAC protocol for cooperative spectrum sensing in cognitive radio networks,” IEEE Access, vol. 6, pp. 38851–38859, Jul. 2018.

Y. P. Fallah, F. Agharebparast, M. R. Minhas, H. M. Alnuweiri, and V. C. M. Leung, “Analytical modeling of contention-based bandwidth request mechanism in IEEE 802.16 wireless networks,” IEEE Trans. Veh. Technol., vol. 57, no. 5, pp. 3094–3107, Sep. 2008.

M. Rasheed, I. U. Din, M. Adnan, A. Tariq, S. Malik, and I. Syed, “ECM-MAC: An efficient collision mitigation strategy in contention based MAC protocol,” IEEE Access, vol. 9, pp. 62880–62889, Apr. 2021.

T. Zhang and Q. Zhu, “EVC-TDMA: An enhanced TDMA based cooperative MAC protocol for vehicular networks,” J. Commun. Netw., vol. 22, no. 4, pp. 316–325, Aug. 2020.

V. Sevani, B. Raman, and P. Joshi, “Implementation-based evaluation of a full-fledged multihop TDMA-MAC for WiFi mesh networks,” IEEE Trans. Mob. Comput., vol. 13, no. 2, pp. 392–406, Feb. 2014.

H. Nam, “Interpolation-based SC-FDMA transmitter with localized resource allocation,” IEEE Commun. Lett., vol. 14, no. 10, pp. 948–950, Oct. 2010.

Y. Liu, G. Y. Li, Z. Tan, and H. Hu, “Noise power estimation in SC-FDMA systems,” IEEE Wirel. Commun. Lett., vol. 4, no. 2, pp. 217–220, Apr. 2015.

B. Zhi, W. Sainan, and H. Yigang, “A novel anti-collision algorithm in RFID for internet of things,” IEEE Access, vol. 6, pp. 45860–45874, Aug. 2018.

Y. Cui and Y. Zhao, “Performance evaluation of a multi-branch tree algorithm in RFID,” IEEE Trans. Commun., vol. 58, no. 5, pp. 1356–1364, May 2010.