Virtual community-based video resource sharing solution in MANETs

The virtual community has emerged as a state-of-the-art technology, grouping the user with the common interest and providing a feasible solution for large-scale deployment of resource sharing services. Efficient sharing for video resources and low maintenance cost of overlay topology are key factors in MP2P video on demand systems. In this paper, a novel virtual community-based video resource sharing (VCVRS) solution in MANETs is proposed. VCVRS design a virtual community construction strategy to group the nodes with the common playback behavior and a flexible community maintenance mechanism so as to obtain the fast supplier discovery and low maintenance overhead. Simulation results show how VCVRS achieves higher lookup success rate, lower server stress, lower node load and less overlay maintenance overhead, in comparison with another state of the art solution.     

基于联合调度和DHT补偿的P2P直播系统播放质量改善策略

In Peer-to-Peer (P2P) streaming systems, video data may be lost since peers can join and leave the overlay network randomly, thereby deteriorating the video playback quality. In this paper we propose a new hybrid mesh and Distributed Hash Table (DHT) based P2P streaming system, called HQMedia, to provide high playback quality to users by maintaining high data dissemination resilience with a low overhead. In HQMedia, peers are classified into Super Peers (SP) and Common Peers (CP) according to their online time. SPs and CPs form a mesh structure, while SPs alone form a new Streaming DHT (SDHT) structure. In this hybrid architecture, we propose a joint sched-uling and compensation mechanism. If any frames cannot be obtained during the scheduling phase, an SDHT-based compensation mechanism is invoked for retrieving the missing frames near the playback point. We evaluate the performance of HQMedia by both theoretical analysis and intensive simulation experiments on large-scale networks to demonstrate the ef-fectiveness and scalability of the proposed system. Numerical results show that HQMedia significantly outperforms existing mesh-based and treebased P2P live streaming systems by improving playback quality with only less than 1% extra maintenance overhead.     

移动自组织网络下基于跨层感知和邻居协作的视频分享方案

Fast resources discovery and high Quality of Service (QoS) guarantee are the key det-erminants for efficient Mobile P2P (MP2P) video sharing. In this paper, we propose a Cross- Layer and One-Hop Neighbour-Assisted Video Sharing (CNVS) solution in Mobile Ad Hoc Networks (MANETs). By making use of cross- layer approaches to bridge the overlay and the MAC layer and with the help of dissemination assisted by one-hop neighbours, CNVS intel-ligently builds the resource-centric self-organ-ization node cluster group. In order to meet the QoS requirement, by making use of video resources access cost model, each peer can disconnect a less efficient connection with the original supplier and choose a peer that pro-vides a low access cost as the new supplier. Simulation results also show how CNVS achi-eves lower average end-to-end delay, less ave-rage number of hops for video data delivery, lower routing overhead and packet loss rate, and higher network throughput than another state-of-the-art solution.     

VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming

Provisioning random access functions in peer-to-peer on-demand video streaming is challenging, due to not only the asynchronous user interactivity but also the unpredictability of group dynamics. In this paper, we propose VMesh, a distributed peer-to-peer video-on-demand (VoD) streaming scheme which efficiently supports random seeking functionality. In VMesh, videos are divided into segments and stored at peers' local storage in a distributed manner. An overlay mesh is built upon peers to support random forward/backward seek, pause and restart during playback. Our scheme takes advantage of the large aggregate storage capacity of peers to improve the segment supply so as to support efficient interactive commands in a scalable manner. Unlike previous work based on "cache-and-relay" mechanism, in our scheme, user interactivity such as random seeking performed by a peer does not break the connections between it and its children, and hence our scheme achieves better playback continuity. Through simulation, we show that our system achieves low startup and seeking latency under random user interactivity and peer join/leave which is a crucial requirement in an interactive VoD system.     

A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network

