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
Penjejakan pengguna mudah alih dalam rangkaian wayarles selular melibatkan dua fungsi asas: kemas kini lokasi dan halaman. Kemas kini lokasi merujuk kepada proses menjejak lokasi pengguna mudah alih yang tiada dalam perbualan. Tiga algoritma asas telah dicadangkan dalam literatur, iaitu algoritma berasaskan jarak, berasaskan masa, dan berasaskan pergerakan. Masalah meminimumkan kemas kini lokasi dan kos halaman telah diselesaikan dalam literatur dengan mempertimbangkan Waktu Kediaman Sel (CRT) dan Masa Antara Panggilan (ICT) yang diedarkan secara eksponen, iaitu selang masa antara dua panggilan telefon berturut-turut. Dalam kertas kerja ini kami memilih skim berasaskan pergerakan kerana ia berkesan dan mudah dilaksanakan. Menggunakan teori proses pembaharuan tertunda, kami mendapati taburan bilangan lintasan sel apabila ICT ialah campuran pembolehubah rawak teragih secara eksponen dan CRT datang daripada sebarang taburan dengan transformasi Laplace. Khususnya, kami mempertimbangkan kes di mana CRT pertama mungkin mempunyai pengedaran yang berbeza daripada CRT yang selebihnya, yang termasuk kes sel bulat. Kami menyasarkan jumlah pengurangan kos dalam kes ini.
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.
Salinan
Ramon M. RODRIGUEZ-DAGNINO, Jorge J. RUIZ-CEDILLO, Hideaki TAKAGI, "Dynamic Mobility Management for Cellular Networks: A Delayed Renewal Process Approach" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 6, pp. 1069-1074, June 2002, doi: .
Abstract: Tracking mobile users in cellular wireless networks involves two basic functions: location update and paging. Location update refers to the process of tracking the location of mobile users that are not in conversation. Three basic algorithms have been proposed in the literature, namely the distance-based, time-based, and movement-based algorithms. The problem of minimizing the location update and paging costs has been solved in the literature by considering exponentially distributed Cell Residence Times (CRT) and Inter-Call Time (ICT), which is the time interval between two consecutive phone calls. In this paper we select the movement-based scheme since it is effective and easy to implement. Applying the theory of the delayed renewal process, we find the distribution of the number of cell crossings when the ICT is a mixture of exponentially distributed random variables and the CRT comes from any distribution with Laplace transform. In particular, we consider the case in which the first CRT may have a different distribution from the remaining CRT's, which includes the case of circular cells. We aim at the total cost minimization in this case.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_6_1069/_p
Salinan
@ARTICLE{e85-b_6_1069,
author={Ramon M. RODRIGUEZ-DAGNINO, Jorge J. RUIZ-CEDILLO, Hideaki TAKAGI, },
journal={IEICE TRANSACTIONS on Communications},
title={Dynamic Mobility Management for Cellular Networks: A Delayed Renewal Process Approach},
year={2002},
volume={E85-B},
number={6},
pages={1069-1074},
abstract={Tracking mobile users in cellular wireless networks involves two basic functions: location update and paging. Location update refers to the process of tracking the location of mobile users that are not in conversation. Three basic algorithms have been proposed in the literature, namely the distance-based, time-based, and movement-based algorithms. The problem of minimizing the location update and paging costs has been solved in the literature by considering exponentially distributed Cell Residence Times (CRT) and Inter-Call Time (ICT), which is the time interval between two consecutive phone calls. In this paper we select the movement-based scheme since it is effective and easy to implement. Applying the theory of the delayed renewal process, we find the distribution of the number of cell crossings when the ICT is a mixture of exponentially distributed random variables and the CRT comes from any distribution with Laplace transform. In particular, we consider the case in which the first CRT may have a different distribution from the remaining CRT's, which includes the case of circular cells. We aim at the total cost minimization in this case.},
keywords={},
doi={},
ISSN={},
month={June},}
Salinan
TY - JOUR
TI - Dynamic Mobility Management for Cellular Networks: A Delayed Renewal Process Approach
T2 - IEICE TRANSACTIONS on Communications
SP - 1069
EP - 1074
AU - Ramon M. RODRIGUEZ-DAGNINO
AU - Jorge J. RUIZ-CEDILLO
AU - Hideaki TAKAGI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2002
AB - Tracking mobile users in cellular wireless networks involves two basic functions: location update and paging. Location update refers to the process of tracking the location of mobile users that are not in conversation. Three basic algorithms have been proposed in the literature, namely the distance-based, time-based, and movement-based algorithms. The problem of minimizing the location update and paging costs has been solved in the literature by considering exponentially distributed Cell Residence Times (CRT) and Inter-Call Time (ICT), which is the time interval between two consecutive phone calls. In this paper we select the movement-based scheme since it is effective and easy to implement. Applying the theory of the delayed renewal process, we find the distribution of the number of cell crossings when the ICT is a mixture of exponentially distributed random variables and the CRT comes from any distribution with Laplace transform. In particular, we consider the case in which the first CRT may have a different distribution from the remaining CRT's, which includes the case of circular cells. We aim at the total cost minimization in this case.
ER -