scispace - formally typeset
Proceedings ArticleDOI

Vanets: Case Study of a Peer-to-Peer Video Conferencing System

Reads0
Chats0
TLDR
Vanets is presented, a P2P based video conferencing system that takes advantage of transcoding to optimally allocate streaming rates for all participating peers and distinguishes between active and passive participants and enhances the video quality of the active participant.
Abstract
Peer-to-peer (P2P) is a powerful platform for a variety of multimedia streaming applications over the Internet such as video-on-demand, video conferencing, live broadcasting, etc. A P2P system is extremely cost-effective since it utilizes the resources (CPU cycles, storage space, and uplink bandwidth) of peer machines. Recently, there has been significant development in desiging video conferencing systems. Video conferencing requires substantial network bandwidth in order to be able to transport high volume video data. This is particularly true for multiparty (MP) video conferencing system. One way to address the demand of high bandwidth is to use a network-based device called Multipoint Control Units (MCU). However, MCUs’ high cost and maintenance complexities make it only feasible for large business enterprises. Alternatively, the low cost P2P video conferencing services allow participants to establish pair-wise video communication. However, using this technology in a MP video conferencing system greatly reduces the video quality experienced by the user. The decentralized and shared bandwidth nature of a P2P network, therefore, makes it an effective choice for implementing video conferencing applications. In this work we present Vanets, a P2P based video conferencing system that takes advantage of transcoding to optimally allocate streaming rates for all participating peers. Our solution distinguishes between active and passive participants and enhances the video quality of the active participant. The remainder of this proposal is organized as follows. In Sec. II, we present an overview of the Vanets interface, network model, tree construction algorithm, and video adaptation procedure. In Sec. III we present our demonstration plan.

read more

Citations
More filters
Proceedings ArticleDOI

Cooperative spectrum management in cognitive Vehicular Ad Hoc Networks

TL;DR: An experimental study of the spectrum availability and sensing accuracy in a moving vehicle and a collaborative spectrum management framework, called Cog-V2V, which allows the vehicles to share spectrum information, and to detect spectrum opportunities in the licensed band are proposed.
Proceedings ArticleDOI

Modeling and simulation of WAVE 1609.4-based multi-channel vehicular ad hoc networks

TL;DR: The suggested algorithms are shown to greatly improve packet delivery ratio and delay of safety applications in single and multi-hop topologies, while preserving the synchronization scheme of the IEEE 1609.4 protocol.
DissertationDOI

Video Streaming and Multimedia Broadcasting Over Vehicular Ad Hoc Networks

TL;DR: A new hybrid video dissemination protocol is proposed that outperforms other protocols in term of delivery ratio and complies with other quality-of-service requirements for video broadcasting over vehicular environments.

Video Conferencing Guidelines for Faculty and Students in Graduate Online Courses

TL;DR: In this paper, a self-evaluation study was conducted with faculty who teach online graduate courses, and a set of video conferencing guidelines was created based on the results of this study together with published Netiquette guidelines and a survey of other extant literature.
Proceedings ArticleDOI

Peer-to-peer file sharing in VANETs using TC-MAC

TL;DR: This work aims to develop a P2P file sharing algorithm to improve the file downloading time between neighbouring vehicles and uses Time-Division Multiple Access slot reservation based on clustering of vehicles.
References
More filters
Proceedings ArticleDOI

Utility maximization in peer-to-peer systems

TL;DR: For certain classes of popular P2P topologies, it is shown that routing along a linear number of trees per source can achieve the largest rate region that can be possibly obtained by (multi-source) network coding.