Mobile P2P Research Articles

A Trust Management Model for Mobile P2P Networks based on Multiple-Fuzzy Theory

A Trust Management Model for Mobile P2P Networks based on Multiple-Fuzzy Theory

Design and Algorithm Optimization of P2P Mobile Monitoring Network-Based Facial Recognition System

To meet the demand of provisional emergency monitoring in large-scale outdoor rallies and emergency situations, this paper designs a P2P mobile monitoring system which would be based P2P wireless network infrastructure. The mobile terminal function of the system is designed to be able to make monitoring recording, play videos and realize P2P video session in the form of streaming media. The embedded design and algorithm optimization of the system’s facial recognition function gives more well-rounded performance to the system in terms of safeguarding, dispatch and commanding. This paper would design the system’s P2P network infrastructure and the function module of the mobile terminal software and propose the optimization of the facial recognition algorithm based on this system.

모바일 P2P 네트워크에서 피어의 연결성을 고려한 그룹 기반 캐시 공유 기법

모바일 P2P 네트워크에서 사용자 요청을 효과적으로 처리하기 위해 캐시 공유 기법들이 연구되고 있다. 본 논문에서는 모바일 P2P 네트워크에서 피어의 연결성에 기반을 둔 클러스터를 구축하여 캐시를 공유하는 기법을 제안한다. 제안하는 기법은 연결성이 오랫동안 유지될 수 있는 피어들을 하나의 클러스터로 구성하여 캐시를 공유한다. 클러스터 내부에 있는 피어들의 캐시를 하나로 사용함으로써 데이터의 중복을 감소시키고 캐시 공간을 효율적으로 사용한다. 또한, 캐시 공간을 데이터 캐시와 임시 캐시 두 부분으로 분할하여 사용한다. 임시 캐시를 활용하여 클러스터의 토폴로지가 변경되거나 캐시 데이터 교체 시, 지연시간을 감소시킬 수 있다. 일반적인 기법은 협력적 캐시 처리 절차를 통해 질의가 전달되지만 통신비용을 줄이기 위해 1-홉 피어 캐시확인과 클러스터 헤더로 가는 경로에 있는 피어의 캐시를 확인한다. 성능 평가 결과 제안하는 기법이 기존 기법에 비해 캐시 적중률도 높고 지연시간을 감소시키는 것을 확인할 수 있었다. Recently, cache sharing methods have been studied in order to effectively reply to user requests in mobile P2P networks. In this paper, we propose a cache sharing scheme based on a cluster considering the peer connectivity in mobile P2P networks. The proposed scheme shares caches by making a cluster that consists of peers preserving the connectivity among them for a long time. The proposed scheme reduces data duplication to efficiently use the cache space in a cluster. The cache space is divided into two parts with a data cache and a temporary cache for a cache space. It is possible to reduce the delay time when the cluster topology is changed or the cache data is replaced utilizing a temporary cache. The proposed scheme checks the caches of peers in a route to a cluster header and the caches of one-hop peers in order to reduce the communication cost. It is shown through performance evaluation that the proposed scheme outperforms the existing schemes.

Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks

The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object as their nearest neighbour. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organisation, fault-tolerance and load-balancing. In this study, we propose and evaluate 3 distinct P2P algorithms focusing on bichromatic RNN queries, in which mobile query peers and static objects of interest are of two different categories, based on a time-out mechanism and a boundary polygon around the mobile query peers. The Brute-Force Search Algorithm provides a naive approach to exploit shared information among peers whereas two other Boundary Search Algorithms filter a number of peers involved in query processing. The algorithms are evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving bichromatic RNN queries for mobile networks.

Hot Spots Tracing on Internet Finance in China

This paper collects the Internet data of 2013 related with Internet finance from several websites,and identifies key words by ICTCLAS,then analyses the co-word network by Bicomb based on key words co-occurrence.By the help of factor and cluster analysis, it studies the relationship between the key words then tracks the hot spots of Internet finace on the Internet.The analysis shows mobile payment,supervision,risk control and P2P network loan are focused in Internet finance field,Mobile payment,supervision,risk management become the hotspots at present.

A Resilient P2P Architecture for Mobile Resource Sharing

