Wireless P2P Research Articles

On Localized Application-Driven Topology Control for Energy Efficient Wireless Peer-to-Peer File Sharing

Wireless peer-to-peer (P2P) file sharing is widely envisioned as one of the major applications of ad hoc networks in the near future. This trend is largely motivated by the recent advances in high-speed wireless communication technologies and high traffic demand for P2P file sharing applications. To achieve the ambitious goal of realizing a practical wireless P2P network, we need a scalable topology control protocol to solve the neighbor discovery problem and network organization problem. Indeed, we believe that the topology control mechanism should be application driven in that we should try to achieve an efficient connectivity among mobile devices in order to better serve the file sharing application. We propose a new protocol, which consists of two components, namely, adjacency set construction (ASC) and community-based asynchronous wakeup (CAW). Our proposed protocol is shown to be able to enhance the fairness and provide an incentive mechanism in wireless P2P file sharing applications. It is also capable of increasing the energy efficiency.

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.

선박 내 Peer-to-Peer 다운로드 서비스를 위한 효율적인 핸드오버 기법

스마트 디바이스의 확산과 멀티미디어 콘텐츠에 대한 수요 증가로 인해 인터넷 트래픽이 급증하고 있다. 최근 크루즈선과 같은 대형 선박을 설계할 때, 지상 환경과 유사하게 해양 및 선박 내 환경에서도 다양한 IT 서비스를 제공할 수 있는 네트워크 설계가 고려되고 있다. 본 논문에서는 크루즈선과 같은 대형 선박 내부에서 효과적인 멀티미디어 콘텐츠 분배를 위한 무선 P2P (peer-to-peer) 통신시나리오를 고려하고, 멀티미디어 콘텐츠의 다운로드 서비스를 원활히 수행하기 위한 효율적인 핸드오버 기법을 제시한다. 제안한 방식은 핸드오버 시 기존의 방식이 신호 세기만을 고려하여 핸드오버를 수행하는 것과 달리, 인접 셀의 피어의 품질을 고려하여 핸드오버 히스테리시스 마진을 적응적으로 조절함으로써, 무선 P2P를 통한 멀티미디어 콘텐츠의 다운로드 속도를 개선함을 보였다. 제안한 방식은 선박 내 네트워크 (ship-area-network: SAN)에서 무선 P2P 통신을 통한 멀티미디어 콘텐츠의 공유과정에서 사용자들에게 효율적으로 콘텐츠를 제공할 수 있는 기술로 기대된다. Internet traffic is rapidly increasing due to the spread of personal smart devices and the demand for multimedia contents. When designing a large ship such as cruise, network architecture is also considered which supports various IT services in a maritime environment similar to the ground environment. In this paper, we consider wireless P2P (peer-to-peer) communication for efficient multimedia content sharing and propose novel handover scheme for efficient download service. The proposed handover method shows that it can improve the download symbol rates for handover in a wireless P2P system considering the signal strength and quality of peers as well. The proposed system is expected to provide efficient contents distribution and reliable communication in the ship-area-network (SAN).

Improvement and Performance Evaluation for Multimedia Files Transmission in Vehicle-Based DTNs

In recent years, P2P file sharing has been widely embraced and becomes the largest application of the Internet traffic. And the development of automobile industry has promoted a trend of deploying Peer-to-Peer (P2P) networks over vehicle ad hoc networks (VANETs) for mobile content distribution. Due to the high mobility of nodes, nodes' limited radio transmission range and sparse distribution, VANETs are divided and links are interrupted intermittently. At this moment, VANETs may become Vehicle-based Delay Tolerant Network (VDTNs). Therefore, this work proposes an Optimal Fragmentation-based Multimedia Transmission scheme (OFMT) based on P2P lookup protocol in VDTNs, which can enable multimedia files to be sent to the receiver fast and reliably in wireless mobile P2P networks over VDTNs. In addition, a method of calculating the most suitable size of the fragment is provided, which is tested and verified in the simulation. And we also show that OFMT can defend a certain degree of DoS attack and senders can freely join and leave the wireless mobile P2P network. Simulation results demonstrate that the proposed scheme can significantly improve the performance of the file delivery rate and shorten the file delivery delay compared with the existing schemes.

Architecture and Evaluation on Cooperative Caching In Wireless P2P

