Handling Selfishness in Replica Allocation over a Mobile Ad-Hoc Network

Main Article Content

Laxmi R. Shinde
Trupti A. Jadhav
Prajakta R. Baviskar

Abstract

MANET is a collection of mobile devices that can communicate with each other without the use centralized administration. One of the interesting application of MANET is File Sharing. File Sharing in MANET is similar to that of the regular file sharing, what makes the difference is it allow user to access the data or memory of that nodes only which are connected to it. This File sharing many a times leads to Network Partitioning, i.e dividing a network into two different networks .Due to which the nodes may act selfishly. The selfishness of some of the nodes may lead in reduction of performance in terms of accessing data. The proposed system will use the SCF-tree technique for building a tree of Node which will share their data in terms of Replica, and as a result it detects the selfish node in the network. The replica insures that performance is not degraded.

Article Details

How to Cite
[1]
Laxmi R. Shinde, Trupti A. Jadhav, and Prajakta R. Baviskar, “Handling Selfishness in Replica Allocation over a Mobile Ad-Hoc Network”, Int. J. Comput. Eng. Res. Trends, vol. 3, no. 4, pp. 165–168, Apr. 2016.
Section
Research Articles

References

Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network Jae-Ho Choi, Kyu-Sun Shim, SangKeun Lee, and Kun-Lung Wu, Fellow, IEEE VOL. 11, NO. 2, FEBRUARY 2012

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.

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.

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.

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.

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.

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.

D. Hales, “From Selfish Nodes to Cooperative Networks -Emergent Link-Based Incentives in Peer-to-Peer Network Proc.IEEE Int’l Conf. Peer-to-Peer Computing, pp. 151-158, 2004.

T. Hara, “Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility,” Proc. IEEE INFOCOM, pp.1568- 1576, 2001.

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.

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.

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.

S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad hoc Networks,” Proc. ACM MobiCom, pp. 255-265, 2000.

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.