We present a numerical analysis of the optimal number of groups for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply the M/D/1 queueing model to paging message queues of cells. We also compute the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints.
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
Goo-Yeon LEE, Yong LEE, "Optimal Group Number for Minimizing Average Paging Delay" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 2, pp. 601-604, February 2006, doi: 10.1093/ietcom/e89-b.2.601.
Abstract: We present a numerical analysis of the optimal number of groups for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply the M/D/1 queueing model to paging message queues of cells. We also compute the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.2.601/_p
Copy
@ARTICLE{e89-b_2_601,
author={Goo-Yeon LEE, Yong LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimal Group Number for Minimizing Average Paging Delay},
year={2006},
volume={E89-B},
number={2},
pages={601-604},
abstract={We present a numerical analysis of the optimal number of groups for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply the M/D/1 queueing model to paging message queues of cells. We also compute the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints.},
keywords={},
doi={10.1093/ietcom/e89-b.2.601},
ISSN={1745-1345},
month={February},}
Copy
TY - JOUR
TI - Optimal Group Number for Minimizing Average Paging Delay
T2 - IEICE TRANSACTIONS on Communications
SP - 601
EP - 604
AU - Goo-Yeon LEE
AU - Yong LEE
PY - 2006
DO - 10.1093/ietcom/e89-b.2.601
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2006
AB - We present a numerical analysis of the optimal number of groups for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply the M/D/1 queueing model to paging message queues of cells. We also compute the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints.
ER -