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

An optimal multiple stopping rule–based cooperative downloading scheme in vehicular cyber-physical systems

Author

Listed:
  • Tao Jing
  • Cheng Zeng
  • Jin Qian
  • Zhen Li
  • Yan Huo

Abstract

In vehicular cyber-physical systems, vehicular users are the edge nodes which are far away from the network core. Content accessing and downloading for vehicular users are expected to heavily rely on the deployment of RoadSide Units in vehicular cyber-physical systems. Although vehicular users can obtain a good content downloading service in the coverage of RoadSide Units, user experience will get worse in highway scenarios, where RoadSide Units are sparsely deployed at service areas or gas stations. In other words, the download process has a property of intermittent connectivity because many no-signal areas (dark areas) exist on the road. In this article, we try to address such shortcomings by exploiting other edge nodes (vehicles) to download contents for clients in dark areas. Considering the cooperation intention of vehicles, we first propose an incentive mechanism to stimulate vehicles to participate in cooperative downloading. Next, with an objective of maximizing the utilization of benefits, we formulate the cooperative vehicle selection problem as an optimal multiple stopping problem and derive the optimal multiple stopping rule for cooperative downloading. Finally, an extensive simulation study has been performed to investigate the effectiveness of our scheme. The results reveal the impact of different parameters on system requirements and demonstrate that the proposed scheme can maximize the throughput of content downloading in dark areas.

Suggested Citation

  • Tao Jing & Cheng Zeng & Jin Qian & Zhen Li & Yan Huo, 2017. "An optimal multiple stopping rule–based cooperative downloading scheme in vehicular cyber-physical systems," International Journal of Distributed Sensor Networks, , vol. 13(3), pages 15501477176, March.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:3:p:1550147717699840
    DOI: 10.1177/1550147717699840
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717699840
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717699840?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
    ---><---

    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:13:y:2017:i:3:p:1550147717699840. 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.