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

Deadline Aware Retransmission Threshold Setting Protocol in Cyber-Physical Systems

Author

Listed:
  • Ran Bi
  • Jianzhong Li
  • Hong Gao
  • Quan Chen

Abstract

Many time-sensitive applications impose high requirement on real-time response. There exist many algorithms and routing protocols for efficient data packet delivery. However, previous works set the same retransmission threshold for all the relay nodes along a delivery path. The method decreases the probability of a packet being transmitted through the delivery path within given deadline. In this paper, we focus on finding the optimal retransmission thresholds for the relay nodes, such that the summation of the probability of a packet being transmitted to the next relay node or destination node within the specified deadline is maximized. A distributed greedy algorithm that can be run on sensor node is proposed, which enables the sensor node to adaptively set the optimal retransmission threshold. To avoid dropping the packet forwarded to the destination within given deadline with high probability, we develop a packet dropped protocol based on probabilistic delay bound. Experimental results show that the proposed protocols have better performance.

Suggested Citation

  • Ran Bi & Jianzhong Li & Hong Gao & Quan Chen, 2015. "Deadline Aware Retransmission Threshold Setting Protocol in Cyber-Physical Systems," International Journal of Distributed Sensor Networks, , vol. 11(9), pages 271259-2712, September.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:9:p:271259
    DOI: 10.1155/2015/271259
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/271259
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/271259?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:11:y:2015:i:9:p:271259. 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.