Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Computer Networksarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Computer Networks
Article . 2016 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2016
Data sources: DBLP
versions View all 2 versions
addClaim

An adaptive disorder-avoidance cooperative downloading method

Authors: Xiuxiu Wen; Guangsheng Feng; Huiqiang Wang; Hongwu Lv; Junyu Lin;

An adaptive disorder-avoidance cooperative downloading method

Abstract

Abstract Applications of heterogeneous wireless networks can help to achieve ubiquitous services. Cooperative downloading is a download technique used on cellular networks and wireless self-organized networks. It helps wireless users who are nearing the limits of their data plan to download data from the Internet. However, the existing studies on cooperative downloading techniques omit the problem of data disorder. Data disorder can decrease the quality of services experienced by users and increase memory usage. In this paper, we model cooperative downloading using queue theory and propose a calculation method for solving data disorder and decreasing download time. Based on the calculation method, an adaptive disorder-avoidance cooperative downloading method is proposed. The method consists of two parts: an adaptive task dissemination algorithm and a dynamic task delay prediction mechanism. The algorithm is implemented based on the calculation method that takes into account the dynamic features of wireless networks. We also propose a prediction model based on neural network learning and moving average, then use the model in the prediction mechanism to enhance the performance of the proposed method in scenarios with dynamic download rates. We used Network Simulation version 2 for the simulation, and simulation results show that the proposed method can solve the data disorder problem and be adapted to mobile scenarios. Furthermore, it can decrease the download time.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!