Mobile Peer-to-Peer

Peer-to-peer systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. Since the shared data are unstructured and they do not follow a global schema, XML-based descriptions of the data can be used to provide a uniform way to query the heterogeneous data. In our research, we are interested in designing a fully decentralized approach for the problem of espciently routing path queries among the nodes of a peer-to-peer system. Our approach is based on (a) selecting and maintaining specialized data structures, called filters that efficiently summarize the content, i.e., the documents, of one or more node and (b) using these filters to build an overlay network that groups together nodes with similar content

Use of context-awareness in mobile peer-to-peer networks

Mobile ad-hoc network are an emerging research field due to the potential range of applications that they support and for the problems they present due to their dynamic nature. Peer-to-peer is an example of a class of applications that have recently been deployed on top of ad-hoc networks. In this paper we propose an approach based on context-awareness to allow peer-to-peer applications to exploit information on the underlying network context to achieve better performance and better group organization. Information such as availability of resources, battery power, services in reach and relative distances can be used to improve the routing structures of the peer-to-peer network, thus reducing the routing overhead

Adaptive search in mobile peer-to-peer databases

Information is stored in a plurality of mobile peers. The peers communicate in a peer to peer fashion, using a short-range wireless network. Occasionally, a peer initiates a search for information in the peer to peer network by issuing a query. Queries and pieces of information, called reports, are transmitted among peers that are within a transmission range. For each search additional peers are utilized, wherein these additional peers search and relay information on behalf of the originator of the search

Peer-to-peer overlay in mobile ad-hoc networks

Wireless multi-hop networks such as mobile ad-hoc (MANET) or wireless mesh networks (WMN) have attracted big research efforts during the last years as they have huge potential in several areas such as military communications, fast infrastructure replacement during emergency operations, extension of hotspots or as an alternative communication system. Due to various reasons, such as characteristics of wireless links, multi-hop forwarding operation, and mobility of nodes, performance of traditional peer-to-peer applications is rather low in such networks. In this book chapter, we provide a comprehensive and in-depth survey on recent research on various approaches to provide peer-to-peer services in wireless multi-hop networks. The causes and problems for low performance of traditional approaches are discussed. Various representative alternative approaches to couple interactions between the peer-to-peer overlay and the network layer are examined and compared. Some open questions are discussed to stimulate further research in this area. © 2010 Springer Science+Business Media, LLC