Data caching in selfish MANETs

  • Authors:
  • Jian Zhai;Qing Li;Xiang Li

  • Affiliations:
  • Department of Computer Engineering and Information Technology, City University of Hong Kong, Kowloon, HKSAR, China;Department of Computer Engineering and Information Technology, City University of Hong Kong, Kowloon, HKSAR, China;Department of Computer Engineering and Information Technology, City University of Hong Kong, Kowloon, HKSAR, China

  • Venue:
  • ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

There are a lot of cooperative cache algorithms in Mobile Ad hoc Network (MANET) environment today. However, little attention was paid to the case that the mobile clients within a MANET are non-cooperative. These non-cooperative behaviors include selfish, faulty and malicious ones. In this paper, we focus on the selfish behavior and study it thoroughly. The essential of our cache algorithm within a selfish MANET is that service provider can be paid for its caching service. We adopt game theory in this paper and theoretically prove that the proposed cache algorithm within a selfish MANET can run into an equilibrium status after several steps. Some useful conclusions are drawn, and experiment results are given to show the validity and efficiency of our work.