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.
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.
Copy
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
Copy
@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},}
Copy
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 -