IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v12y2016i3p3028642.html
   My bibliography  Save this article

Cooperative Downloading in Mobile Ad Hoc Networks: A Cost-Energy Perspective

Author

Listed:
  • He Li
  • Yang Yang
  • Xuesong Qiu
  • Zhipeng Gao
  • Guizhen Ma

Abstract

Cooperative downloading in mobile ad hoc networks is an effective way to improve the efficiency of downloading files. This work addresses the problem while distributing content to a group of mobile terminals (MTs) that cooperate during the download process by forming mobile ad hoc networks. However, the efficiency, cost, and energy consumption of cooperative downloading are sensitive by content distribution, which is a challenge to get the optimal in mobile ad hoc networks. This paper proposes a cost distribution (OCD) algorithm and a content distribution algorithm based on auction (OCDA) for mobile ad hoc networks based on relative location of nodes and local optimization theory. In order to make cooperative users take part when the downloading is beginning, several rounds of content distribution approach are designed based on users' relative location in the cooperative ad hoc network. To satisfy users' personal demands, the paper also designs a local optimization mechanism based on cost and energy. The simulation results show that the cost and content distribution method can achieve better performance, higher downloading efficiency, and lower energy consumption than the self-organized market algorithm (SOMA) and the average distribution algorithm (ADA).

Suggested Citation

  • He Li & Yang Yang & Xuesong Qiu & Zhipeng Gao & Guizhen Ma, 2016. "Cooperative Downloading in Mobile Ad Hoc Networks: A Cost-Energy Perspective," International Journal of Distributed Sensor Networks, , vol. 12(3), pages 3028642-302, March.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:3:p:3028642
    DOI: 10.1155/2016/3028642
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/3028642
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/3028642?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:12:y:2016:i:3:p:3028642. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.