Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Efficient Mobile Sink Routing in Wireless Sensor Networks using Bipartite Graphs

Version 1 : Received: 27 April 2023 / Approved: 28 April 2023 / Online: 28 April 2023 (12:59:04 CEST)

A peer-reviewed article of this Preprint also exists.

Abu Taleb, A.; Abu Al-Haija, Q.; Odeh, A. Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs. Future Internet 2023, 15, 182. Abu Taleb, A.; Abu Al-Haija, Q.; Odeh, A. Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs. Future Internet 2023, 15, 182.

Abstract

Wireless sensor networks (WSNs) are a critical research area with numerous practical applications. WSNs are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As WSNs 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. 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

Wireless Sensor Networks (WSNs); Mobility Model; Mobile Sink; Bipartite Graph; Path Planning.

Subject

Computer Science and Mathematics, Computer Networks and Communications

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.