서지주요정보
멀티 홉 무선 애드혹 네트워크에서의 이웃 캐싱 = Neighbor caching in multi-hop wireless Ad hoc networks
서명 / 저자 멀티 홉 무선 애드혹 네트워크에서의 이웃 캐싱 = Neighbor caching in multi-hop wireless Ad hoc networks / 조준호.
발행사항 [대전 : 한국과학기술원, 2003].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8014227

소장위치/청구기호

학술문화관(문화관) 보존서고

MCS 03040

휴대폰 전송

도서상태

이용가능

대출가능

반납예정일

리뷰정보

초록정보

The overhead of multi-hop wireless communication reduces the performance of applications that access distributed data in ad hoc networks. We propose neighbor caching strategy to overcome this shortcoming. Neighbor caching make a node possible to expand its caching storage instantaneously by storing its data in the storage of idle neighbors. So if the data source is far away from the node, we reduce the data access overhead by neighbor caching. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time. Therefore the ranking based prediction improves the throughput of neighbor caching. We compare neighbor caching with self caching that nodes store data in theirs own cache individually. In the results of simulation, neighbor caching make performance better as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts frequency of neighbor caching, and it makes neighbor caching flexible according to the idleness of nodes.

서지기타정보

서지기타정보
청구기호 {MCS 03040
형태사항 iii, 38 p. : 삽도 ; 26 cm
언어 한국어
일반주기 저자명의 영문표기 : Joon-Ho Cho
지도교수의 한글표기 : 이준원
지도교수의 영문표기 : Joon-Won Lee
학위논문 학위논문(석사) - 한국과학기술원 : 전산학전공,
서지주기 참고문헌 : p. 35-37
주제 neighbor caching
ad hoc network
data caching
client cache
distributed computing
이웃 캐싱
애드혹 네트워크
데이터 캐싱
클라이언트 캐쉬
분산 컴퓨팅
QR CODE qr code