Peer-to-peer (P2P) live streaming over mobile ad hoc network (MANET) is a state-of-the-art technique for wireless multimedia applications, such as entertainments and disaster recovery. The peers share the live streaming over MANET via multi-hop wireless link, so an efficient data delivery scheme must be required. However, the high churn rate and the frequent mobility baffle the P2P membership management and overlay maintenance. The unreliable wireless connection of MANET leads to the difficulties of large-scale and real-time streaming distribution, and a lack of overlay proximity leads to the inefficient streaming delivery. We present a cross-layer design for P2P over MANET to manage and maintain the overlay, and select efficient routing path to multicast media streams. Our proposed scheme (COME-P2P) integrates both P2P DHT-based lookup and IPv6 routing header to improve the delivery efficiency. Through the cross-layer design, the low layer detects mobility for informing high layer to refine the finger table, and high layer maintains the efficient multicast path for informing low layer to refine the routing table. How to keep stable routing paths for live streaming via IPv6 routing is the main contribution of this paper. The overlay proximity can shorten routing propagation delay, and the hop-by-hop routing can avoid the traffic bottleneck. Through the mathematical analysis and simulation results, COME-P2P can be demonstrated to achieve high smoothness and reduce signaling overhead for live streaming.     

Analysis and modelling the effects of mobility,Churn rate,node’s life span,intermittent bandwidth and stabilization cost of finger table in structured mobile P2P networks

Today P2P (Peer-to-Peer) networks are gaining popularity for sharing the contents. Due to massive spreading of Internet, these networks are also growing fast. MP2P (Mobile P2P) networks are attracting many users due to increase in the Internet-based mobile applications. These networks suffer from many challenges which are not considered for analysis and modelling adequately. We focus on few challenges like mobility of users, churn rate, intermittent bandwidth, shorter life span of mobile nodes, stabilization of finger table, etc. in this paper. We analytically analyse these challenges and define the effects of different parameters over the performance. Traditional P2P protocols are designed for wired networks and when these are implemented for mobile networks then mobility effect of users adds more challenge for researchers. We select two types of mobility models namely FF (Fluid Flow) and RWP (Random Waypoint) models to model the users’ mobility. The churn rate of the mobile nodes makes network overlay management and content searching more difficult in MP2P networks. We select finger table-based protocols which are widely deployed in the P2P networks. But these protocols can’t perform well in the mobile P2P networks due to mobility of the users. The mobility of the users and churn rate of the mobile nodes create failure in lookup of finger table and induce more cost to update the finger table. We consider these challenges and quantify the failure rate of mobile nodes, life span of mobile nodes, available bandwidth, cost of stabilization of finger table per node, etc. in this proposal. The proposed model is useful for modelling the performance of MP2P networks performance in various wireless environments like Mobile Ad hoc Networks (MANETs), Wireless Mesh Networks (WMNs), Wireless Sensor Networks (WSNs), Vehicular Ad hoc Networks (VANETs), Wireless LAN (WLAN), Wireless MAN (WMAN), etc.

     

Rateless scalable video coding for overlay multisource streaming in MANETs

Recent advances in forward error correction and scalable video coding enable new approaches for robust, distributed streaming in Mobile Ad Hoc Networks (MANETs). This paper presents an approach for distribution of real time video by uncoordinated peer-to-peer relay or source nodes in an overlay network on top of a MANET. The approach proposed here allows for distributed, rate-distortion optimized transmission-rate allocation for competing scalable video streams at relay nodes in the overlay network. The approach has the desirable feature of path/source diversity that can be used for enhancing reliability in connectivity to serving nodes and/or attaining a higher throughput. The distributed approach reduces signaling overhead as well as avoiding scalability issues that come with centralized processing in MANETs. Results show a significant performance gain over both single-server systems and previously proposed multi-source systems.     

Inferring Network-Wide Quality in P2P Live Streaming Systems

This paper explores how to remotely monitor network-wide quality in mesh-pull P2P live streaming systems. Peers in such systems advertise to each other buffer maps which summarize the chunks of the video stream that they currently have cached and make available for sharing. We demonstrate how buffer maps can be exploited to monitor network-wide quality. We show that the information provided in a peer's advertised buffer map correlates with that peer's viewing-continuity and startup latency. Given this correlation, we remotely harvest buffer maps from many peers and then process these buffer maps to estimate the video playback quality. We apply this methodology to a popular P2P live streaming system, namely, PPLive. To harvest buffer maps, we build a buffer-map crawler and also deploy passive sniffing nodes. We process the harvested buffer maps and present results for network-wide playback continuity, startup latency, playback lags among peers, and chunk propagation patterns. The results show that this methodology can provide reasonably accurate estimates of ongoing video playback quality throughout the network.     

SVC-based multisource streaming for robust video transmission in mobile ad hoc networks

