This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Game Theoretic Approach to Power Aware Wireless Data Access
August 2006 (vol. 5 no. 8)
pp. 1057-1073
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.

[1] D. Barbará and T. Imieliński, “Sleepers and Workaholics: Caching Strategies in Mobile Environments,” Proc. 1994 SIGMOD Int'l Conf. Management of Data, pp. 1-12 May 1994
[2] Bluetooth Special Interest Group, “Bluetooth Specification,” http:/www.bluetooth.org, 2006.
[3] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. 18th Int'l Conf. Computer Comm., vol. 1, pp. 126-134, Mar. 1999.
[4] J. Cai and K.-L. Tan, “Energy-Efficient Selective Cache Invalidation,” Wireless Networks, vol. 5, no. 6, pp. 489-502, Dec. 1999.
[5] G. Cao, “A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments,” Proc. Sixth Ann. Int'l Conf. Mobile Computing and Networking, pp. 200-209, Aug. 2000.
[6] G. Cao, “Proactive Power-Aware Cache Management for Mobile Computing Systems,” IEEE Trans. Computers, vol. 51, no. 6, pp. 608-621, June 2002.
[7] G. Cao, “A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 5, pp. 1251-1265, Sept.-Oct. 2003.
[8] K. Chen and K. Nahrstedt, “iPass: an Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in MANET,” Proc. 24th Int'l Conf. Distributed Computing Systems, pp. 534-542, Mar. 2004.
[9] A. Chockalingam, M. Zorzi, L.B. Milstein, and P. Venkataram, “Performance of a Wireless Access Protocol on Correlated Rayleigh-Fading Channels with Capture,” IEEE Trans. Comm., vol. 46, no. 5, pp. 644-655, May 1998.
[10] B.-G. Chun, K. Chaudhuri, H. Wee, M. Barreno, C.H. Papadimitriou, and J. Kubiatowicz, “Selfish Caching in Distributed Systems: A Game-Theoretic Analysis,” Proc. 23rd ACM Symp. Principles of Distributed Computing, pp. 21-30, July 2004.
[11] A. Datta, D.E. VanderMeer, A. Celik, and V. Kumar, “Broadcast Protocols to Support Efficient Retrieval from Databases by Mobile Users,” ACM Trans. Database Systems, vol. 24, no. 1, pp. 1-79, Mar. 1999.
[12] Z. Fang and B. Bensaou, “Fair Bandwidth Sharing Algorithms Based on Game Theory Frameworks for Wireless Ad-Hoc Networks,” Proc. 23rd Int'l Conf. Computer Comm., vol. 2, pp. 1284-1295, Mar. 2004.
[13] L.M. Feeney and M. Nilsson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment,” Proc. 20th Int'l Conf. Computer Comm., vol. 3, pp. 1548-1557, Apr. 2001.
[14] D. Fudenberg and J. Tirole, Game Theory. MIT Press, Aug. 1991.
[15] V.K. Garg, Wireless Network Evolution: 2G to 3G. Prentice Hall, Aug. 2001.
[16] M.S. Gast, 802.11 Wireless Networks: The Definitive Guide. O'Reilly and Associates, Apr. 2002.
[17] M. Goemans, L.E. Li, V.S. Mirrokni, and M. Thottan, “Market Sharing Games Applied to Content Distribution in Ad-Hoc Networks,” Proc. Fifth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 55-66, May 2004.
[18] Q. Hu and D.L. Lee, “Adaptive Cache Invalidation Methods in Mobile Environments,” Proc. Sixth IEEE Int'l Symp. High Performance Distributed Computing, pp. 264-273, Aug. 1997.
[19] J. Jing, A. Elmagarmid, A.S. Helal, and R. Alonso, “Bit-Sequences: An Adaptive Cache Invalidation Method in Mobile Client/Server Environments,” Mobile Networks and Applications, vol. 2, no. 2, pp. 115-127, Oct. 1997.
[20] A. Keshavarzian, E. Uysal-Biyikoglu, F. Herrmann, and A. Manjeshwar, “Energy-Efficient Link Assessment in Wireless Sensor Networks,” Proc. 23rd Int'l Conf. Computer Comm., vol. 3, pp. 1751-1761, Mar. 2004.
[21] V.K. N. Lau, “Performance Analysis of Variable Rate: Symbol-By-Symbol Adaptive Bit Interleaved Coded Modulation for Rayleigh Fading Channels,” IEEE Trans. Vehicular Technology, vol. 51, no. 3, pp. 537-550 May 2002.
[22] S. Lim, W.-C. Lee, G. Cao, and C.R. Das, “A Novel Caching Scheme for Internet Based Mobile Ad Hoc Networks,” Proc. 12th Int'l Conf. Computer Comm. and Networks, pp. 38-43, Oct. 2003.
[23] M.J. Osborne and A. Rubinste, A Course in Game Theory. MIT Press, July 1994.
[24] J.D. Parsons, The Mobile Radio Propagation Channel, second ed. John Wiley and Sons, Nov. 2000.
[25] H. Schulzrinne, X. Wu, S. Sidiroglou, and S. Berger, “Ubiquitous Computing in Home Networks,” IEEE Comm. Magazine, vol. 41, no. 11, pp. 128-135, Nov. 2003.
[26] V. Shah, N.B. Mandayam, and D.J. Goodman, “Power Control for Wireless Data Based on Utility and Pricing,” Proc. Ninth Int'l Symp. Personal, Indoor and Mobile Radio Comm., vol. 3, pp. 1427-1432, Sept. 1998.
[27] V. Stanford, “Pervasive Computing Puts Food on the Table,” IEEE Pervasive Computing, vol. 2, no. 1, pp. 9-14, Jan.-Mar. 2003.
[28] K.-L. Tan, “Organization of Invalidation Reports for Energy-Efficient Cache Invalidation in Mobile Environments,” Mobile Networks and Applications, vol. 6, no. 3, pp. 279-290, June 2001.
[29] K.-L. Tian, J. Cai, and B.C. Ooi, “An Evaluation of Cache Invalidation Strategies in Wireless Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 8, pp. 789-807, Aug. 2001.
[30] K.-L. Wu, P.S. Yu, and M.-S. Chen, “Energy-Efficient Caching for Wireless Mobile Computing,” Proc. 12th Int'l Conf. Data Eng., pp. 336-343, Feb.-Mar. 1996.
[31] M.K.H. Yeung and Y.-K. Kwok, “Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic,” IEEE Trans. Mobile Computing, vol. 4, no. 1, pp. 68-83, Jan.-Feb. 2005.
[32] M.K.H. Yeung and Y.-K. Kwok, “New Invalidation Algorithms for Wireless Data Caching with Downlink Traffic and Link Adaptation,” Proc. 18th Int'l Parallel and Distributed Processing Symp., pp. 222-229, Apr. 2004.
[33] L. Yin and G. Cao, “Adaptive Power-Aware Prefetch in Wireless Networks,” IEEE Trans. Wireless Comm., vol. 3, no. 5, pp. 1648-1658, Sept. 2004.
[34] B. Zheng, J. Xu, and D.L. Lee, “Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1141-1153, Oct. 2002.
[35] M. Zorzi, R.R. Rao, and L.B. Milstein, “On the Accuracy of a First-Order Markov Model for Data Transmission on Fading Channels,” Proc. IEEE Int'l Conf. Universal Personal Comm., pp. 211-215, Nov. 1995.

Index Terms:
Wireless data access, game theory, caching, invalidation reports, wireless protocol design, simulations, utility.
Citation:
Mark Kai Ho Yeung, Yu-Kwong Kwok, "A Game Theoretic Approach to Power Aware Wireless Data Access," IEEE Transactions on Mobile Computing, vol. 5, no. 8, pp. 1057-1073, Aug. 2006, doi:10.1109/TMC.2006.107
Usage of this product signifies your acceptance of the Terms of Use.