메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색

초록· 키워드

오류제보하기
Resource sharing is a major advantage of distributed computing. However,a distributed computing system may have some physical or virtual resource that maybe accessible by a single process at a time. The mutual exclusion issue is to ensurethat no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes ouralgorithm message efficient and thus suitable for MANETs. In the interest of efficiency,we implemented a centralized token passing scheme at the intra-cluster level. Thecentralized schemes are inherently failure prone. Thus, we have presented an intracluster token passing scheme that is able to tolerate a failure. In order to enhancereliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent ofN, which is the total number of nodes in the system. Also, under a heavy load, it turnsout to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

목차

등록된 정보가 없습니다.

참고문헌 (16)

참고문헌 신청

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0