Jaya Krishna Katti et al. Int. Journal of Engineering Research and Applications www.ijera.com Vol. 3, Issue 5, Sep-Oct 2013, pp.473-477 www.ijera.com 473 | Page Casting Selfish Nodes Into Non Selfish In Replica Allocation Over Mobile Ad Hoc Network Jaya Krishna Katti*, Venkata Naga Sudheer** *(M.Tech Final Year student, Department of CSE, QIS College of Engineering and Technology, Ongole) ** (Asst. Professor, Department of C.S.E, QIS College of Engineering and Technology, Ongole) ABSTARCT The nodes in Mobile Ad Hoc Network are resource constrained. This drawback and mobility nature of nodes can cause network partitioning and degradation of performance. Traditionally replica allocation techniques were used to overcome the drawback of performance degradation. It is assumed that all nodes in MANET share their memory resources fully. However, in reality the nodes may behave selfishly instead of cooperating in communication process. The selfishness exhibited by some of the nodes may lead to reduced quality of data accessibility over network. Recently Choi et al. studied the impact of selfish nodes from replication allocation perspective. Their solution is named “Selfish Replica Allocation”. They proposed a novel replica allocation and selfish node detection. In this paper we implemented those mechanisms for casting selfish nodes in non selfish from the perspective of replica allocation. We built a custom Java simulator to demonstrate the proof of concept. The empirical results reveal that the approach shows higher performance when compared with existing techniques in terms of communication cost, data accessibility and average query delay. Index Terms – Mobile ad hoc networks, selfish node, selfish replica allocation I. INTRODUCTION Due to the advent of innovative technologies in mobile devices, their usage has become ubiquitous. MANET (Mobile Ad Hoc Network) is a network of mobile nodes which are automatically configured without a fixed infrastructure. The existing technologies in the domain of mobile computing have paved the way for creation of MANETs [1], [2], [3]. MANETs are automatically established and they have real utility in real time applications [4] such as battle fields, natural disasters and so on. Therefore in emergency situations MANETs are suitable to address communication problems. Peer-to-peer mobile overlay is another interesting MANET that can be used for file sharing and searching [5], [6]. Network partitions are caused by node mobility as they move from one place to another place. Thus data present in a mobile node can become inaccessible. The data accessibility measure is used to know the level of data accessibility in MANETs [7]. To overcome the data inaccessibility problem due to node mobility, the data can be replicated in many nodes [1], [7], [8]. By making replicas, the node scan provides requested data in cooperative fashion. However, in reality nodes may behave selfishly to get rid of resource consumption or any other reason. Many replica allocation techniques came into existence. Recently Choi et al. [20] presented a selfish replica allocation model which is presented in fig. 1. Fig. 1 – Selfish replica allocation As can be seen in fig. 1, many nodes are interconnected to form MANET through wireless media. There is some replication allocation scheme named DCG as explored in [7]. Wireless links are represented by straight lines between nodes. Rectangle with an item in gray color indicates original data; white boxes represent replication allocations. The table1 shows access frequencies of data. Table 1 – Access frequencies of nodes RESEARCH ARTICLE OPEN ACCESS