A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
عنوان مقاله: A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
شناسه ملی مقاله: JR_IJE-17-7_005
منتشر شده در Volume ۱۷, Issue ۲, TRANSACTIONS B: Applications در سال 1383
شناسه ملی مقاله: JR_IJE-17-7_005
منتشر شده در Volume ۱۷, Issue ۲, TRANSACTIONS B: Applications در سال 1383
مشخصات نویسندگان مقاله:
M.R. Meybodi - Computer Engineering & Information Technology Depa, Amirkabir University of Technology
Hamid Beigy - Computer Engineering, Sharif University of Technology
خلاصه مقاله:
M.R. Meybodi - Computer Engineering & Information Technology Depa, Amirkabir University of Technology
Hamid Beigy - Computer Engineering, Sharif University of Technology
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes the number of channels subject to hard constraints on the blocking and dropping probabilities of calls. Finally, we propose an optimal prioritized channel assignment for multi-cells cellular networks with two classes of voice users.
کلمات کلیدی: Call Admission Control, Guard Channels, Two, Threshold Guard Channels, Wireless Networks
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1415995/