International Journal of IT, Engineering and Applied Sciences Research (IJIEASR) ISSN: 2319-4413 Volume 6, No. 5, May 2017

Impact Factor: 5.913 www.irjcjournals.org

1

A Review on P2P Contents Sharing in MANET

Vijay Kumar, Assistant Professor, Department of Computer Science, Central University of Haryana

Er. Bhupinder Kumar, Department of Computer Engineering, Guru Kashi University, Tawandi

Sabo Bathinda, Punjab

ABSTRACT

A distributed hash table (DHT) is a class of a

decentralized distributed system that provides a lookup

service similar to a hash table: (key, value) pairs are

stored in a DHT, and any participating node can

efficiently retrieve the value associated with a given key.

Responsibility for maintaining the mapping from keys to

values is distributed among the nodes, in such a way that a

change in the set of participants causes a minimal amount

of disruption. This allows a DHT to scale to extremely

large numbers of nodes and to handle continual node

arrivals, departures, and failures.

This P2P Contents Sharing in MANET handles the

contents being shared from one node to other node

efficiently. Because it will be comparatively easy to access

the route based on hash table. It is fast to update and

select the route from route table stored in the hash table.

For DHT services OLSR is better protocol uses flood free

route discovery for P2P Contents sharing.

Keywords

DHT, P2P, MANET.

INTRODUCTION

Peer-to-peer network is a distributed, robust and fault

tolerant network for sharing resources such as files, CPU,

memory, etc. In a P2P network, peers self-organize

themselves in a decentralized way, forming an overlay

network at application layer over the underlying physical

network. Thus, a link between two logically linked peers

in the overlay network may spans multi hops in the

physical network. An example of P2P overlay is shown in

Fig. 1 .

Fig. 1 Peer to Peer [1]

In a P2P network, a peer acts as both a server that provides

or shares its content with other users/peers; and a client,

that accesses the content from other users/peers. To access

a content/data item, the requesting peer invokes the lookup

phase to locate the source peer that provides the required

data item. In the lookup phase, a peer forwards the lookup

query to its neighboring peers according to the overlay

routing algorithm. Upon receiving the reply for the lookup

query, the requesting peer accesses the data item directly

from the source peer. To join a P2P network, the node

contacts an existing peer of the P2P network. This step is

called bootstrapping[1]. After finding the existing peer in

the P2P network, the node places itself in the P2P overlay

by establishing connection with other peers according to

the overlay routing algorithm. On the basis of overlay

structure, P2P networks can be roughly classified into

unstructured and structured architecture. Each of them has

its own applications and advantages.

In an unstructured P2P network, a peer establishes and

maintains connection with a certain number of other peers

chosen randomly, thus a random topology is established

among the peers. Each peer in the unstructured P2P

network holds its shared data items with itself; therefore,

each peer uses flooding mechanism for data discovery in

the P2P network.

International Journal of IT, Engineering and Applied Sciences Research (IJIEASR) ISSN: 2319-4413 Volume 6, No. 5, May 2017

Impact Factor: 5.913 www.irjcjournals.org

2

ROUTING PROTOCOLS FOR MANETS

Fig 2. Routing protocol [1]

P2P overlays over MANETs that works at the application

layer for content sharing rely on underlying (network

layer) routing protocol for data communication. Several

routing protocols have been proposed for MANET by

research community. These protocols can be classified

into different categories according to different criteria.

Each of them has its own applications and advantages. By

the manner in which they react to network topology, the

routing protocols can be segregate into reactive and

proactive routing protocols. Reactive routing protocols

find route on demand, i.e., they find the route to a

destination node when the data is to be sent to that

destination node. Reactive protocols have larger delivery

delay and are not efficient for higher traffic load [1] .

Proactive routing protocols periodically update routing

information to all nodes in the network regardless of

whether the data is to be sent or not [1] . Proactive routing

can have unnecessary route discovery producing more

extra traffic overhead. By the role of routing nodes and the

organization of the network, routing protocols of MANET

can be classified into flat protocols and

hierarchical/cluster-based routing protocols. In flat

routing, every node has the same role and the whole

network is considered as a single flat structure, e.g. AODV

[1] .

Flat routing protocols are suitable for small-size network

and their performance degrades as the size of network

