Skip to content
naulon
Not checkedNot checked for notices yet.

Quality of Video Oriented and Multi-Meeting Based Routing Algorithm for Video Data Offloading

Honghai Wu, Huahong Ma, Ling Xing and 1 more

IEEE Access · 2018

doi:10.1109/access.2018.2852773 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The increasing popularity of video delivery among mobile users makes the problem of explosive traffic growth becoming more and more serious for traditional wireless networks, and video transmission-based on device-to-device communication through mobile opportunistic networks (MONs) is regarded as an ideal way to resolve this issue. However, data transmission in the MONs is mainly through the two ways: data replication and data forwarding. Thus, to achieve high delivery ratio and low delivery delay, data replication is usually excessively exploited, and the large number of redundant replicas will not only consume large amount of nodal resource but also greatly increase the overload of networks. For video transmission, this issue becomes more severe for its volume and continuity. Thus, in this paper, we propose a novel routing scheme for video data transmission in the MONs, namely, video routing-based multi-player cooperative game which can maximize the quality of reconstructed video data while minimizing the overhead of nodal and network resources. Specifically, we first construct the marginal gain model for video delivery quality, and then model the video data transmission among multiple encounters as a multi-player cooperative game. Under the guidance of the Nash equilibrium theory, the video data carried by these encountering nodes is adaptively and optimally re-assigned among them. Extensive simulations based on real-life mobility traces and synthetic traces have validated the effectiveness of the proposed routing algorithm.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.