Supporting cooperative caching in mobile ad hoc networks using clusters Online publication date: Wed, 06-Dec-2006
by Narottam Chand, R.C. Joshi, Manoj Misra
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 2, No. 1/2, 2007
Abstract: A novel scheme, called Cluster Cooperative (CC), for caching in mobile ad hoc networks is presented. In CC, the network topology is partitioned into non-overlapping clusters based on the physical network proximity. In each cluster, a 'super' node called Cache State Node (CSN) is chosen to maintain the Cluster Cache State (CCS). For a data miss in the local cache, each client searches the data with its CSN before the request is forwarded to the next client that lies along routing path towards source. Simulation experiments show that CC achieves significant improvements in comparison with other caching strategies.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com