Vous êtes sur la page 1sur 6

Tentative Project Proposal

Project Supervisor

Mohammad Rashedul Hasan

Group Members

Monsur Ahmed Rony (ID- 062-387-045)


Sakil Ahmed Chowdury (ID- 062-306-045)

Tentative Project Proposal:


We want to develop a efficient searc h mechanism for peer to peer network over Manet. For
this we investigate the present search mechanism and will try to develop a efficient and time
consuming search mechanism for peer to peer network over Manet.

Research Area
Peer-to-peer (P2P) systems have recently become a very active research area, due to the
popularity and widespread use of P2P systems today, and their potential uses in future
applications. Recently, P2P systems have emerged as a popular way to share huge amounts of
data. In the future, the advent of large-scale ubiquitous computing makes P2P a natural model for
interaction between devices. And as we know to establish efficient, dynamic communication for
emergency and rescue operations, disaster relief attempts, and military networks. Such network
situations cannot rely on centralized connectivity. Mobile ad hoc network has these advantages.
A MANET is a multi-hop ad hoc wireless network in which there is no infrastructure. Peer-To-
Peer (P2P) and Mobile Ad hoc NETworks(MANETs) share the same key concepts of self-
organizationand distributing computing, and both aim to provide connectivity in a completely
decentralized environment. If we can peer to peer network and MANET ,the key issue will be
the search mechanism as one has to find some particular files in peer.

Basic Properties of Peer to Peer:


1. Have no distinguished role.

2. No single point of bottleneck or failure

3. They need distributed algorithms for Service discovery (name, address, route, metric,
etc), Neighbour status tracking, Application layer routing (based possibly on content,
interest, etc),Resilience, handing link and node failures etc.

4. Has direct exchanges means act as a cilent and server at a time.


5. No single point of bottleneck or failure.
Limitations of Peer to Peer Network:
1. Designing search a mechanism is difficult in P2P systems for several reasons: scale of the
system, unreliability of individual peers, etc.

2. Legal controversy with the copyright

3. As P2P networks facilitate file transfer and sharing, malicious code can exploit this
channel to propagate to other peers.

Requirements: Search Mechanism for Peer to Peer


Network :
Due to the above drawbacks mainly the first limitation stated, Peer to peer network needs a
suitable and efficinet search mechanism which

• They must be able to support query languages of varying levels of expressiveness.

• Autonomy, efficiency and robustness are desirable for conceptually define an


informal space of P2P systems

• A constant challenge in designing P2P systems is achieving a desired level of


QoS as efficiently as possible. Because metrics and applications differ so widely,
this challenge must often be tackled on a per case basis.

Literature Review:
We have studied some papers on Peer to Peer Network and its current challenges. One of
them“Open Problems in Data-Sharing Peer-to-Peer System”. In a data-sharing P2P system, users
submit queries and receive results (such as data, or pointers to data) in return, via the search
mechanism. Data shared in the system can be of any type. In most cases users share _les, such as
music , images, news articles, web pages, etc. Other possibilities include data stored in a
relational DBMS, or a queryable spreadsheet. Queries may take any form that is appropriate
given the type of data shared. For example, in a _le-sharing system, queries might be keywords
with regular expressions, and the search may be de_ned over di_erent portions of the document
(e.g., header, title, metadata). A search mechanism defines the behavior of peers in three areas
such as topology,data placement,message routing.

Another paper is “Hierarchical Multidimensional Search in Peer-to-Peer Networks”. In these


paper they disscuss about some problems in peer to peer network. Thety talked about
Communication architecture and indexing architecture. In communication arcchitecture .
Without central servers, we need a distributed overlay to interconnect the nodes for efficient
navigation between them. A main problem in designing this overlay is due to the dynamics of
P2Pnetworks; nodes can join, leave, publish, and remove data at any time and so connections and
data coherence may be lost frequently. The overlay should be self-adjustable in a way to
minimize the effect of such changes. The overlay must be robust in that failure recovery is fast
andgraceful to avoid interruption in the on-going service. To be part of the network, a node needs
not know everything about the network. For efficiency, a node should keep track of just a small
number of other nodes and process a small share of service load. Since we target large-scale
networks, the overlay must be scalable with the network size. In the Indexing architecture. The
accumulative volume of distributed data in a P2P network is large and potentially keeps growing.
Therefore, instead of employing a number of centralized servers (either dedicated or selected
among participating nodes) to carry the load for the entire network, we should let every node in
the network share the load of indexing and searching. They also talked about the existing
solution and their contribution. They also discussed about ZigZag Hierarchy[6] .A Zigzag
hierarchy of N nodes is a multi-layer hierarchy of clusters. [Fig 1]. And shown that this hierarchy
is higly scalable architecture in peer to peer network.
Research Methodology:
We would like to make some extension of any search mechanism (i.e. CHORD) which can
improve Peer to Peer Network real-time data communication. We are going to use JAVA
language to simulate our solution.

References:
1. Neil Daswani, Hector Garcia-Molina, and Beverly Yang ,“Open Problems in Data-
Sharing Peer-to-Peer Systems” ,Stanford University.
2. Marling Engle & Javed I. Khan“Vulnerabilities of P2P Systems and a Critical Look at
their Solutions” ,Kent State University
3. Mayank Bawa, Brian F. Cooper, Arturo Crespo, Neil Daswani Prasanna Ganesan, Hector
Garcia-Molina, Sepandar Kamvar, Sergio Marti,Mario Schlosser, Qi Sun, Patrick
Vinograd, Beverly Yang, “Peer-to-Peer Research at Stanford”, Stanford University

4. Yan Gong, Fangchun Yang, Sen Su, and Guangwei Zhang ,“Improve Peer Cooperation
Using Social Peer-to-Peer Networks”, Beijing University of Posts and
Telecommunications,
5. Ma Lingjun, Pui-Sze Tsang, and King-Shan Lui ,“Improving File Distribution
Performance by Grouping in Peer-to-Peer Networks”, Beijing University of Posts and
Telecommunications,beijing,china.
6. D. A. Trany T. Nguyen ,“Hierarchical Multidimensional Search in Peer-to-Peer
Networks”, University of Massachusetts, Boston,

Picture Reference:
1. D. A. Trany T. Nguyen ,“Hierarchical Multidimensional Search in Peer-to-Peer
Networks”, University of Massachusetts, Boston,

Vous aimerez peut-être aussi