Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs
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, th...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-05-01
|
| Series: | Future Internet |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-5903/15/5/182 |
| _version_ | 1827741244225224704 |
|---|---|
| author | Anas Abu Taleb Qasem Abu Al-Haija Ammar Odeh |
| author_facet | Anas Abu Taleb Qasem Abu Al-Haija Ammar Odeh |
| author_sort | Anas Abu Taleb |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-11T03:42:57Z |
| format | Article |
| id | doaj.art-bc90d58826994b60a635263e462ccaee |
| institution | Directory Open Access Journal |
| issn | 1999-5903 |
| language | English |
| last_indexed | 2024-03-11T03:42:57Z |
| publishDate | 2023-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Future Internet |
| spelling | doaj.art-bc90d58826994b60a635263e462ccaee2023-11-18T01:27:13ZengMDPI AGFuture Internet1999-59032023-05-0115518210.3390/fi15050182Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite GraphsAnas Abu Taleb0Qasem Abu Al-Haija1Ammar Odeh2Department of Computer Science/Cybersecurity, Princess Sumaya University of Technology, Amman 1196, JordanDepartment of Computer Science/Cybersecurity, Princess Sumaya University of Technology, Amman 1196, JordanDepartment of Computer Science/Cybersecurity, Princess Sumaya University of Technology, Amman 1196, JordanWireless 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.https://www.mdpi.com/1999-5903/15/5/182bipartite graphmobility modelmobile sinkpath planningwireless sensor networks (W.S.N.s) |
| spellingShingle | Anas Abu Taleb Qasem Abu Al-Haija Ammar Odeh Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs Future Internet bipartite graph mobility model mobile sink path planning wireless sensor networks (W.S.N.s) |
| title | Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs |
| title_full | Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs |
| title_fullStr | Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs |
| title_full_unstemmed | Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs |
| title_short | Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs |
| title_sort | efficient mobile sink routing in wireless sensor networks using bipartite graphs |
| topic | bipartite graph mobility model mobile sink path planning wireless sensor networks (W.S.N.s) |
| url | https://www.mdpi.com/1999-5903/15/5/182 |
| work_keys_str_mv | AT anasabutaleb efficientmobilesinkroutinginwirelesssensornetworksusingbipartitegraphs AT qasemabualhaija efficientmobilesinkroutinginwirelesssensornetworksusingbipartitegraphs AT ammarodeh efficientmobilesinkroutinginwirelesssensornetworksusingbipartitegraphs |