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
Sistem pengkomputeran mudah alih ialah satu set fungsi pada persekitaran teragih yang dianjurkan untuk menyokong hos mudah alih. Dalam persekitaran ini, hos mudah alih sepatutnya boleh bergerak tanpa sebarang kekangan dan harus kekal bersambung ke rangkaian walaupun semasa bergerak. Selain itu, mereka seharusnya boleh mendapatkan maklumat yang diperlukan tanpa mengira lokasi dan masa semasa mereka. Kaedah pengecualian bersama yang diedarkan untuk menyokong algoritma yang diedarkan telah direka bentuk untuk rangkaian hanya dengan hos statik. Walau bagaimanapun, dengan kemunculan persekitaran pengkomputeran mudah alih, kaedah pengecualian bersama teragih baharu perlu dibangunkan untuk menyepadukan hos mudah alih dengan sistem teragih asas. Dalam erti kata, banyak isu yang harus dipertimbangkan berpunca daripada tiga sifat penting sistem pengkomputeran mudah alih seperti komunikasi tanpa wayar, mudah alih dan mobiliti. Setakat ini, kaedah pengecualian bersama yang diedarkan untuk persekitaran pengkomputeran mudah alih telah direka bentuk berdasarkan struktur cincin token, yang mempunyai kelemahan yang memerlukan kos yang tinggi untuk mencari hos mudah alih. Dalam makalah ini, kami mencadangkan bukan sahaja kaedah pengecualian bersama yang diedarkan yang boleh mengurangkan kos tersebut dengan menstrukturkan keseluruhan sistem sebagai struktur logik berasaskan pokok tetapi juga skema pemulihan yang boleh digunakan apabila kegagalan nod berlaku. Akhir sekali, kami menilai kos operasi untuk skim pengecualian bersama dan skim pemulihan.
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
Hyun Ho KIM, Sang Joon AHN, Tai Myoung CHUNG, Young Ik EOM, "Enhanced Mutual Exclusion Algorithm for Mobile Computing Environments" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 2, pp. 350-361, February 2002, doi: .
Abstract: The mobile computing system is a set of functions on a distributed environment organized to support mobile hosts. In this environment, mobile hosts should be able to move without any constraints and should remain connected to the network even while moving. Also, they should be able to get necessary information regardless of their current location and time. Distributed mutual exclusion methods for supporting distributed algorithms have hitherto been designed for networks only with static hosts. However, with the emergence of mobile computing environments, a new distributed mutual exclusion method needs to be developed for integrating mobile hosts with underlying distributed systems. In the sense, many issues that should be considered stem from three essential properties of mobile computing system such as wireless communication, portability, and mobility. Thus far, distributed mutual exclusion methods for mobile computing environments were designed based on a token ring structure, which has the drawback of requiring high costs in order to locate mobile hosts. In this paper, we propose not only a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a tree-based logical structure but also recovery schemes that can be applied when a node failure occurs. Finally, we evaluate the operation costs for the mutual exclusion scheme and the recovery scheme.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_2_350/_p
Salinan
@ARTICLE{e85-d_2_350,
author={Hyun Ho KIM, Sang Joon AHN, Tai Myoung CHUNG, Young Ik EOM, },
journal={IEICE TRANSACTIONS on Information},
title={Enhanced Mutual Exclusion Algorithm for Mobile Computing Environments},
year={2002},
volume={E85-D},
number={2},
pages={350-361},
abstract={The mobile computing system is a set of functions on a distributed environment organized to support mobile hosts. In this environment, mobile hosts should be able to move without any constraints and should remain connected to the network even while moving. Also, they should be able to get necessary information regardless of their current location and time. Distributed mutual exclusion methods for supporting distributed algorithms have hitherto been designed for networks only with static hosts. However, with the emergence of mobile computing environments, a new distributed mutual exclusion method needs to be developed for integrating mobile hosts with underlying distributed systems. In the sense, many issues that should be considered stem from three essential properties of mobile computing system such as wireless communication, portability, and mobility. Thus far, distributed mutual exclusion methods for mobile computing environments were designed based on a token ring structure, which has the drawback of requiring high costs in order to locate mobile hosts. In this paper, we propose not only a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a tree-based logical structure but also recovery schemes that can be applied when a node failure occurs. Finally, we evaluate the operation costs for the mutual exclusion scheme and the recovery scheme.},
keywords={},
doi={},
ISSN={},
month={February},}
Salinan
TY - JOUR
TI - Enhanced Mutual Exclusion Algorithm for Mobile Computing Environments
T2 - IEICE TRANSACTIONS on Information
SP - 350
EP - 361
AU - Hyun Ho KIM
AU - Sang Joon AHN
AU - Tai Myoung CHUNG
AU - Young Ik EOM
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2002
AB - The mobile computing system is a set of functions on a distributed environment organized to support mobile hosts. In this environment, mobile hosts should be able to move without any constraints and should remain connected to the network even while moving. Also, they should be able to get necessary information regardless of their current location and time. Distributed mutual exclusion methods for supporting distributed algorithms have hitherto been designed for networks only with static hosts. However, with the emergence of mobile computing environments, a new distributed mutual exclusion method needs to be developed for integrating mobile hosts with underlying distributed systems. In the sense, many issues that should be considered stem from three essential properties of mobile computing system such as wireless communication, portability, and mobility. Thus far, distributed mutual exclusion methods for mobile computing environments were designed based on a token ring structure, which has the drawback of requiring high costs in order to locate mobile hosts. In this paper, we propose not only a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a tree-based logical structure but also recovery schemes that can be applied when a node failure occurs. Finally, we evaluate the operation costs for the mutual exclusion scheme and the recovery scheme.
ER -