Download now Free registration required
Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem's theoretical root in classic facility location problem and k-median problem, most of the research assumes, the data items are initially outside of the network, and the caching cost is either a constant or not considered. This paper studies a general data caching model in which the data item is initially in the network, and both caching and access cost are distance-dependent in multi-hop ad hoc networks.
- Format: PDF
- Size: 150.57 KB