Bit-sequences: an adaptive cache invalidation method in mobile client/server environments
Mobile Networks and Applications
Broadcast protocols to support efficient retrieval from databases by mobile users
ACM Transactions on Database Systems (TODS)
Energy-efficient selective cache invalidation
Wireless Networks
A scalable low-latency cache invalidation strategy for mobile environments
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Organization of invalidation reports for energy-efficient cache invalidation in mobile environments
Mobile Networks and Applications
An Evaluation of Cache Invalidation Strategies in Wireless Environments
IEEE Transactions on Parallel and Distributed Systems
Wireless Network Evolution: 2G to 3G
Wireless Network Evolution: 2G to 3G
Proactive Power-Aware Cache Management for Mobile Computing Systems
IEEE Transactions on Computers
802.11 Wireless Networks: The Definitive Guide
802.11 Wireless Networks: The Definitive Guide
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments
IEEE Transactions on Computers
Pervasive Computing Puts Food on the Table
IEEE Pervasive Computing
Adaptive Cache Invalidation Methods in Mobile Environments
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
iPass: An Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in MANET
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Market sharing games applied to content distribution in ad-hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
User-defined consistency sensitive cache invalidation strategies for wireless data access
Computer Communications
| Hi-index | 0.00 |
We consider a basic scenario in wireless data access: a number of mobile clients are interested in a set of data items kept at a common server. Each client independently sends requests to inform the server of its desired data items and the server replies with a broadcast channel. We are interested in studying the energy consumption characteristics in such a scenario. First, we define a utility function for quantifying performance. Based on the utility function, we formulate the wireless data access scenario as a noncooperative game—wireless data access (WDA) game. Although our proposed probabilistic data access scheme does not rely on client caching, game theoretical analysis shows that clients do not always need to send requests to the server. Simulation results also indicate that our proposed scheme, compared with a simple always-request one, increases the utility and lifetime of every client while reducing the number of requests sent, with a cost of slightly larger average query delay. We also compare the performance of our proposed scheme with two popular schemes that employ client caching. Our results show that caching-only benefits clients with high query rates at the expense of both shorter lifetime and smaller utility in other clients.