All researches shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. And all these studies have been done up to some level only.So for that purpose now iam using an protocol technique called Dynamic Source routing (DSR). And previous studies have been done mainly by using an AODV routing technique and these are all at high level and leaving many design and implementation issues unanswered. In this paper, I am mainly presenting my design and implementation of cooperative cache in wireless P2P networks, and propose solutions to find the best place to cache the data. For that one I propose an novel asymmetric cooperative cache approach by using an Dynamic Source Routing Protocol. By using these technique I can say that packet routing to be trivially loop-free, avoids the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and allows nodes forwarding or overhearing packets to cache the routing information in them for their own future use. All aspects of the protocol operate entirely on-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. The data has been accessed easily by the user. And also by using an data pipelines we can reduce the end-to- end delays between the server and client. My results show that the Dynamic Source Routing out performs the AODV in wireless P2P networks.

High Quality of Service on Video Streaming in P2P Networks Using FST-MDC

Video streaming applications have newly attracted a large number of participants in a distribution network. Traditional client-server based video streaming solutions sustain precious bandwidth provision rate on the server. Recently, several P2P streaming systems have been organized to provide on-demand and live video streaming services on the wireless network at reduced server cost. Peer-to-Peer (P2P) computing is a new pattern to construct disseminated network applications. Typical error control techniques are not very well matched and on the other hand error prone channels has increased greatly for video transmission e.g., over wireless networks and IP. These two facts united together provided the essential motivation for the development of a new set of techniques (error concealment) capable of dealing with transmission errors in video systems. In this paper, we propose an flexible multiple description coding method named as Flexible Spatial-Temporal (FST) which improves error resilience in the sense of frame loss possibilities over independent paths. It introduces combination of both spatial and temporal concealment technique at the receiver and to conceal the lost frames more effectively. Experimental results show that, proposed approach attains reasonable quality of video performance over P2P wireless network.

COADA

This paper argues that Dynamic Coalition Peer-to-Peer (P2P) Network exists in numerous scenarios where mobile users cluster and form coalitions, and the relationship between sizes of coalitions and distances from mobile nodes to their Point of Interest (PoI) follows exponential distributions. The P2P coalition patterns of mobile users and their exponential distribution behavior can be utilized for efficient and adaptive content file download of cellular users. An adaptive protocol named COADA (COalition-aware Adaptive content DownloAd) is designed that (a) blends cellular and P2P (e.g., WiFi or Bluetooth) wireless interfaces, (b) leverages the clustering of people into P2P coalitions when moving towards PoI, and (c) utilizes exponential-coalition-size function of the Dynamic Coalition P2P Network to minimize the cellular download and meet content file download deadline. With COADA protocol, mobile nodes periodically sample the current P2P coalition size and predict the future coalition size using the exponential function. In order to decide how much file data is available in P2P coalition channels versus how much file data must be downloaded from the server over the cellular network, Online Codes techniques are used and tune cellular download timers to meet the file download deadline. The simulation results show that COADA achieves considerable performance improvements by downloading less file data from the cellular channel and more file data over the P2P coalition network while meeting the file download deadline.

Mobile hosts participating in peer-to-peer data networks: challenges and solutions

Peer-to-peer (P2P) data networks dominate Internet traffic, accounting for over 60% of the overall traffic in a recent study. In this work, we study the problems that arise when mobile hosts participate in P2P networks. We primarily focus on the performance issues as experienced by the mobile host, but also study the impact on other fixed peers. Using BitTorrent as a key example, we identify several unique problems that arise due to the design aspects of P2P networks being incompatible with typical characteristics of wireless and mobile environments. Using the insights gained through our study, we present a wireless P2P client application that is backward compatible with existing fixed-peer client applications, but when used on mobile hosts can provide significant performance improvements.

A secure model for controlling the hubs in P2P wireless network based on trust value

Recently a lot of efforts are focused on the most promising solutions in future communication environments with information and communication security technologies. As a result of anonymity and contribution resources voluntary of nodes in P2P wireless network, the overwhelming nodes lack enthusiasm when they provide service, which is easy to cause free riding phenomenon. Thus, it leads to the emergence of hubs. Due to the existence of hubs in P2P wireless networks, the network becomes much more vulnerable because of great reducing in defending against coordinated attacks. Therefore, in this paper we provide a secure model for controlling the hubs in P2P network based on trust value. In detail, this paper proposes a model based on trust value of nodes against vulnerability, which not only takes into account a node’s connections, but also gives full consideration about a node’s trust value. The calculation of trust value is broken down to various types of resources. In accordance with the type of pre-transaction resources, the nodes that have higher trust value and fewer connections are chosen to make transaction. Simulation results demonstrate that this model can encourage nodes to participate in sharing recourses with other nodes in the network actively, and simultaneously it can avoid generating hubs effectively. Our model could improve the ability of defending against coordinated attacks, and also could enhance the network robustness and stability.

Cooperative Caching in Wireless P2P Networks: Design, Implementation, and Evaluation

