A distributed h-out of -k mutual exclusion algorithm for ad hoc mobile networks

研究成果: 書貢獻/報告類型會議論文篇章同行評審

7 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem for ad hoc mobile networks. The h-out of-k mutual exclusion problem is also known as the h-out of-k resource allocation problem. It concerns with how to control nodes in a distributed system so that each node can access h resources out of totally k shared resources, 1 ≤ h ≤ k, with the constraint that no more than k resources can be accessed concurrently. We have also proved the correctness of the proposed algorithm. The proposed algorithm is sensitive to link forming and link breaking and thus is suitable for ad hoc mobile networks.

原文???core.languages.en_GB???
主出版物標題Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
發行者Institute of Electrical and Electronics Engineers Inc.
頁面196
頁數1
ISBN(電子)0769515738, 9780769515731
DOIs
出版狀態已出版 - 2002
事件16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States
持續時間: 15 4月 200219 4月 2002

出版系列

名字Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???16th International Parallel and Distributed Processing Symposium, IPDPS 2002
國家/地區United States
城市Ft. Lauderdale
期間15/04/0219/04/02

指紋

深入研究「A distributed h-out of -k mutual exclusion algorithm for ad hoc mobile networks」主題。共同形成了獨特的指紋。

引用此