grows. In cluster-based routing, the nodes are grouped into

clusters. Each cluster has one node as a cluster-head and

the inter-cluster communication is done through gateway

nodes. By grouping nodes into clusters, only selected

nodes forward the route discovery packets reducing

redundant traffic.

Cluster-based routing protocol scales well as the network’s

size grows. One example of cluster-based routing protocol

is CBRP [1]. Using the geographic positioning

information of nodes, the routing protocols for MANET

can be classified into geographic and non-geographic

routing. Geographic routing utilizes the geographic

location of the nodes through GPS, e.g., GPSR [1] or via

other schemes like in [1] .

The geographic location of nodes is used to confine the

route search space into a smaller estimated range reducing

routing overhead and scales better in terms of per-route

state. Based on using flooding, routing protocols can also

be classified as flooding-based and flooding-free category

[1] .

In flooding-based routing protocol, route is discovered or

maintained by flooding (i.e. broadcasting) the route

discovery message in the network, e.g.OLSR, AODV,

DSDV, ABR, DYMO, CBRP , etc. Flooding-free routing

protocols, are also referred as DHT-based routing,

implement a logical DHT based structure to connect nodes

with respect to their LIDs at the network layer for routing,

thus a logical network is built over the physical network to

eliminate flooding mechanism as described in [1] .

Both routing and forwarding of packets is carried out

based on nodes’ LIDs in the logical network rather than

International Journal of IT, Engineering and Applied Sciences Research (IJIEASR) ISSN: 2319-4413 Volume 6, No. 5, May 2017

Impact Factor: 5.913 www.irjcjournals.org

3

their UID (IP addresses/MAC address). Each node acts as

an anchor node and stores mapping information (LID,

UID) of other nodes in the network. A source node first

retrieves the mapping information of the destination node

from the destination node’s anchor and then sends the data

packet to one of its logical neighbors ( L nbr) having LID

closest to the destination node’s LID.

LITERATURE SURVEY

Nadir Shah (2016) et al: several approaches have been

proposed for Peer-to-peer (P2P) content/file sharing in

mobile ad hoc networks (MANETs). They apprise a

comprehensive survey of researches related to P2P overlay

networks for sharing the content at the application layer in

MANETs. They compare and contemplate the features,

vitality, and vulnerability of these approaches and

highlight indispensable research challenges that are

imperative to address and will have substantial vantages.

The fallout of the analysis would serve as a substantial

guide for anyone willing to delve into research on the

topic of P2P overlay over MANETs [1].

G. Usha (2016) et al: Mobile ad hoc networks (MANETs)

are one of the emerging technologies of wireless

communication, in which each node in the MANET acts

as a router. In an adhoc network, any node can

communicate with any other node in the network.

However, this infrastructure of mobile nodes makes this

system more vulnerable to various types of attacks. A

black hole attack is one such attack in which the packet is

dropped maliciously. They propose a security solution

known as the honeypot-based dynamic anomaly detection

using cross-layer security (HBDADCS). The proposed

technique detects and isolates black hole attacks from the

ad hoc network [2].

TheofilosChrysikos (2016) et al: Wireless Information-

Theoretic Security (WITS) has been suggested as a robust

security scheme, especially for infrastructure-less

networks. Based on the physical layer, WITS considers

quasi-static Rayleigh fading instead of the classic

Gaussian wiretap scenario. In this paper, the key

parameters of WITS are investigated by implementing an

802.11n ad-hoc network in an outdoor obstacle-dense

topology. Measurements performed throughout the

topology allow for a realistic evaluation of a scenario with

multiple moving eavesdroppers. Low speed user

movement has been considered, so that Doppler spread

can be discarded. In addition, the Outage Probability has

been estimated with regard to a non-zero target Secrecy

Rate for both techniques. The results have been compared

with the respective values of WITS key parameters

derived from theoretical analysis[3].

SajalSarkar (2016) et al: In this paper they propose a

game theoretic framework for stochastic multipath routing

in mobile ad hoc networks (MANETs). In a MANET,

intelligent and adaptive attackers may try to hijack, jam or

intercept data packets traveling from source to destination.

At each stage the source node keeps track of the available

multiple paths, the residual bandwidth of the paths and the

strategy of the attackers from the information gathered

