Utilizing minimum spanning trees for effective mobile sink routing in wireless sensor networks

Abstract

With many practical applications, wireless sensor networks (WSNs) represent an important field of study. Real-world applications of WSNs include smart home automation, healthcare, agriculture, industrial automation, and environmental monitoring. WSNs present countless chances for creative solutions across various industries as they develop and become more sophisticated. But because they are unattended, we must devise ways to make them work better without using the sensor nodes’ most important resource—battery power. A unique sink mobility model from a deployed WSN is proposed in this paper, based on constructing a minimal Spanning tree. The proposed approach derives a controlled movement model for the mobile sink based on minimal spanning tree (MST) features. Consequently, fixed nodes will be scheduled and visited to save routing overhead and improve network efficiency. Using the properties of the minimal spanning tree, the moving sink node can visit immobile sensor nodes, which is the most effective approach to gather data and send it to the base station. The effectiveness of WSNs was examined when implementing this mobility model, and we used the NS-2 simulator to run simulations to assess how efficiently the suggested strategy performed. Our findings demonstrate that WSN performance can be significantly enhanced by implementing the proposed method.