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

A Reliable Transport Protocol with Prediction Mechanism for Urgent Information in Wireless Sensor Networks

Author

Listed:
  • Zhenchun Wei
  • Lin Feng
  • Jianghong Han
  • Xiangwei Xu
  • Hao Peng

Abstract

A reliable transport protocol with prediction mechanism for urgent information (PMUI) in WSNs is proposed. With PMUI, which is based on RTP-UI, the congestion control mechanism is improved, and the priority control and prediction mechanisms are adopted by taking the current queue length with change rate and expected queue length with remaining length together into consideration. The congestion status of current queue is analyzed and the changing trend of the next cycle of the queue is predicted as well. In order to evaluate the degree of congestion, state machine is adopted. Working states of WSNs are classified into eight states in accordance with different degrees of congestion. According to the change rate of a queue and the expected change rate of a queue, different rate adjustment mechanisms and bandwidth allocation schemes based on different working states are developed. Simulation results show that PMUI is lower than RTP-UI in both packet loss rate and the average delay for reliable transmission of urgent information.

Suggested Citation

  • Zhenchun Wei & Lin Feng & Jianghong Han & Xiangwei Xu & Hao Peng, 2013. "A Reliable Transport Protocol with Prediction Mechanism for Urgent Information in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 282340-2823, December.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:282340
    DOI: 10.1155/2013/282340
    as

    Download full text from publisher

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