Abstract
Wireless Sensor Networks (WSNs) often operate in hostile environments and are subject to frequent failures. Failure of multiple sensor nodes causes the network to split into disjoint segments, which leads to network partitioning. Federating these disjoint segments is necessary to prevent detrimental effects on WSN applications. This paper investigates a recovery strategy using mobile relay nodes (MD-carrier) for restoring network connectivity. The proposed MD-carrier Tour Planning (MDTP) approach restores network connectivity of partitioned WSNs with reduced tour length and latency. For this reason, failure nodes are identified, and disjoint segments are formed with the k-means algorithm. Then, the Analytic Hierarchy Process (AHP) and the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) are used for the election of an AGgregator Node (AGN) for each segment. Furthermore, an algorithm for identifying sojourn locations is proposed, which coordinates the maximum number of AGNs. Choosing the sojourn locations is a challenging task in WSN since the incorrect selection of the sojourn locations would degrade its data collection process. This paper uses the nature-inspired meta-heuristic Donkey And Smuggler Optimization (DASO) algorithm to compute the optimal touring path. MDTP reduces tour length and latency by an average of 30.28% & 24.56% compared to existing approaches.
Similar content being viewed by others
References
Rodrigues L, Goncalves I, Fe I, Endo PT, Silva FA (2021) Performance and availability evaluation of smart hospital architecture. Computing 103:2401–2435
Alireza F, Reza F, Javad R, Roberto M (2021) Application of internet of things and artificial intelligence for smart fitness: a survey. Comput Netw 189:107859
Borza PN, Machedon-Pisu M, Hamza-Lup F (2019) Design of wireless sensors for iot with energy storage and communication channel heterogeneity. Sensors 19(15):3364
Sheetal G, Marco Z, Bharat SC (2021) Towards green computing: intelligent bio-inspired agent for IoT-enabled wireless sensor networks. Int J Sens Netw 35(2):121–131
Shiny SSG, Priya SS, Murugan K (2021) Repeated game theory-based reducer selection strategy for energy management in SDWSN. Comput Netw 193:108094
Priyadarshi R, Gupta B, Anurag A (2020) Deployment techniques in wireless sensor networks: a survey, classification, challenges, and future research issues. J Supercomput 76:7333–7373
Thanigaivelu K, Murugan K (2012) Grid-based clustering with dual cluster heads to alleviate energy hole problem for non-uniform node distribution in wireless sensor networks. Int J Mob Netw Des Innov 4(1):3–13
El Khediri S (2022) Wireless sensor networks: a survey, categorization, main issues, and future orientations for clustering protocols. Computing 104:1775–1837
Behera TM, Mohapatra SK (2021) A novel scheme for mitigation of energy hole problem in wireless sensor network for military application. Int J Commun Syst 34(11):e4886
Sreedevi P, Venkateswarlu S (2022) A fault tolerant optimal relay node selection algorithm for Wireless Sensor Networks using modified PSO. Pervasive Mob Comput 85:101642
Ramesh K, Amgoth T (2020) Adaptive cluster-based relay-node placement for disjoint wireless sensor networks. Wirel Netw 26(1):651–666
Rajeswari G, Murugan K (2020) Healing of large-scale failures in WSN by the effectual placement of relay nodes. IET Commun 14(17):3030–3038
Ye M, Qiu H, Wang M, Wang Y, Feng H (2019) A new path planning strategy of a data collection problem utilising multi-mobile nodes in wireless sensor networks. Int J Sens Netw 29(3):192–202
Irish AE, Terence S, Immaculate J (2019) Efficient data collection using dynamic mobile sink in wireless sensor network. Wire Commun Netw Int Things, LNEE Springer 493:141–149
Huang H, Huang C, Ma D (2019) The cluster based compressive data collection for wireless sensor networks with a mobile sink. AEU - Int J Electron Commun 108:206–214
Farzinvash L, Najjar-Ghabel S, Javadzadeh T (2019) A distributed and energy-efficient approach for collecting emergency data in wireless sensor networks with mobile sinks. AEU - Int J Electron Commun 108:79–86
Shamsaldin AS, Rashid TA, Al-Rashid Agha RA, Al-Salihi NK, Mohammadi M (2019) Donkey and smuggler optimization algorithm: a collaborative working approach to path finding. J Comput Des Eng 6(4):562–583
Ramesh K, Amgoth T, Das D (2020) Obstacle-aware connectivity establishment in wireless sensor networks. IEEE Sens J 21(4):5543–5552
Liu X, Qiu T, Zhou X et al (2020) Latency-aware path planning for disconnected sensor networks with mobile sinks. IEEE Trans Industr Inform 16(1):350–361
Xuxun L, Lin P, Liu T et al (2022) Objective-variable tour planning for mobile data collection in partitioned sensor networks. IEEE Trans Mob Comput 21(1):239–251
Jin W, Xiujian G, Wei L et al (2019) An empower hamilton loop based data collection algorithm with mobile agent for WSNs. Hum Cent Comput Inf Sci 9(18):1–14
Sapre S, Mini S (2021) A differential moth flame optimization algorithm for mobile sink trajectory: Peer-to-Peer. NetwNetwNetwNetw Appl 14:44–75
Naween K, Dash D (2020) Flow based efficient data gathering in wireless sensor network using path-constrained mobile sink. J Ambient Intell Humaniz Comput 11:1163–1175
Huang H, Huang C, Ma D (2019) The cluster based compressive data collection for wireless sensor networks with a mobile sink. AEU - Int J Electron Commun 108:206–214
Pang A, Chao F, Zhou H et al (2020) The method of data collection based on multiple mobile nodes for wireless sensor network. IEEE Access 8:14704–14713
Mazumdar N, Roy S, Nag A et al (2021) An adaptive hierarchical data dissemination mechanism for mobile data collector enabled dynamic wireless sensor network. J Netw Comput Appl 186:103097
Yogarajan G, Revathi T (2018) Nature inspired discrete firefly algorithm for optimal mobile data gathering in wireless sensor networks. Wirel Netw 24(8):2993–3007
Verma S, Sood N, Sharma AK (2019) A novelistic approach for energy efficient routing using single and multiple data sinks in heterogeneous wireless sensor network. Peer-to-Peer Netw Appl 12(5):1110–1136
Liu X, Qiu T, Dai B et al (2020) Swarm intelligence-based rendezvous selection via edge computing for mobile sensor networks. IEEE Int Things J 7(10):9471–9480
Singh S (2020) An energy aware clustering and data gathering technique based on nature inspired optimization in WSNs. Peer-to-Peer Netw Appl 13(5):1357–1374
Tomic S, Beko M, Dinis R, Montezuma P (2017) Distributed algorithm for target localization in wireless sensor networks using RSS and AoA measurements. Pervasive Mob Comput 37:63–77
Yanling L, Jingshan W, Shunyan L et al. (2020) A K-means Clustering Optimization Algorithm for Spatiotemporal Trajectory Data, International Conference on Human Centered Computing (HCC), LNCS Springer, Cham. 12634:103 – 113
Xue H, Zhang W, Ni C et al (2021) Cross product and partitioned filtering-based graham convex hull for buoy drifting area demarcating. Sci Program 2021:1–9
Saaty TL (1980) The Analytic Hierarchy Process. McGraw-Hill, New York
Khanmohammadi E, Barekatain B, Quintana AA (2021) An enhanced AHP-TOPSIS-based clustering algorithm for high-quality live video streaming in flying ad hoc networks. J Supercomput 77(9):10664–10698
Garg H, Rani D (2021) Some information measures based on centroid, orthocenter, circumcenter and incenter points of transformed triangular fuzzy numbers and their applications. Cognit Comput 13:946–971
The Donkey Sanctuary (2017) Understanding donkey behaviour: factors that influence a donkey’s behaviour. https://www.thedonkeysanctuary.org.uk/what-we-do/knowledge-and-advice/for-owners/understanding-donkey-behaviour
Diaz G (2015) Border contraband, Austin: University of Texas Press. pp 95 – 105
ABC News (2017) Donkey Struggling with Fence Gets Assistance From Other Donkey. http://abcnews.go.com/Lifestyle/video/donkeystruggling-fence-assistance-donkey-45323867
Alsboui T, Qin Y, Hill R et al (2021) An energy efficient multi-mobile agent itinerary planning approach in wireless sensor networks. Computing 103:2093–2113
Mehto A, Tapaswi S, Pattanaik KK (2021) Optimal rendezvous points selection to reliably acquire data from wireless sensor networks using mobile sink. Computing 103:707–733
Khabiri M, Ghaffari A (2018) Energy-aware clustering-based routing in wireless sensor networks using cuckoo optimization algorithm. Wirel Pers Commun 98:2473–2495
Acknowledgements
The authors are grateful to the Anna Centenary Research Fellowship (Grant No.: CFR/ACRF/2017/50) provided by the Centre for Research, Anna University, Chennai - 600025 for the support to carry out this research work.
Funding
Anna Centenary Research Fellowship (Grant No.: CFR/ACRF/2017/50) provided by the Centre for Research, Anna University, Chennai - 600025.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Rajeswari, G., Arthi, R. & Murugan, K. Nature-inspired donkey and smuggler algorithm for optimal data gathering in partitioned wireless sensor networks for restoring network connectivity. Computing 106, 759–787 (2024). https://doi.org/10.1007/s00607-023-01251-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-023-01251-0
Keywords
- Wireless sensor networks
- Donkey and smuggler optimization
- Relay nodes
- Failure recovery
- Network connectivity