International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com

Volume 3, Issue 2, March April 2014 ISSN 2278-6856


Volume 3, Issue 2 March April 2014 Page 121


Abstract: A MANET is a peer-to-peer multi hop mobile
wireless network that has neither fixed infrastructure nor a
central server. Every node in a MANET acts as a router, and
communicates with each other. Network partitions can
happen frequently, since nodes move freely in a MANET,
causing some of the data to be often inaccessible to some of
the nodes. Hence, data accessibility is an important
performance metric in a MANET. Data are replicated at
nodes, other than the actual owners, to increase data
accessibility to deal with frequent network partitions.
To minimize the inaccessibility and degradation in MANET,
all mobile nodes collaborate fully in terms of sharing their
memory space. However, if there is limited memory space and
and many of the nodes hold the same replica locally, then
some data items would get replaced and missing. This will
increase its own query delay. A node may act selfish, i.e., to
use its limited resource only for its own benefit, because each
node in a MANET has resource constraints, like battery and
storage limitations. A Selfish node may do not share its own
memory space to store replica for the benefit of other nodes.
We devise a selfish node detection method that can measure
the degree of selfishness. We view a selfish node in a MANET
from the perspective of data replication, and know that selfish
replica allocation can lead to degraded data accessibility in a
MANET. We propose a set of replica allocation techniques
that use the self centered friendship tree to reduce
communication cost, while achieving better data accessibility.
The experiment results verify efficacy of our proposed
strategy.

Keywords : MANET, Node selfishness, Replica, network
efficacy.

1. INTRODUCTION
Advances in wireless communication technologies have
been most discussed in recent times and MANET has
attracted attention due large variety of applications where
installing infrastructure may be difficult. A MANET is a
peer-to-peer multihop mobile wireless network that has
neither a fixed infrastructure nor a central server [1].
Each node in a MANET acts as a router, and
communicates with each other therefore it is also
challenged by network partitions causing some data
inaccessible to some of the nodes [2].

2.LITERATURE SURVEY
In existing system the MANET suffers from problems
such as, Selfish behavior can potentially lead to a wide
range of problems for a MANET. Existing system on
selfish behaviors in a MANET mostly focus on network
issues. For example, selfish nodes might not transmit data
to others to conserve their own batteries. Although
network issues are vital in a MANET, replica allocation
is also important, since the main goal of using a MANET
is to provide data services to users.
Existing system of the selfishness replica allocation are,
Static Access Frequency (SAF)
Dynamic Connectivity-based Grouping (DCG)
Dynamic Connectivity-based Grouping with detection
(DCG+)
In Static Access Frequency Each node allocates replica
based only on its own access frequency, without taking
into consideration or detecting selfish nodes [2]-[3]. In
Dynamic Connectivity-based Grouping the DCG creates
groups of nodes that are bi-connected components in a
network, without taking into consideration or detecting
selfish nodes. Dynamic connectivity-based Grouping [5]
with Detection method combines with proposed detection
method. Groups of nodes are created according to the
DCG methodology; therefore such system suffers and
results in disadvantages like:
Techniques have only limited memory space and many
nodes have same replica.
Data items cant be replaced and missed.
Allocation technique does not show the optimal
performance.
Cost of the performance is very high.
The overall data accessibility would be decreased.

In mobile ad hoc networks, nodes move freely and
link/node failures are common. This cause to frequent
network partitions, which may degrade the performance
of data access in ad hoc networks [6]-[7]. When the
network partition happens, mobile nodes in one network
are not able to access data hosted by nodes in other
networks. In this paper, we cope with this problem by
applying data replication techniques. Existing data
replication techniques in both wired and wireless
networks aim at either reducing the query delay or
improving the data accessibility [8]. As both metrics are
important for mobile nodes, our propose scheme take care
of balance the tradeoffs between data accessibility and
query delay under different system settings and
requirements. Simulation results depict that the proposed
Handling node self-centeredness in replica
allocation over MANET

1
Prof. Shobha Lolge,
2
Neha Baheti