Some recent studies have shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. However, all these studies are at a very high level, leaving many design and implementation issues unanswered. In this paper, we present our design and implementation of cooperative cache in wireless P2P networks, and propose solutions to find the best place to cache the data. We propose a novel asymmetric cooperative cache approach, where the data requests are transmitted to the cache layer on every node, but the data replies are only transmitted to the cache layer at the intermediate nodes that need to cache the data. This solution not only reduces the overhead of copying data between the user space and the kernel space, it also allows data pipelines to reduce the end-to-end delay. We also study the effects of different MAC layers, such as 802.11-based ad hoc networks and multi-interface-multichannel-based mesh networks, on the performance of cooperative cache. Our results show that the asymmetric approach outperforms the symmetric approach in traditional 802.11-based ad hoc networks by removing most of the processing overhead. In mesh networks, the asymmetric approach can significantly reduce the data access delay compared to the symmetric approach due to data pipelines.

Distributed Multisource Transmission in Wireless Mobile Peer-to-Peer Networks: A Restless-Bandit Approach

In wireless mobile peer-to-peer (P2P) networks, multiple sources can provide multimedia file sharing at the same time. The selection of multiple sources is one of the key issues in the design of a multisource-transmission system in wireless mobile P2P networks. In this paper, we propose a distributed multisource sender-selection scheme to maximize the receiving data rate and minimize the energy consumption. Our scheme is based on recent advances in restless-bandit algorithms. The proposed sender-selection scheme has an indexability property that dramatically simplifies the computation and implementation of the policy. In addition, there is no need for a centralized control point, and senders can freely join and leave from the wireless mobile P2P network. Simulation results show that the proposed scheme significantly improves the receiving data rate and energy-consumption performance compared with the existing scheme.

Distributed cooperative diversity methods for wireless ad hoc peer-to-peer file sharing

Peer-to-peer (P2P) networks are very popular for large-scale data sharing in today's internet. It is naturally envisioned that the file sharing would also be an important application for civil mobile ad hoc networks in the future. The authors propose the cooperative diversity download methods utilising the wireless medium and common file sources in wireless P2P networks. The designed protocols including multi-source opportunistic direct downloading (MODD) and multi-source opportunistic decode-and-forward downloading (MODFD) can adaptively work in different file distribution scenarios. Both of them rely on the cooperation between the sources or receivers and the proposed distributed source-selection schemes. For the situation with one receiver and multi-source, MODD selects ‘best’ source with most favourite channel condition from available m sources. In the situation with multiple receivers and sources, the multiple receivers could form the cooperative pairs to receive the data from the selected source based on decode-and-forward transmission strategy. Compared with MODD, MODFD saves the source-selection time and provides incentives for the cooperation between the peers. A distributed collision solving scheme for the selection schemes is also proposed. The information theoretic analysis of outage probability shows that the proposed downloading methods can both obtain m times diversity gain.

Protected seamless content delivery in P2P wireless and wired networks

Delivering protected seamless content services over heterogeneous networks should be solidly sustained on top of architectures that can offer support for guaranteed quality delivery according to network or consumer requirements. The delivery of personalized, scalable, seamless, and trusted multimedia content delivery, while adequately protecting the content, is a key factor to provide seamless content services to the final user and provide a framework for user participation. This article describes novel forms of delivering seamless content services over P2P networks using multilayered/multiviewed content coding techniques, such as SVC/MVC, multisource/ multinetwork streaming, and adaptation, with special focus on enabling content protection and lightweight asset management for a secure and privacy keeping content delivery. The implementation has been validated in the framework of the European Project SEA (IST-214063).

Distributed sender scheduling for multimedia transmission in wireless mobile peer-to-peer networks

Multi-source multimedia transmission is a popular architecture in wireless mobile peer-to-peer (P2P) networks. Most of previous work on wireless mobile P2P networks concentrates on the protocols and network structures, and consequently ignores the multiple senders scheduling problem. In this paper, we present a distributed algorithm for scheduling the multiple senders for multi-source transmission in wireless mobile P2P networks, which can maximize the data rate and minimize the power consumption. Specifically, we formulate the wireless mobile P2P network as a multi-armed bandit system. The optimal distributed sender scheduling policy can be found according to the Gittins indices of the senders. Extensive simulation examples illustrate the effectiveness of the proposed scheme. It is shown that the data rate and power consumption in the proposed scheme can be improved significantly compared to existing schemes.

A distributed decision-making mechanism for wireless P2P networks

