IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v15y2023i5p182-d1146650.html
   My bibliography  Save this article

Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs

Author

Listed:
  • Anas Abu Taleb

    (Department of Computer Science/Cybersecurity, Princess Sumaya University of Technology, Amman 1196, Jordan)

  • Qasem Abu Al-Haija

    (Department of Computer Science/Cybersecurity, Princess Sumaya University of Technology, Amman 1196, Jordan)

  • Ammar Odeh

    (Department of Computer Science/Cybersecurity, Princess Sumaya University of Technology, Amman 1196, Jordan)

Abstract

Wireless sensor networks (W.S.N.s) are a critical research area with numerous practical applications. W.S.N.s are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As W.S.N.s advance and become more sophisticated, they offer limitless opportunities for innovative solutions in various fields. However, due to their unattended nature, it is essential to develop strategies to improve their performance without draining the battery power of the sensor nodes, which is their most valuable resource. This paper proposes a novel sink mobility model based on constructing a bipartite graph from a deployed wireless sensor network. The proposed model uses bipartite graph properties to derive a controlled mobility model for the mobile sink. As a result, stationary nodes will be visited and planned to reduce routing overhead and enhance the network’s performance. Using the bipartite graph’s properties, the mobile sink node can visit stationary sensor nodes in an optimal way to collect data and transmit it to the base station. We evaluated the proposed approach through simulations using the NS-2 simulator to investigate the performance of wireless sensor networks when adopting this mobility model. Our results show that using the proposed approach can significantly enhance the performance of wireless sensor networks while conserving the energy of the sensor nodes.

Suggested Citation

  • Anas Abu Taleb & Qasem Abu Al-Haija & Ammar Odeh, 2023. "Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs," Future Internet, MDPI, vol. 15(5), pages 1-17, May.
  • Handle: RePEc:gam:jftint:v:15:y:2023:i:5:p:182-:d:1146650
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/15/5/182/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/15/5/182/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Xiaofeng Wu & Zhuangqi Chen & Yi Zhong & Hui Zhu & Pingjian Zhang, 2022. "End-to-end data collection strategy using mobile sink in wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 18(3), pages 15501329221, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guduri Sulakshana & Govardhan Reddy Kamatam, 2023. "Energy-aware mobile sink visiting nodes selection using a mean-shift clustering strategy for data accumulation in WSNs," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 84(2), pages 215-233, October.

    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:gam:jftint:v:15:y:2023:i:5:p:182-:d:1146650. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.