Emerging noninfrastructure-based network types like mobile ad-hoc networks (MANETs) are becoming suitable platforms for exchanging/sharing real-time video streams, because of recent progress in routing algorithms, throughput and transmission bit-rate. MANETs are characterized by highly dynamic behavior of the transmission routes and path outage probabilities. In this article a multisource streaming approach is presented to increase the robustness of real-time video transmission in MANETs. For that, video coding as well as channel coding techniques on the application layer are introduced, exploiting the multisource representation of the transferred media. Source coding is based on the scalable video coding (SVC) extension of H.264/MPEG4-AVC with different layers for assigning importance for transmission. Channel coding is based on a novel unequal packet loss protection (UPLP) scheme, which is based on Raptor forward error correction (FEC) codes. While in the presented approach, the reception of a single stream guarantees base quality only, the combined reception enables playback of video at full quality and/or lower error rates. Furthermore, an application layer protocol is introduced for supporting peer-to-peer based multisource streaming in MANETs     

Adaptive video protection in large scale peer‐to‐peer video streaming over mobile wireless mesh networks

Because video streaming over mobile handheld devices has been of great interest, the necessity of introducing new methods with low implementation cost and scalable infrastructures is a strong demand of the service. In particular, these requirements are present in popular wireless networks such as wireless mesh networks (WMN). Peer‐to‐peer (P2P) networks promise an efficient scalable network infrastructure for video streaming over wired and wireless networks. Limited resources of the peers in P2P networks and high error rate in wireless channels make it more challenging to run P2P streaming applications over WMNs. Therefore, it is necessary to design efficient and improved error protection methods in P2P video streaming applications over WMNs. In this paper, we propose a new adaptive unequal video protection method specially intended for large scale P2P video streaming over mobile WMNs. Using this method, different frames have different priorities in receivers along the recovery process. Moreover, we precisely and completely evaluate different aspects related to frame protection in these networks using five important performance metrics including video distortion, late arrival distortion, end‐to‐end delay, overhead and initial start‐up delay. The results obtained from a precise simulation in OMNeT++ show that the proposed adaptive method significantly outperforms other solutions by providing better video quality on mobile wireless nodes. Copyright © 2015 John Wiley & Sons, Ltd.     

Slack time–based scheduling scheme for live video streaming in P2P network

Nowadays, peer‐to‐peer network plays a significant role in data transfer and communication. The past few years have witnessed considerable growth in this area because of its inherent advantages. Peer‐to‐peer live streaming has a significant impact on video transmission over the Internet. Major factors that influence the performance of P2P live streaming are overlay construction and scheduling strategies. Although, a large number of scheduling schemes are developed but none of them is comprehensive enough to provide solutions to live streaming issues. These suffer from substantial delay and low video quality at the receiver side. In this paper, a new start‐up–based selection procedure and slack time–based scheduling scheme is proposed. The start‐up selection procedure defines the start‐up buffer location for new peer, and the scheduling scheme selects both the chunk and peers. The proposed scheduling scheme uses both push and pull priority–based strategies. The simulation results of the proposed approach demonstrates significant improvement in both the network performance and video quality at the receiver side. It is observed that playback delay, startup delay, and end‐to‐end delay in the network are reduced and quality of the video at receiver side is improved as the distortion and frame loss ratio is decreased.     

Robust mobile video streaming in a peer-to-peer system

In a peer-to-peer (P2P) video streaming system, peers not only consume video, but also route it to other peers in the system, where ordinary peers are assumed to have sufficient downlink speed and media capability. This assumption often fails when the P2P system consists of peers that are heterogeneous in their computing power, hardware, and media capability.In this paper, we address a problem of streaming video to mobile devices, which are less capable than ordinary peers. In order to stream video to mobile devices, transcoding is often required to render video suitable for their small display, limited downlink speed, and limited video decoding capability. However, performing transcoding at a single peer is vulnerable to peer churn, which leads to video disruption. We propose interleaved distributed transcoding (IDT), a robust video encoding scheme that allows peers more capable than mobile devices to perform transcoding in a collaborative fashion. IDT is designed in such a way that transcoded substreams are assembled into a single video stream, which can be decoded by any H.264/AVC baseline profile compliant decoder. Extensive simulations and its implementation in a real P2P system demonstrate that the proposed scheme not only reduces computational load at a peer, but also achieves robust streaming in the case of peer failure or packet loss due to adverse wireless channel conditions. We confirm this finding by analyzing the effect of distributed transcoding under peer failure.     

Towards Enhanced Searching Architecture for Unstructured Peer-to-Peer Over Mobile Ad Hoc Networks