Trust-based solutions provide some form of payment to peers to encourage good behavior. The problem with trust management systems is that they require prior knowledge to work. In other words, peers are vulnerable to attack if they do not have knowledge or correct knowledge of other peers in a trust management system. Therefore, considering only trust is inadequate when a decision is made to identify the best set of peers to utilize. In order to solve the problem, we propose a distributed decision-making mechanism for wireless peer-to-peer (P2P) networks based on game theory and relevant trust mechanisms in which we incorporate the element of trust and risk into a single model. The main idea of our mechanism is to use utility function to express the relationship between benefits and costs of peers, and then make the decision based on expected utility as well as risk attitude in a fully distributed fashion. The unique feature of our mechanism is that it not only helps a peer to select its partners, but also mitigates vulnerabilities in trust-based mechanisms. Through analysis and experiments, we believe our approach is useful for peers to make the decision regarding who to interact with. In addition, it is also a good starting point for exploring tradeoffs among risk, trust and utility.

POPEYE: providing collaborative services for ad hoc and spontaneous communities

Next generation collaborative systems will offer mobile users seamless and natural collaboration amongst a diversity of agents, within distributed, knowledge-rich and virtualized working environments. This ambitious goal faces numerous challenges from the underlying communication infrastructure to the high level application services, with the aim to provide services with the appropriate quality (such as persistence, synchronization, and security). Most currently available tools supporting collaboration address either rather traditional and rigid intra-organizational collaboration scenarios or, at the opposite, completely free and unstructured open communities’s interactions. Emerging dynamic, flexible and ad hoc collaboration schemes are hardly or not supported at all. The POPEYE framework offers collaborative services for applications that aim to enable spontaneous collaboration over P2P wireless ad hoc groups, where fixed infrastructure is not a prerequisite, where virtual communities can emerge spontaneously and share data with the appropriate quality of service for business applications (persistence, synchronization, security, etc.).

Simulation in Emergent Computational Systems.

Simulation in Emergent Computational Systems.

On Localized Application-Driven Topology Control for Energy-Efficient Wireless Peer-to-Peer File Sharing

Wireless peer-to-peer (P2P) file sharing is widely envisioned as one of the major applications of ad hoc networks in the near future. This trend is largely motivated by the recent advances in high-speed wireless communication technologies and high traffic demand for P2P file sharing applications. To achieve the ambitious goal of realizing a practical wireless P2P network, we need a scalable topology control protocol to solve the neighbor discovery problem and network organization problem. Indeed, we believe that the topology control mechanism should be application driven in that we should try to achieve an efficient connectivity among mobile devices in order to better serve the file sharing application. We propose a new protocol, which consists of two components, namely, <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">adjacency set construction </i> (ASC) and <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">community-based asynchronous wakeup </i> (CAW). Our proposed protocol is shown to be able to enhance the fairness and provide an incentive mechanism in wireless P2P file sharing applications. It is also capable of increasing the energy efficiency.

SELF-ORGANIZING CONTEXTUALIZED MOBILE WORKFORCE MANAGEMENT WITH COLLABORATIVE ART LEARNING

With the development in wireless technology and the sophistication in wireless devices, enterprising mobile workforces have grown in recent years. Mobile workforces do not work at a fixed area in a company and they have to visit customers or sell their products in public areas. Therefore, it is important for these enterprises to properly allocate their mobile workforces and leverage their collaborative cooperation. In this paper, we present a novel mechanism, named the collaborative ART learning (CART), which drives social-awareness collaboration between mobile workforces in a public area (e.g., an exhibition center). Because of the characteristics of a pubic working space, this method is situated in a wireless P2P network environment. The mobile workforce peers self-organize dynamically into appropriate collaborative work groups to accomplish tasks on demand. With CART, each peer of a task group receives adjustments of recognized capability levels after the task assigned is completed. CART learns the way to organize fitting collaborative work groups through cycles of problem solving and work force status adapting, leading to continued satisfactory collaborative performance.

UbiSrvInt – a context-aware fault-tolerant approach toward wireless P2P service provision

Peer-to-Peer applications harness sharing between free resources (storage, contents, services, human presence, etc.). Most existing wireless P2P applications concern merely the sharing of a variety of contents. For magnifying the sharing extent for wireless service provision in the vicinity (i.e., the wireless P2P environments), this paper presents the UbiSrvInt approach and this is the first attempt to enable a pure P2P solution that is context aware and fault tolerant for ad hoc wireless service provision. This approach empowers an autonomous peer to propel distributed problem solving (e.g., in the travel domain) through service sharing and execution in an intelligent P2P way. This approach of ad hoc wireless service provision is not only highly robust to failure (based on a specific clustering analysis of failure correlation among peers) but also capable of inferring a user's service needs (through a BDI reasoning mechanism utilizing the surrounding context) in ad hoc wireless environments. We have implemented UbiSrvInt into a system platform with P-JXTA that shows fairly promising performance results on fault tolerance and context awareness.