Peer-to-peer (P2P) systems present a unique medium for resource sharing among cliques of participants (peers) in a distributed and self-organized manner. With the advent of mobile users and the increasing power of mobile devices, the spectrum of P2P capabilities should scale. Peers establish transient or persistent relationships with other peers based on mutual interest. Communicating peers may use intermediary peers to forward communication messages, if a direct link is beyond their communication range. A critical design parameter is establishing a resilient communication topology, yet reduce the overhead of control messages required to instill and maintain it. This rises as a significant hindrance in mobile environments, which pose additional challenges on P2P networks due to the heterogeneity of nodes, limited resources, dynamic contexts in addition to the inherited wireless network stringencies. Thus far, efforts in establishing P2P networks via super peers (SPs) have been capped by considering a subset of peer properties to evaluate their candidacy. This paper presents RobP2P, a robust architecture to construct mobile P2P networks and efficiently maintain network state. RobP2P introduces a SP selection protocol based on a dynamic score function that takes into account peers’ capabilities and context, such as location and quality of connectivity. The paper also presents an agile utility function through which SPs can delegate monitoring responsibilities to comparably powerful and stable peers to ensure self-healing topology maintenance. We present an elaborate performance evaluation of RobP2P implemented on Network Simulator NS-3. Our results illustrate the efficiency of RobP2P, its resilience to failures, and the improvements in lowering overhead traffic while reliably maintaining the consistency of network state.

A Participation-Based Trust Model for Mobile P2P Networks

Mobile peer-to-peer (P2P) networks have become increasingly popular, but the attacks and selfness of peers make it vulnerable. In this paper, a trust model based on participation is proposed for mobile P2P networks (called ParticipationTrust). It could deal with the egoistic and malicious behaviors. And the level of peer’s participation could be calculated through the transaction participation and recommendation participation. A set of experiments show that the model is rational and effective

My-Direct: A Middleware for P2P Mobile Social Networks

In recent years, middleware for mobile social network has attracted the attention of academia, causing the design and development of various approaches by researchers. This type of middleware facilitates and makes more efficient the development process of mobile social networking applications. Furthermore, middleware solutions also abstract the communication process with other applications, allowing the acquisition, persistence and reuse of social context information and location of users, besides providing API so that developers can access this information quickly and build new social applications. With a view to supporting this new trend of research, this paper presents a middleware for mobile social networking called My-Direct which makes use of Wi-Fi Direct technology together with the Bluetooth, aiming to provide flexible communication between the nodes of the mobile social network. Along with My-Direct also was created a mechanism for user privacy based on information available on his mobile device.

Content Distribution Mechanism in Mobile P2P Network

As content distribution in mobile P2P network facing architecture instability, the limited ability of a single node, low efficiency of content distribution and other problems, this paper proposes a new mobile network structure and content distribution mechanism strateg y , the new mobile network structure will be divided into multiple subnets network for partition management. Each subnet manages information routing and dissemination strategies through a super-node. The transfer of information between subnets can be achieved by transitional node in cross region. Thus the information transfer is achieved in the entire network. Content distribution strategies using part of network coding mechanism for data compression, improve the efficiency of information transmission and download success rate. Finally, experimental verification, the experimental results show that: the proposed new mobile network structure and content distribution mechanisms strategies can reduce the disturbance of download success rate caused by fixed point, reduce the data transmission delay, and effectively improve the hit rate

A Routing Scheme Considering Mobility in Mobile Peer-to-peer Networks

Recently, with the development of wireless communication technology and the wide usage of mobile devices such as PDAs, netbooks, and smart phones, interests on mobile P2P networks have been increased. Location based routing schemes considering the mobility of mobile devices in order to provide mobile P2P services were proposed. However, the existing schemes cause high communication costs since they broadcast the messages to a whole network to create routing paths. In this paper, we propose a new location based routing scheme to efficiently create routing paths along with the mobility of mobile devices. The proposed scheme maintains the information of peers within 2-hop in order to reduce the costs of routing path searches. The proposed scheme searches the routing path considering the directionality of the destination peer and maintains it using the connectivity of peers. It was shown through performance evaluation that the proposed scheme outperforms the existing schemes.

A locality-aware resource management scheme for the hierarchical P2P system

In distributed, ubiquitous computing environments, peer-to-peer (p2p) systems have been studied. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. The simulation results demonstrate that the proposed scheme can reduce the discovery routing distance by 21 %, and 45 % compared with JXTA depending on the given number of max-hop.

Overlays in Mobile P2P Networks