during the previous stage. Based on these observations, the

source node selects a path for data communication and

switching strategy among the multiple established paths

between the source node and the destination node.

Performance analysis and numerical results show that our

proposed scheme achieves significant performance gains

in terms of residual bandwidth utilization, average end-to-

end delay, packet delivery ratio, routing overhead and

security[4].

Mohammad Masdari (2017) et al: Mobile ad hoc

networks (MANETs) are vulnerable to various security

attacks conducted by the malicious nodesand attackers. To

defend against the attackers, their public key certificates

should be revoked by certificate authority. Thus, each

MANET node before conducting any secure

communications, should check the status of

communicating parties’ certificates. Inconsistency of the

certificate status information is one of the critical

problems which reduce the correctness and effectiveness

of the whole certificate validation process. They conduct

a Markov-chain based analysis and evaluation of the

OCSP-based certificate validations in the hybrid

MANETs.

PROPOSED WORK

In current research paper they have put up the survey of

peer to peer content sharing in MANET. They have

undertaken various parameters for study. Under the study

they have taken various research papers for concluding

various factors. The factors are P2P overlay construction

with underlying flooding free routing, Network merging

detection and merging process at overlay layer, Network

partitioning for P2P overlay over MANETs, Data

replication, A holistic approach.

In current research work we are taking DHT based routing

for peer to peer content sharing. So that two nodes can

communicating to each other for sharing different

contents. In current research we are using flooding free

routing protocol like OLSR for establishing the route. As

International Journal of IT, Engineering and Applied Sciences Research (IJIEASR) ISSN: 2319-4413 Volume 6, No. 5, May 2017

Impact Factor: 5.913 www.irjcjournals.org

4

according to this research paper no research for P-T-P for

flooding free based routing have been done so far.

CONCLUSION

From the review of the various research papers and other

study material it is clear that DHT based routing protocol

will perform better and fast for flood free routing from

source to the destination. Suitable for P2P contents

sharing. So that contents can be shared between two peer

in decentralized network. One peer will works as server

and other peer will works as client. The OLSR is proactive

category of protocol for peer to per contents sharing.

REFRENCES

[1] Nadir Shah a ,S.A. Abid a , Depei Qian b ,

WaqarMehmood,” A survey of P2P content sharing

in MANETs”, Computers and Electrical

Engineering 57 (2017) 55–68

[2] G. Usha a ,M. Rajesh Babu b , S. Saravana Kumar,”

Dynamic anomaly detection using cross layer

security in MANET”, Computers and Electrical

Engineering 0 0 0 (2016) 1–11

[3] Theofilos Chrysikosa, Konstantinos Birkos a, Tasos

Dagiuklas b, Stavros Kotsopoulos,” Wireless

Information-Theoretic Security: Theoretical

analysis & experimental measurements with

multiple eavesdroppers in an outdoor obstacle-

dense MANET”, 18 November 2016

[4]SajalSarkara,RajaDatta,” A game theoretic

framework for stochastic multipath routing in self-

organized MANETs”, 22 June 2016.

[5] Mohammad Masdari,” Markov chain-based

evaluation of the certificate status validations in

hybrid MANETs”,Journal of Network and

Computer Applications 80 (2017) 79–89

[6] Shah N , Qian D , Wang R . MANET adaptive

structured P2P overlay. Peer-to-Peer NetwAppl

2012;5(2):143–60 .

[7] da Hora DN , Macedo DF , Oliveira LB , Siqueira

IG , Loureiro AA , Nogueira JM , et al. Enhancing

peer-to-peer content discovery techniques over

mobile ad hoc networks. ComputCommun

2009;32(13):1445–59 .

[8] CalommeS , Leduc G . An overlay maintenance

protocol for overlay routing on top of ad hoc

networks. In: International conference on research

in networking. Berlin Heidelberg: Springer; May,

2008. p. 48–59 .

[9] SeddikiM ,Benchaïba M . An adaptive P2P overlay

for MANETs. In: Proceedings of the 2015

International conference on distributed computing

and networking. ACM; January, 2015. p. 24 .

[10] JerbiM ,Senouci SM , Ghamri-Doudane Y , Cherif

M . Vehicular communications networks: current

trends and challenges. IGI Global 2010:251–62.