Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs
Anas Abu Taleb,
Qasem Abu Al-Haija () and
Ammar Odeh
Additional contact information
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
Future Internet, 2023, vol. 15, issue 5, 1-17
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.
Keywords: bipartite graph; mobility model; mobile sink; path planning; wireless sensor networks (W.S.N.s) (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/1999-5903/15/5/182/pdf (application/pdf)
https://www.mdpi.com/1999-5903/15/5/182/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:15:y:2023:i:5:p:182-:d:1146650
Access Statistics for this article
Future Internet is currently edited by Ms. Grace You
More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().