This Article 
 Bibliographic References 
 Add to: 
Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network
February 2012 (vol. 11 no. 2)
pp. 278-291
Jae-Ho Choi, Korea University, Seoul
Kyu-Sun Shim, Korea University, Seoul
SangKeun Lee, Korea University, Seoul
Kun-Lung Wu, IBM T. J. Watson Research Center, Hawthorne
In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. We term this selfish replica allocation. In particular, we develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms traditional cooperative replica allocation techniques in terms of data accessibility, communication cost, and average query delay.

[1] E. Adar and B.A. Huberman, “Free Riding on Gnutella,” First Monday, vol. 5, no. 10, pp. 1-22, 2000.
[2] L. Anderegg and S. Eidenbenz, “Ad Hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents,” Proc. ACM MobiCom, pp. 245-259, 2003.
[3] K. Balakrishnan, J. Deng, and P.K. Varshney, “TWOACK: Preventing Selfishness in Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking, pp. 2137-2142, 2005.
[4] R.F. Baumeister and M.R. Leary, “The Need to Belong: Desire for Interpersonal Attachments as a Fundamental Human Motivation,” Psychological Bull., vol. 117, no. 3, pp. 497-529, 1995.
[5] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MobiCom, pp. 85-97, 1998.
[6] G. Cao, L. Yin, and C.R. Das, “Cooperative Cache-Based Data Access in Ad Hoc Networks,” Computer, vol. 37, no. 2, pp. 32-39, Feb. 2004.
[7] 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. ACM Symp. Principles of Distributed Computing, pp. 21-30, 2004.
[8] E. Damiani, S.D.C. di Vimercati, S. Paraboschi, and P. Samarati, “Managing and Sharing Servents' Reputations in P2P Systems,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 4, pp. 840-854, July/Aug. 2003.
[9] G. Ding and B. Bhargava, “Peer-to-Peer File-Sharing over Mobile Ad Hoc Networks,” Proc. IEEE Ann. Conf. Pervasive Computing and Comm. Workshops, pp. 104-108, 2004.
[10] M. Feldman and J. Chuang, “Overcoming Free-Riding Behavior in Peer-to-Peer Systems,” SIGecom Exchanges, vol. 5, no. 4, pp. 41-50, 2005.
[11] D. Hales, “From Selfish Nodes to Cooperative Networks - Emergent Link-Based Incentives in Peer-to-Peer Networks,” Proc. IEEE Int'l Conf. Peer-to-Peer Computing, pp. 151-158, 2004.
[12] T. Hara, “Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility,” Proc. IEEE INFOCOM, pp. 1568-1576, 2001.
[13] T. Hara and S.K. Madria, “Data Replication for Improving Data Accessibility in Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 11, pp. 1515-1532, Nov. 2006.
[14] T. Hara and S.K. Madria, “Consistency Management Strategies for Data Replication in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 8, no. 7, pp. 950-967, July 2009.
[15] S.U. Khan and I. Ahmad, “A Pure Nash Equilibrium-Based Game Theoretical Method for Data Replication across Multiple Servers,” IEEE Trans. Knowledge and Data Eng., vol. 21, no. 4, pp. 537-553, Apr. 2009.
[16] N. Laoutaris, G. Smaragdakis, A. Bestavros, I. Matta, and I. Stavrakakis, “Distributed Selfish Caching,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 10, pp. 1361-1376, Oct. 2007.
[17] N. Laoutaris, O. Telelis, V. Zissimopoulos, and I. Stavrakakis, “Distributed Selfish RepLication,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 12, pp. 1401-1413, Dec. 2006.
[18] H. Li and M. Singhal, “Trust Management in Distributed Systems,” Computer, vol. 40, no. 2, pp. 45-53, Feb. 2007.
[19] M. Li, W.-C. Lee, and A. Sivasubramaniam, “Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks,” Proc. World Wide Web (WWW) Workshop Emerging Applications for Wireless and Mobile Access, pp. 2-6, 2004.
[20] Y. Liu and Y. Yang, “Reputation Propagation and Agreement in Mobile Ad-Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf., pp. 1510-1515, 2003.
[21] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad hoc Networks,” Proc. ACM MobiCom, pp. 255-265, 2000.
[22] L.J. Mester, “What's the Point of Credit Scoring?” Business Rev., pp. 3-16, Sept. 1997.
[23] P. Michiardi and R. Molva, “Simulation-Based Analysis of Security Exposures in Mobile Ad Hoc Networks,” Proc. European Wireless Conf., pp. 1-6, 2002.
[24] H. Miranda and L. Rodrigues, “Friends and Foes: Preventing Selfishness in Open Mobile Ad hoc Networks,” Proc. IEEE Int'l Conf. Distributed Computing Systems Workshops, pp. 440-445, 2003.
[25] A. Mondal, S.K. Madria, and M. Kitsuregawa, “An Economic Incentive Model for Encouraging Peer Collaboration in Mobile-P2P Networks with Support for Constraint Queries,” Peer-to-Peer Networking and Applications, vol. 2, no. 3, pp. 230-251, 2009.
[26] M.J. Osborne, An Introduction to Game Theory. Oxford Univ., 2003.
[27] P. Padmanabhan, L. Gruenwald, A. Vallur, and M. Atiquzzaman, “A Survey of Data Replication Techniques for Mobile Ad Hoc Network Databases,” The Int'l J. Very Large Data Bases, vol. 17, no. 5, pp. 1143-1164, 2008.
[28] K. Paul and D. Westhoff, “Context Aware Detection of Selfish Nodes in DSR Based Ad-Hoc Networks,” Proc. IEEE Global Telecomm. Conf., pp. 178-182, 2002.
[29] V. Srinivasan, P. Nuggehalli, C. Chiasserini, and R. Rao, “Cooperation in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, pp. 808-817, 2003.
[30] W. Wang, X.-Y. Li, and Y. Wang, “Truthful Multicast Routing in Selfish Wireless Networks,” Proc. ACM MobiCom, pp. 245-259, 2004.
[31] S.-Y. Wu and Y.-T. Chang, “A User-Centered Approach to Active Replica Management in Mobile Environments,” IEEE Trans. Mobile Computing, vol. 5, no. 11, pp. 1606-1619, Nov. 2006.
[32] L. Yin and G. Cao, “Balancing the Tradeoffs between Data Accessibility and Query Delay in Ad Hoc Networks,” Proc. IEEE Int'l Symp. Reliable Distributed Systems, pp. 289-298, 2004.
[33] Y. Yoo and D.P. Agrawal, “Why Does It Pay to be Selfish in a MANET,” IEEE Wireless Comm., vol. 13, no. 6, pp. 87-97, Dec. 2006.
[34] J. Zhai, Q. Li, and X. Li, “Data Caching in Selfish Manets,” Proc. Int'l Conf. Computer Network and Mobile Computing, pp. 208-217, 2005.

Index Terms:
Mobile ad hoc networks, degree of selfishness, selfish replica allocation.
Jae-Ho Choi, Kyu-Sun Shim, SangKeun Lee, Kun-Lung Wu, "Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network," IEEE Transactions on Mobile Computing, vol. 11, no. 2, pp. 278-291, Feb. 2012, doi:10.1109/TMC.2011.57
Usage of this product signifies your acceptance of the Terms of Use.