Cited by 233IoT and Edge/Fog ComputingBlockchain Technology Applications and SecurityCaching and Content Delivery

Distributed resource allocation in blockchain-based video streaming systems with mobile edge computing

Liu, Mengting, Yu, F. Richard, Teng, Yinglei, Leung, Victor C. M., Song, Mei·2019·IEEE Transactions on Wireless Communications

Abstract

Blockchain-based video streaming systems aim to build decentralized peer-to-peer networks with flexible monetization mechanisms for video streaming services. On these blockchain-based platforms, video transcoding, which is computationally intensive and time-consuming, is still a major challenge. Meanwhile, the block size of the underlying blockchain has significant impacts on the system performance. Therefore, this paper proposes a novel blockchain-based framework with an adaptive block size for video streaming with mobile edge computing (MEC). First, we design an incentive mechanism to facilitate collaboration among content creators, video transcoders, and consumers. In addition, we present a block size adaptation scheme for blockchain-based video streaming. Moreover, we consider two offloading modes, i.e., offloading to the nearby MEC nodes or a group of device-to-device (D2D) users, to avoid the overload of MEC nodes. Then, we formulate the issues of resource allocation, scheduling of offloading, and adaptive block size as an optimization problem. We employ a low-complexity alternating direction method of the multipliers-based algorithm to solve the problem in a distributed fashion. Simulation results are presented to show the effectiveness of the proposed scheme.

Integrity signals

Registry

Crossref · 10.1109/twc.2018.2885266

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Centralized architectures for spectrum sharing add single-point-of-failure bottlenecks when the authority is attacked or out of service, leading to disruption of the entire spectrum sharing network.

    “Importantly, the use of such centralized architectures also adds single-of-failure bottlenecks when the authority is attacked or out of services, which leads to the disruption of the entire spectrum sharing network [147].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Liu, M., Yu, F. R., Teng, Y., Leung, V. C. M., & Song, M.
Affiliations
  • Beijing University of Posts and Telecommunications (CN)
  • Carleton University (CA)
  • University of British Columbia (CA)
Venue
IEEE Transactions on Wireless Communications
Published
2019-01
Volume
18
Issue
1
Pages
695-708
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W2905357302
Cited by
233
References
27
Citations by year
2026: 6 · 2025: 10 · 2024: 18 · 2023: 36 · 2022: 42 · 2021: 37 · 2020: 52 · 2019: 32
FWCI
18.73
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Wireless Communications (publishedVersion)
Funders
  • National Key R&D Program of China (2018YFB1201500)
  • National Natural Science Foundation of China (61771072, 61427801)
  • Natural Science Foundation of Beijing Municipality (L171011)
  • Beijing Major Science and Technology Special Projects (Z181100003118012)
  • China Scholarship Council (201706470059)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
Keywords
mobile edge computing, video transcoding, adaptive block size, incentive mechanisms, device-to-device communication, distributed resource allocation, alternating direction method of multipliers, peer-to-peer streaming

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review