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: | Anas Abu Taleb, Qasem Abu Al-Haija, Ammar Odeh |
---|---|
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 |
Similar Items
-
Optimal Cluster Head Positioning Algorithm for Wireless Sensor Networks
by: Ala’ Khalifeh, et al.
Published: (2020-07-01) -
Chromaticity of Certain Bipartite Graphs
by: Hasni @ Abdullah, Roslan
Published: (2005) -
The Bipartite-Splittance of a Bipartite Graph
by: Yin Jian-Hua, et al.
Published: (2019-02-01) -
A Comparative Analysis of Various Mobile Sink Routing Protocols and Performance Comparison of Clustered Routing Protocols in Mobile Sink Scenario
by: Deepak Sethi, et al.
Published: (2024-02-01) -
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01)