在移动对等网络的研究工作中,覆盖网络的构造是一个十分关键的核心问题.覆盖网络体系结构决定了移动对等网络的健壮性、安全性和性能.首先提出移动对等覆盖网络的概念,给出了其定义、构建覆盖网的重要意义和覆盖网的分类.然后阐述了3类不同的覆盖网,即分布式非结构化网络、分布式结构化网络和半分布式(混合式)网络,其中特别论述了这些覆盖网在移动自组网、车辆自组网以及无线Mesh网络等方面的应用,并进行了分析和比较.最后,对整个移动对等覆盖网络研究工作进行了总结,并对下一步研究方向进行了展望.;The construction of overlays is a crucial problem in the research of mobile peer-to-peer networks. The architecture of overlays determines the robustness, security and performance of MP2P networks. The paper first introduces the concept of mobile P2P overlays, including the definition, significance of the construction of overlays and the classification of them. Next, three kinds of overlays, distributed unstructured, distributed structured and semi distributed (hybrid) network, are described. The application of overlays in MANET, VANET and WMN is especially introduced. Furthermore, the aforementioned overlays are analyzed and compared. Finally, the paper concludes and presents the future research directions.

Selfish Node Detection and Incentive Mechanism in Mobile P2P Networks

Due to the limitation of own resource and the influence of subjective attitude,the nodes in mobile peer-to-peer networks often show selfish behavior.Detecting and stimulating selfish nodes to cooperate is becoming an important research topic recently.By allowing nodes to express their subjective forward attitude freely,the detection mechanism is implemented.Not only is the objective forwarding probability determined by its own resource,but subjective forwarding probability is also determined by selfish nodes that are considered.Therefore,choosing a routing path with the highest integrated forwarding probability can alleviate the influence of selfish nodes.To motivate the excessive selfish nodes to actively cooperate,an incentive and cooperation model based on punishment mechanism is presented.The selfish nodes are punished based on the damage degree of their selfish behavior.The monitor mechanism among nodes and strict punishment mechanism assure that the strategy proof is achieved.Simulation results show that the detection and incentive mechanism can not only discover appropriate routing in the condition of every rational and selfish node has limited resource,but also stimulate selfish nodes to actively cooperate when the degree of nodes’ selfishness is high.

Dominating-Set-Index based Searching Algorithm in Mobile P2P Networks

Because of the isomorphism between P2P networks and mobile ad hoc networks (MANET), many research communities are focusing on the work based on the combination of P2P and the backbone strategy, and this produces a field called mobile peer-to-peer (MP2P) networks. An effective algorithm for searching and retrieving information has proven to make a great impact on the performance of MP2P systems. Based on the connected dominating-set (CDS), which overlays the whole Mobile P2P ad hoc network, we propose a dominating-set-index based searching algorithm, named DSI, using dominating set indices to maximize the return of search results. DSI periodically advertises information of shared resources on the backbone of current network topology in a distributed fashion. Similar information will be clustered close to the backbone network. This can accelerate the searching process, as the resource location information is placed close to normal nodes. Both theoretical analysis and experimental results show that DSI outperforms the existing searching algorithms in MANET, OLSR, local index tree (LIT) and pure flooding, in terms of network workload and degree of user satisfaction.

Improvement of the Byzantine Agreement Problem under Mobile P2P Network

For improving the accuracy under P2P networks, it must be assured that all non-faulty peers can reach agreement. As such, all the non-faulty peers need to work collaboratively despite disturbances caused by faulty peers. This agreement issue is usually called as the Byzantine Agreement (BA) problem. In previous works, (n-1)/3 + 1 bouts for exchanging message are necessary to allow all non-faulty peers reaching an agreement. Furthermore, the message complexity of these algorithms are O(nn). Hence, the relevant algorithms are not suitable for mobile P2P networks in which there may have a great quantity of mobile peers. In this study, a more efficient algorithm has been proposed to decrease the required bouts for exchanging message. Our proposed algorithm only need to run three bouts for exchanging message to allow all non-faulty peers to reach an agreement despite some peers roaming among the different network. It also can decrease the message complexity to O(n2). It is more suitable and efficient than previous efforts aimed at the mobile P2P network.

Design and implementation of JXTA-based P2P mobile learning environment

The unification of internet with wireless devices means that mobiles have become the most indispensable part of human life. This makes mobile devices a great platform to carry out mobile learning applications such as m-learn which enables students to request information through their mobile phones. The proposed Juxtapose (JXTA) enabled with Android (Peerdriod) connects and provides functionalities that enable students to gather information about the availability of lectures, live streaming of lectures, recorded audio and video tutorials, information about books in the library, visual aided directions inside the campus with mobile JXTA connecting to the university server. M-learn has enhanced interactivity and hence information management can be achieved that facilitates on-demand information retrieval in an educational environment. The enhanced study provides attractive generic infrastructures that rapidly define and implement m-learn in university and information services when compared to traditional classroom learning.

