The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
컷오프 및 임계값 우선순위 정책 하에서 본질적으로 조합적인 우선순위 채널 할당 문제를 수학적으로 공식화합니다. 그런 다음 패턴 개념을 사용하여 해당 문제를 줄이고 감소된 문제에 시뮬레이션 어닐링 접근 방식을 적용합니다. 전산 실험을 통해 우리의 방법이 매우 잘 작동하고 컷오프 우선순위 정책이 우선순위가 지정되지 않은 완전 공유 정책 및 임계 우선순위 정책보다 성능이 우수하다는 것을 보여줍니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kun-Nyeong CHANG, Dongwoo KIM, "Comparison of Prioritized Channel Allocation Policies in Cellular Radio Networks" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 1, pp. 348-351, January 2002, doi: .
Abstract: Under cutoff and threshold priority policies, we mathematically formulate a prioritized channel allocation problem which is combinatorial in nature. We then reduce that problem using the concept of pattern, and apply a simulated annealing approach to the reduced problem. Computational experiments show that our method works very well and the cutoff priority policy outperforms the non-prioritized complete sharing policy and the threshold priority policy.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_1_348/_p
부
@ARTICLE{e85-b_1_348,
author={Kun-Nyeong CHANG, Dongwoo KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Comparison of Prioritized Channel Allocation Policies in Cellular Radio Networks},
year={2002},
volume={E85-B},
number={1},
pages={348-351},
abstract={Under cutoff and threshold priority policies, we mathematically formulate a prioritized channel allocation problem which is combinatorial in nature. We then reduce that problem using the concept of pattern, and apply a simulated annealing approach to the reduced problem. Computational experiments show that our method works very well and the cutoff priority policy outperforms the non-prioritized complete sharing policy and the threshold priority policy.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - Comparison of Prioritized Channel Allocation Policies in Cellular Radio Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 348
EP - 351
AU - Kun-Nyeong CHANG
AU - Dongwoo KIM
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2002
AB - Under cutoff and threshold priority policies, we mathematically formulate a prioritized channel allocation problem which is combinatorial in nature. We then reduce that problem using the concept of pattern, and apply a simulated annealing approach to the reduced problem. Computational experiments show that our method works very well and the cutoff priority policy outperforms the non-prioritized complete sharing policy and the threshold priority policy.
ER -