A novel Asanoha-inspired method for optimal path planning of multiple mobile sinks Online publication date: Mon, 15-Jul-2024
by Amit Kumar Keshari; Kumar Nitesh; Bhaskar Karn
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 46, No. 3, 2024
Abstract: In wireless sensor networks (𝕎𝕊ℕs), mobile sinks (𝕄𝕊s) act as information collectors, relieving the hot spot problem (ℍ𝕊ℙ) and reducing energy usage in sensor nodes (𝕊ℕs). To avoid hot spots problem, an MS travels inside a target region (𝕋ℝ) and stops at predetermined rendezvous points (ℝℙs) to collect data from surrounding 𝕊ℕs. By leveraging multiple mobile sinks (𝕄𝕄𝕊s), this study proposes a way for alleviating the hot spot problem to increase the network lifespan. The TR is divided into sub-regions (𝕊ℝs) using the k-means clustering method, and each 𝕊ℝ is assigned an 𝕄𝕊. Within each 𝕊ℝ, the Asanoha pattern is employed to configure likely ℝℙ prediction. The final set of RPs is chosen after optimisation of numerous criteria impacting 𝕄𝕊 performance. The proposed approach is tested using simulation and compared to existing methods in terms of performance metrics such as the number of ℝℙs, route length, and average waiting time. These analyses are conducted across a range of 𝕊ℕs and communication ranges.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com