Survey on mobile social networking in proximity (MSNP): approaches, challenges and architecture

Recently, mobile social networks (MSN) have gained tremendous attention, which free users from face-to-monitor life, while still can share information and stay in touch with their friends on the go. However most MSN applications regard mobile terminals just as entry points to existing social networks, in which centralized servers (for storage and processing of all application/context data) and continual Internet connectivity are prerequisites for mobile users to exploit MSN services, even though they are within proximity area (like campus, event spot, and community, etc.), and can directly exchange data through various wireless technologies (e.g., Bluetooth, WiFi Direct, etc.). In this paper, we focus on mobile social networking in proximity (MSNP), which is explicitly defined in our paper as: MSNP is wireless peer-to-peer (P2P) network of spontaneously and opportunistically connected nodes, and uses geo-proximity as the primary filter in determining who is discoverable on the social network. In this paper, first, primary support approaches related to MSNP available in literature, are summarized and compared, including MSN, mobile P2P and opportunistic networks. And then, we offer the special characteristics of MSNP, open issues and potential solutions. A networking technologies and platform independent architecture is proposed for developing MSNP applications, and proof-of-concept implementation of WiFi direct based MSNP application is also provided. Our primary goal is to identify the characteristics, technical challenges and potential solutions for future MSNP applications, capable to flexibly adapt to different application domains and deployment requirements.

Proxy-Based Security-Feedback Trust Model in MP2P Network

Trust problem is a key issue for Mobile P2P (MP2P) network security. In MP2P network, terminals addressing mode, communication way and display identifier are different to traditional P2P network. Some security issues such as: malicious slander and collusion, free ride phenomenon, are even more serious compared to traditional P2P network. Aimed at these above issues, a Proxy-based Security-Feedback Trust Model (PSTM) is proposed. Different types of terminals access to different proxy servers to shield the discrepancy between different terminal equipments on MP2P equipment access network layer. Meanwhile, proxy servers can reduce the problem of single point failure with method of trust related tables backup and recovery. Certificate Feedback Raters identification and qualification through security resource-selection protocol then integrate trust information according to similarity of terminal and resource types with weight. Furthermore, set global contribution value and evaluation value in multi-granularity trust computation to motivate mobile peers honest feedbacks. Divide mobile peers direct trust value into peer-oriented and resource-oriented values to make trust feedbacks more authentic. Simulation experiments show that PSTM can reduce malicious slander and collusion effectively. It also can restrain self-ish peers free ride behaviors and increase successful cooperation rate of high-contributed nodes in MP2P network.

SAMP: supporting multi-source heterogeneity in mobile P2P IPTV system

Peer-to-Peer (P2P) streaming provides an effective method to deploy large-scale internet protocol television (IPTV) application over today?s Internet. A major challenge in designing such an application is how to deal with content delivery among heterogeneous clients. Especially, with the development of the mobile internet and smart phones, how to provide an effective multi-source heterogeneous P2P IPTV solution becomes of great importance. Due to the special requirement of supporting differentiated multiple video streaming for different users, already existing P2P live video streaming techniques are inappropriate to be adopted directly. Therefore, this paper proposes a source-aware mobile P2P IPTV solution (SAMP) to provide multi-source live streaming for heterogeneous clients. In detail, SAMP includes a source-aware P2P topology construction algorithm to deduce the bandwidth occupation and the control overhead among the P2P clients, and contains a source-aware P2P streaming scheduling algorithm to further enhance the delay performance of the P2P IPTV system. The evaluation results show that the proposed SAMP scheme can provide a differentiated multi-source live streaming for heterogeneous clients with reduced bandwidth consumption, control overhead, and delivery delay.

Mutual anonymous communication mechanism based on stable group for mobile P2P network

To overcome the Mobile Peer-To-Peer(MP2P) disadvantages such as the instable wireless link,the inaccessible node credit and the evil nodes with a view to MP2P characteristics,a Mutual Anonymous Communication Mechanism based on Stable Group(MACM-SG) for MP2P network was put forward.The mechanism firstly built stable groups,and then established the anonymous communication channel.Due to the stable group characteristics,the nodes in the same stable group had a high possibility to establish trust relationship without the help of centre server,so the anonymous communication channel had a stable and a low communication load and high dynamic adaptability.The experiment shows that the mechanism can provide a high anonymous communication quality with a low load.