1
Lecturer, Department of Computer Engineering,
Lokmanya Tilak College of Engineering, Koparkhairne,
Navi Mumbai, India

2
Lokmanya Tilak College of Engineering, Koparkhairne,
Navi Mumbai, India

International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 2, March April 2014 ISSN 2278-6856


Volume 3, Issue 2 March April 2014 Page 122


schemes can achieve a balance between these two metrics
and provide satisfying system performance.

3. METHODOLOGY
Presented novel approach measure the degree of
selfishness to appropriately handle the partially selfish
nodes. Motivated by this concept of partial selfishness,
this process borrows the notion of credit risk (CR) from
economics to detect selfish nodes. To avoid the replica
allocation, the process use the method of Self-Centered
Friendship tree (SCF-tree) and its variation (SCF-DS)
and (SCF-CN). SCF-tree based replica allocation
technique is to achieve good data accessibility with low
communication cost in the presence of selfish nodes.
Since proposed replica allocation technique appropriately
handles the (partially) selfish nodes, the method is
expected to achieve the aim. After building the SCF-tree,
a node allocates replica at every relocation period. Each
node asks the non-selfish nodes within its SCF-tree to
hold replica when it cannot hold replica in its local
memory space. Since the SCF-tree based replica
allocation is performed in a fully distributed manner,
every node determines replica allocation individually
without any communication with other nodes.
Proposed approach applied in following four steps
1. Detecting selfish node:
2. Update selfish node:
3. Building SCF tree:
4. Allocating replica:

3.1 DETECTING SELFISH NODE:
This algorithm describes how to detect selfish nodes. A
selfish node may share part of its own memory space, or a
small number of data items. The node-specific features
can be used to represent the expected value of a node.
3.2 UPDATE SELFISH NODE:
The query processing-specific feature, we use the ratio of
selfishness alarm which is the ratio of data request being
not served by the expected node due to selfishness in its
memory space. Query processing-specific feature can
represent the expected risk of a node. To effectively
identify the expected node should know the (expected)
status of other nodes memory space.
3.3 BUILDING SCF TREE:
The novel replica allocation techniques can allocate
replica without discussion with other nodes, like in a
human friendship management, traffic overhead will
decrease. Using SCF tree we can differentiate the selfish
nodes and partial selfish nodes.
3.4 ALLOCATING REPLICA:
First, set of ordered data items are allocated. The ID of
the data items is stored in descending order of access
frequency. Each node allocates replicas in descending
order of its own access frequency. Each node executes this
algorithm at every relocation period after building its own
SCF-tree. Initially, a node determines the priority for
allocating replicas. It is based on Breadth First Search
(BFS) order of the SCF-tree.
SYSTEM BLOCK DIAGRAM


4.CONCLUSIONS
The presented approach is advantageous as it minimize
the duplication of data items in a group to achieve high
data accessibility. Reduce the communication cost, and
still achieving good data accessibility. Process is used to
reduce query delay. Each node detects selfishness and
makes replica allocation at its own discretion, without
forming any group or making lengthy negotiations.

REFERENCES
[1] P. Padmanabhan, L. Gruenwald, A. Vallur, and M.
Atiquzzaman, A Survey of Data Replication
Techniques for Mobile Ad Hoc Network Databases,
The Intl J. Very Large Data Bases, vol. 17, no. 5,
pp. 1143-1164, 2008.
[2] 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.
[3] 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.
[4] D. Hales, From Selfish Nodes to Cooperative
Networks - Emergent Link-Based Incentives in Peer-
to-Peer Networks, Proc. IEEE Intl Conf. Peer-to-
Peer Computing, pp. 151-158, 2004
[5] 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
[6] P. Michiardi and R. Molva, Simulation-Based
Analysis of Security Exposures in Mobile Ad Hoc
Networks, Proc. European Wireless Conf., pp. 1-6,
2002.
[7] 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.
[8] L. Yin and G. Cao, Balancing the Tradeoffs
between Data Accessibility and Query Delay in Ad
Hoc Networks, Proc. IEEE Intl Symp. Reliable
Distributed Systems, pp. 289-298, 2.