Académique Documents
Professionnel Documents
Culture Documents
Project Supervisor
Group Members
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.
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.
3. As P2P networks facilitate file transfer and sharing, malicious code can exploit this
channel to propagate to other peers.
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.
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,