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.
Original language | English |
---|---|
Pages (from-to) | 208-217 |
Number of pages | 10 |
Journal | Lecture Notes in Computer Science |
Volume | 3619 |
Publication status | Published - 19 Oct 2005 |
Externally published | Yes |
Event | Third International Conference on Computer Network and Mobile Computing, ICCNMC 2005 - Zhangjiajie, China Duration: 2 Aug 2005 → 4 Aug 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science