Efficient Massive Contents Distribution Strategy for P2P Using Sensor Smart Network

Clicks: 111
ID: 100069
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #60 of 73 articles by views in international journal of distributed sensor networks

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
An important problem in many P2P applications is how to efficiently disseminate massive contents from multiple sources to multiple receivers on the Internet. A successful model used for analyzing this problem is a graph that consisted of nodes and edges, with a capacity assigned to each edge. However, a scheme that can flexibly deal with the extreme network dynamic is required in order to realize the massive contents streaming service, because P2P networks are mostly formed in random fashion without good control of their topology. In this paper, we design and implement a scheme for the problem of efficient massive contents dissemination in a sensor smart network system.
Reference Key
kang2015efficientinternational Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Kang, Mi-Young;Nam, Ji-Seung;
Journal international journal of distributed sensor networks
Year 2015
DOI
DOI not found
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.