With the rapid growth of individual mobile devices, the researchers are facing new challenges to deploy unstructured peer-to-peer (P2P) applications over mobile ad hoc networks (MANETs). Empirical studies indicates that although P2P and MANETs have similar preferences, but the resultant networks are not performing efficient and effective searching due to peer discovery, connectivity and mobility problems. To resolve these issues, the existing techniques mostly rely on flooding and random walks in P2P over MANETs to discover object of interest and thus introduce incredible network traffic. Thus, this article proposes Gnutella like unstructured P2P network to better meets the mobility requirement of ad hoc networks to optimize search performance. The proposed system presents a novel cache optimization technique and enhances ultrapeer selection scheme to make communication more efficient between peers and ultrapeer. Furthermore for quick and efficient search, we explore a novel jumping multiple walkers random walk approach with controlled replication. The proposed search mechanism not only reduces the effective query search time but also remarkably reduce network overhead. We validate our analysis and compare our proposal to competing protocols in simulations. Simulation results show that proposed scheme gives better performance than the competing protocols in terms of (1) the successful ratio of resolving a query, (2) the time and hop count of routing a query message, (3) the message overhead, and (4) average message response time.     

Distributed upload bandwidth assigning algorithm in P2P VoD system

In a peer-to-peer(P2P) live streaming system,each peer uses greedy strategy to download chunks as many as possible so as to assure smooth playback and promote the chunk propagation.However,diversity of video playback rate,heterogeneity of peer downlink bandwidth and no prefetching limitation determine that greedy strategy is not the best strategy for P2P video-on-demand(VoD) system though this strategy performs well in P2P live system.To reasonably assign upload bandwidth among peers,we first present a stochastic model to relate expected downloading speed(EDS) with buffered data amount(BDA,the amount of data has been fetched in buffer,however has not been played yet by the peer),video playback rate and fluency(the probability of no interruption in a viewing process).On the base of this model,we design an equal fluency bandwidth assigning algorithm(EFBAA).In this algorithm,requesting peers compute EDS according to several local parameters(such as BDA,video playback rate and fluency) dynamically and independently and send the EDS to neighbor peers together with buffer map.Then the neighbor peer proportionally partitions and assigns its upload bandwidth to requesting peers according to their EDS.Extensive simulations demonstrate that EFBAA outperforms greedy strategy in terms of server load and startup latency.     

Mitigating file‐sharing misbehavior with movement synchronization to increase end‐to‐end availability for delay sensitive streams in vehicular P2P devices

When dealing with wireless connectivity in a mobile peer‐to‐peer (MP2P) environment, there are many concerns about the offered efficiency and availability of the requested resources and concerns about practicality considerations. These considerations deal with the movement and deployment of continuous connectivity. The intermittent connectivity is a major factor for object sharing misbehavior because it aggravates the connectivity and reliability. MP2P environments are in need of specialized placement algorithms where structured index‐centric solutions will be able to provide efficiency and object location determination over intermittent connectivity and communication. Replication of any requested object and redundancy face the requests' failures because they create severe duplications, and aggravate the capacity of the end‐to‐end path. This work proposes a framework that enables mitigation between the file sharing misbehavior in contrast to the movement synchronization, and it quantifies the parameters that affect the end‐to‐end efficient transmission by taking into consideration the synchronization between moving peers to assign the requested resources in the end‐to‐end path. Resilience metrics are introduced to enable reliability in cooperative file sharing procedure. The proposed scheme considers synchronization and assignment of the moving mobile Infostation peer with certain object indices to a certain vehicle via a synchronized cooperative scheme where the file sharing process is performed through the message ferry mobile peer. In addition, a resource assignment cooperation engine is developed taking into consideration the social cooperation model and the end‐to‐end capacity of the relay path. The proposed resource exchange apparatus for file chunks' migration is performed to enable delay sensitive streaming. The proposed model is evaluated through experimental simulation taking measures for the throughput and the reliability offered and for the robustness for sharing resources of any capacity in dynamically changing MP2P wireless environments under synchronized movements. Copyright © 2012 John Wiley & Sons, Ltd.     

Modeling and application of moderate prefetching strategy based on video slicing for P2P VoD systems

In peer-to-peer (P2P) video-on-demand (VoD) streaming systems,each peer contributes a fixed amount of hard disk storage (usually 2 GB) to store viewed videos and then uploads them to other requesting p...     

