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

A routing-benefited deployment approach combining static and dynamic layouts for underwater optical wireless networks

Author

Listed:
  • Zhongwei Shen
  • Hongxi Yin
  • Yanjun Liang
  • Rigele Maao
  • Lianyou Jing

Abstract

A routing-benefited deployment algorithm combining static and dynamic layouts is proposed, and its comprehensive performance evaluation is given in this article. The proposed routing-benefited deployment algorithm is intended to provide a suitable network deployment and subsequent data transmission approach for underwater optical networking and communication. Static nodes are anchored for long-term monitoring, and movable nodes can adjust their depths based on the virtual force and move with the variation of area-of-interest changing. Then, nodes begin to collect data that they can monitor and transmit to sink nodes. Here, the underwater wireless optical communication model is described to actualize the real environment, and the vector-based forwarding protocol is particularly considered to compare the impact of different deployment algorithms on routing. It is shown by simulation experiment results that routing-benefited deployment algorithm outperforms several existing traditional virtual force deployment algorithms in terms of coverage, lifetime, energy consumption balance, packet-loss rate, and time-delay.

Suggested Citation

  • Zhongwei Shen & Hongxi Yin & Yanjun Liang & Rigele Maao & Lianyou Jing, 2021. "A routing-benefited deployment approach combining static and dynamic layouts for underwater optical wireless networks," International Journal of Distributed Sensor Networks, , vol. 17(2), pages 15501477219, February.
    • Handle: RePEc:sae:intdis:v:17:y:2021:i:2:p:1550147721999614
    DOI: 10.1177/1550147721999614
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147721999614
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147721999614?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:17:y:2021:i:2:p:1550147721999614. 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.