An Incentive Mechanism for Cooperative Data Replication in MANETs - A Game Theoretical Approach

Alireza Tajalli, Seyed-Amin Hosseini-Seno, Mohamed Shenify, Rahmat Budiarto

Abstract


Wireless ad hoc networks have seen a great deal of attention in the past years, especially in cases where no infrastructure is available. The main goal in these networks is to provide good data accessibility for participants. Because of the wireless nodes’ continuous movement, network partitioning occurs very often. In order to subside the negative effects of this partitioning and improve data accessibility and reliability, data is replicated in nodes other than the original owner of data. This duplication costs in terms of nodes’ storage space and energy. Hence, autonomous nodes may behave selfishly in this cooperative process and do not replicate data. This kind of phenomenon is referred to as a strategic situation and is best modeled and analyzed using the game theory concept. In order to address this problem we propose a game theory data replication scheme by using the repeated game concept and prove that it is in the nodes’ best interest to cooperate fully in the replication process if our mechanism is used.

Keywords


MANETs; game theory; repeated games; data replication

References


Hara, T. and S.K. Madria, Data replication for improving data accessibility in ad hoc networks. Mobile Computing, IEEE Transactions on, 2006. 5(11): p. 1515-1532.

Hirsch, D. and S. Madria, Data Replication in Cooperative Mobile Ad-Hoc Networks. Mobile Networks and Applications, 2013. 18(2): p. 237-252.

Nisan, N., Algorithmic game theory. 2007: Cambridge University Press.

Osborne, M.J., An introduction to game theory. Vol. 3. 2004: Oxford University Press New York.

Chun, B.-G., et al. Selfish caching in distributed systems: a game-theoretic analysis. inProceedings of the twenty-third annual ACM symposium on Principles of distributed computing. 2004. ACM.

Khan, S.U., et al. A game theoretical data replication technique for mobile ad hoc networks. inParallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on. 2008. IEEE.

Pandana, C., Z. Han, and K.R. Liu, Cooperation enforcement and learning for optimizing packet forwarding in autonomous wireless networks. Wireless Communications, IEEE Transactions on, 2008. 7(8): p. 3150-3163.

Zayani, M.-H. and D. Zeghlache. Cooperation enforcement for packet forwarding optimization in multi-hop ad-hoc networks. inWireless Communications and Networking Conference (WCNC) , 2102 IEEE. 2012. IEEE.

Chand, N., R.C. Joshi, and M. Misra. Efficient cooperative caching in ad hoc networks. inCommunication System Software and Middleware, 2006. Comsware 2006. First International Conference on. 2006. IEEE.

Ting, Y.-W. and Y.-K .Chang. A novel cooperative caching scheme for wireless ad hoc networks: Groupcaching. inNetworking, Architecture, and Storage, 2007. NAS 2007. International Conference on. 2007. IEEE.

Hirsch, D. and S. Madria. A resource-efficient adaptive caching scheme for mobile ad hoc networks. In Reliable Distributed Systems, 2010 29th IEEE Symposium on. 2010. IEEE.

Shinohara, M., T. Hara, and S. Nishio. Data replication considering power consumption in ad hoc networks. In Mobile Data Management, 2007 International Conference on. 2007. IEEE.

Yin, L. and G. Cao, Supporting cooperative caching in ad hoc networks. Mobile Computing, IEEE Transactions on, 2006. 5(1): p. 77-89.

Yoo, Y. and D.P. Agrawal, Why does it pay to be selfish in a MANET? WirelessCommunications, IEEE, 2006. 13(6): p. 87-97.

Anderegg, L. and S. Eidenbenz. Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. inProceedings of the 9th annual international conference on Mobilecomputing and networking. 2003. ACM.

Chen, Y. and B. Tang. Data Caching in Ad Hoc Networks Using Game-Theoretic Analysis. inSensor Networks,

Ubiquitous, and Trustworthy Computing (SUTC), 2010 IEEE International Conference on. 2010. IEEE.

Choi, J . -H., et al., Handling selfishness in replica allocation over a mobile ad hoc network. Mobile Computing, IEEE Transactions on, 2012. 11(2): p. 278-291.

Ryu, B.-G., J.-H. Choi, and S. Lee, Impact of Node Distance on Selfish Replica Allocation in a Mobile Ad-hoc Network. Ad Hoc Networks, 2013.

Charilas, D.E. and A.D. Panagopoulos, A survey on game theory applications in wireless networks. Computer Networks, 2010. 54(18): p. 3421-3430.

Han, Z., et al., Game theory in wireless and communication networks. 2012: Cambridge University Press.

Srivastava, V., et al., Using game theory to analyze wireless ad hoc networks. IEEE Communications Surveys and Tutorials, 2005. 7(1-4): p. 46-56.

2Chauhan, N., et al. A cooperative caching strategy in mobilead hoc networks based on clusters. inProceedings of the 2011 International Conference on Communication, Computing & Security. 2011. ACM.


Full Text: PDF

Refbacks

  • There are currently no refbacks.