A self‐adaptive algorithm for super‐peer selection considering the mobility of peers in cognitive mobile peer‐to‐peer networks

Cognitive peer‐to‐peer networks are obtained from a combination of cognitive networking concepts and peer‐to‐peer networks. These networks are able to improve their performance while operating under dynamic and unknown environments. A cognitive peer‐to‐peer network tries to learn an appropriate configuration for itself considering the unknown physical properties of peers. Cognitive mobile peer‐to‐peer networks refer to cognitive peer‐to‐peer networks which are built over mobile ad hoc networks. In these networks, heterogeneity of the mobility of peers and resource limitation in wireless networks create challenges for network management algorithms. Because of the dynamicity of these networks, the management algorithms should be designated in self‐adaptive manner. In one type of these networks, some peers, called super‐peers, undertake to perform network managerial tasks. The mobility of peers leads to connection failure among peers and reselection of new super‐peers. Therefore, the selection of super‐peers, due to their influential role, requires an algorithm that considers the peers' mobility. Up to now, no self‐adaptive algorithm has been designated for super‐peer selection considering the mobility of peers in a self‐adaptive manner. This paper proposes M‐SSBLA, a self‐adaptive algorithm for super‐peer selection considering the mobility of peers based on learning automata. The proposed algorithm is obtained from cooperation between a learning automata‐based cognitive engine and MIS. MIS is a well‐known super‐peer selection algorithm in mobile peer‐to‐peer networks. We compared the proposed algorithm with recently reported algorithms, especially for a network with high mobility. Simulation results show that the proposed algorithm can cover maximum ordinary‐peer with a few super‐peer and improve robustness against super‐peer failures while decreasing maintenance overhead.     

P2broadcast: a hierarchical clustering live video streaming system for P2P networks

This work describes a novel live video streaming system for P2P networks, referred to as P2broadcast. The video streaming service has bandwidth requirements to guarantee presentation quality. Therefore, a scalable strategy to quickly find a path from a media server to a client with abundant bandwidth is very important. A common approach in the literature is the bandwidth first (BF) scheme, which allows a newcomer to adopt a BF tree traversal scheme to find its parent peer on the P2P overlay tree to retrieve the media content. The BF scheme is likely to build a deep overlay tree, resulting in long start‐up latency as the number of peers on the overlay tree grows. P2broadcast reduces start‐up latency by organizing peers into hierarchical clusters and making the overlay tree become a ‘short‐and‐wide’ tree. The hierarchical clustering structure enables a newcomer to find its parent peer among the set of peers that are more likely to provide large available bandwidth only. Limiting the set of potential parent peers not only reduces start‐up latency but also improves the system availability. Additionally, unlike the BF scheme that only concerns available bandwidth, P2broadcast utilizes a cost function to evaluate the appropriateness of a potential parent peer. The cost function considers the depth of the newcomer on the overlay tree, making the overlay tree become a short‐and‐wide tree. In addition to start‐up latency reduction, the short‐and‐wide tree feature also alleviates the service interruption probability due to the leaving or failure of a peer. Our simulation results show that P2broadcast greatly outperforms the BF scheme in terms of system availability, and achieves around 66% savings in start‐up latency and 10% decrement in service interruption probability. Copyright © 2005 John Wiley & Sons, Ltd.     

服务感知的移动P2P流媒体系统视频片调度算法

与有线网络相比,目前移动互联网的带宽普遍较低.这种情况下,如果移动P2P流媒体系统中用户节点上行带宽的利用率不高,将会极大地加重视频源服务器的负载,增加播放延时.为了充分地利用移动节点的上行带宽,缩短播放延时,文中提出了服务感知的视频片调度算法,它由请求算法和服务算法两部分组成.请求节点会根据最近的服务状况动态地调整请求的片数,减少服务拥塞的发生.服务节点会根据请求的优先级合理地安排上传顺序,提高服务的效率.仿真结果表明,该算法很好地适应了移动网络带宽低的情况,能够提高上行带宽的利用率,缩短播放延时.     

P2P流媒体模型的资源传输机制

针对流媒体的点播和直播服务,提出了基于P2P的流媒体应用层多播和点播的解决方案,构建了基于超级节点和普通节点的两层体系结构的视频流媒体模型.描述了模型的总体结构,分析了资源传输机制.基于校园网对模型进行了测试,测试结果表明,模型能够实现基于流媒体应用的多点数据快速互传.