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

An estimated Hungarian method for data forwarding problem in underwater wireless sensor networks

Author

Listed:
  • Jing Wen
  • Dongwei Li
  • Linfeng Liu
  • Jiabin Yuan

Abstract

With the increasing concern over marine applications in recent years, the technology of underwater wireless sensor networks has received considerable attention. In underwater wireless sensor networks, the gathered data are sent to terrestrial control center through multi-hops for further processing. Underwater wireless sensor networks usually consist of three types of nodes: ordinary nodes, anchor nodes, and sink nodes. The data messages are transferred from an ordinary node or an anchored node to one of the sink nodes by discrete hops. Data forwarding algorithms are at the core position of underwater wireless sensor networks, which determines data in what way to forward. However, the existing data forwarding algorithms all have problems that transmission delay is too high and delivery ratio is low. Thus, we propose a data forwarding algorithm based on estimated Hungarian method to improve delivery ratio and reduce transmission delay. The estimated Hungarian method is applied to solve the assignment problem in data forwarding process, where the anchor nodes receive the forwarding requests from ordinary nodes and optimize the waiting queue. By applying this method in underwater wireless sensor networks, data forwarding has great advantages in success rate and transmission delay, which has been validated by both analysis and simulation results.

Suggested Citation

  • Jing Wen & Dongwei Li & Linfeng Liu & Jiabin Yuan, 2018. "An estimated Hungarian method for data forwarding problem in underwater wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 14(5), pages 15501477187, May.
  • Handle: RePEc:sae:intdis:v:14:y:2018:i:5:p:1550147718772538
    DOI: 10.1177/1550147718772538
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1177/1550147718772538?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:14:y:2018:i:5:p:1550147718772538. 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.