{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T07:33:48Z","timestamp":1767598428736,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11227-022-04407-5","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T05:02:34Z","timestamp":1647838954000},"page":"13530-13553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An adaptive coverage aware data gathering scheme using KD-tree and ACO for WSNs with mobile sink"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2285-953X","authenticated-orcid":false,"given":"Zaher","family":"Al Aghbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed M.","family":"Khedr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Banafsj","family":"Khalifa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pravija P. V.","family":"Raj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"issue":"4","key":"4407_CR1","doi-asserted-by":"publisher","first-page":"2407","DOI":"10.1007\/s11277-019-06993-9","volume":"111","author":"Z Al Aghbari","year":"2020","unstructured":"Al Aghbari Z, Khedr AM, Osamy W, Arif I, Agrawal DP (2020) Routing in wireless sensor networks using optimization techniques: a survey. Wirel Pers Commun 111(4):2407\u20132434","journal-title":"Wirel Pers Commun"},{"issue":"1","key":"4407_CR2","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/s10922-015-9342-z","volume":"24","author":"A Abu Safia","year":"2016","unstructured":"Abu Safia A, Al Aghbari Z, Kamel I (2016) Phenomena detection in mobile wireless sensor networks. J Netw Syst Manag 24(1):92\u2013115","journal-title":"J Netw Syst Manag"},{"issue":"12","key":"4407_CR3","doi-asserted-by":"publisher","first-page":"2292","DOI":"10.1016\/j.comnet.2008.04.002","volume":"52","author":"J Yick","year":"2008","unstructured":"Yick J, Mukherjee B, Ghosal D (2008) Wireless sensor network survey. Comput Netw 52(12):2292\u20132330","journal-title":"Comput Netw"},{"key":"4407_CR4","doi-asserted-by":"publisher","first-page":"77372","DOI":"10.1109\/ACCESS.2018.2882639","volume":"6","author":"W Osamy","year":"2018","unstructured":"Osamy W, Khedr AM, Aziz A, El-Sawy AA (2018) Cluster-tree routing based entropy scheme for data gathering in wireless sensor networks. IEEE Access 6:77372\u201377387","journal-title":"IEEE Access"},{"issue":"2","key":"4407_CR5","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s11277-019-06440-9","volume":"108","author":"W Osamy","year":"2019","unstructured":"Osamy W, El-sawy AA, Khedr AM (2019) Satc: a simulated annealing based tree construction and scheduling algorithm for minimizing aggregation time in wireless sensor networks. Wirel Pers Commun 108(2):921\u2013938","journal-title":"Wirel Pers Commun"},{"issue":"4","key":"4407_CR6","doi-asserted-by":"publisher","first-page":"910","DOI":"10.3390\/a8040910","volume":"8","author":"AM Khedr","year":"2015","unstructured":"Khedr AM (2015) Effective data acquisition protocol for multi-hop heterogeneous wireless sensor networks using compressive sensing. Algorithms 8(4):910\u2013928","journal-title":"Algorithms"},{"issue":"2","key":"4407_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1072989.1072992","volume":"9","author":"N Ahmed","year":"2005","unstructured":"Ahmed N, Kanhere SS, Jha S (2005) The holes problem in wireless sensor networks: a survey. ACM SIGMOBILE Mob Comput Commun Rev 9(2):4\u201318","journal-title":"ACM SIGMOBILE Mob Comput Commun Rev"},{"issue":"3","key":"4407_CR8","first-page":"367","volume":"9","author":"DM Omar","year":"2017","unstructured":"Omar DM, Khedr AM, Agrawal DP (2017) Optimized clustering protocol for balancing energy in wireless sensor networks. Int J Commun Netw Inf Secur 9(3):367\u2013375","journal-title":"Int J Commun Netw Inf Secur"},{"issue":"4","key":"4407_CR9","doi-asserted-by":"publisher","first-page":"2639","DOI":"10.1007\/s11276-019-02022-6","volume":"26","author":"A Mehto","year":"2020","unstructured":"Mehto A, Tapaswi S, Pattanaik K (2020) A review on rendezvous based data acquisition methods in wireless sensor networks with mobile sink. Wirel Netw 26(4):2639\u20132663","journal-title":"Wirel Netw"},{"issue":"1","key":"4407_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/17445760.2012.729584","volume":"28","author":"Z Al Aghbari","year":"2013","unstructured":"Al Aghbari Z, Kamel I, Elbaroni W (2013) Energy-efficient distributed wireless sensor network scheme for cluster detection. Int J Parallel, Emerg Distrib Syst 28(1):1\u201328","journal-title":"Int J Parallel, Emerg Distrib Syst"},{"issue":"3","key":"4407_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic expected time. ACM Trans Math Softw (TOMS) 3(3):209\u2013226","journal-title":"ACM Trans Math Softw (TOMS)"},{"issue":"9","key":"4407_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"issue":"1","key":"4407_CR13","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/JSYST.2016.2597166","volume":"12","author":"Y Miao","year":"2016","unstructured":"Miao Y, Sun Z, Wang N, Cao Y, Cruickshank H (2016) Time efficient data collection with mobile sink and Ymimo technique in wireless sensor networks. IEEE Syst J 12(1):639\u2013647","journal-title":"IEEE Syst J"},{"key":"4407_CR14","doi-asserted-by":"crossref","unstructured":"Tang J, Guo S, Yang Y (2015) Delivery latency minimization in wireless sensor networks with mobile sink. In: 2015 IEEE International Conference on Communications (ICC). IEEE, pp 6481\u20136486","DOI":"10.1109\/ICC.2015.7249357"},{"issue":"4","key":"4407_CR15","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1007\/s11276-020-02254-x","volume":"26","author":"PP Raj","year":"2020","unstructured":"Raj PP, Al Khedr AM, Aghbari Z (2020) Data gathering via mobile sink in WSNs using game theory and enhanced ant colony optimization. Wirel Netw 26(4):2983\u20132998","journal-title":"Wirel Netw"},{"key":"4407_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.aeue.2018.09.005","volume":"96","author":"A Alsaafin","year":"2018","unstructured":"Alsaafin A, Al Khedr AM, Aghbari Z (2018) Distributed trajectory design for data gathering using mobile sink in wireless sensor networks. AEU-Int J Electron Commun 96:1\u201312","journal-title":"AEU-Int J Electron Commun"},{"issue":"5","key":"4407_CR17","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1002\/dac.3006","volume":"29","author":"MR Majma","year":"2016","unstructured":"Majma MR, Almassi S, Shokrzadeh H (2016) Sgdd: self-managed grid-based data dissemination protocol for mobile sink in wireless sensor network. Int J Commun Syst 29(5):959\u2013976","journal-title":"Int J Commun Syst"},{"key":"4407_CR18","doi-asserted-by":"publisher","first-page":"133577","DOI":"10.1109\/ACCESS.2020.3010313","volume":"8","author":"Z Wang","year":"2020","unstructured":"Wang Z, Ding H, Li B, Bao L, Yang Z (2020) An energy efficient routing protocol based on improved artificial bee colony algorithm for wireless sensor networks. IEEE Access 8:133577\u2013133596","journal-title":"IEEE Access"},{"key":"4407_CR19","doi-asserted-by":"crossref","unstructured":"Park J, Kim S, Youn J, Ahn S, Cho S (2020) Iterative sensor clustering and mobile sink trajectory optimization for wireless sensor network with nonuniform density. Wire Commun Mobile Comput","DOI":"10.1155\/2020\/8853662"},{"issue":"3","key":"4407_CR20","doi-asserted-by":"crossref","first-page":"155014771983958","DOI":"10.1177\/1550147719839581","volume":"15","author":"J Wang","year":"2019","unstructured":"Wang J, Gao Y, Liu W, Sangaiah AK, Kim H-J (2019) An intelligent data gathering schema with data fusion supported for mobile sink in wireless sensor networks. Int J Distrib Sens Netw 15(3):1550147719839581","journal-title":"Int J Distrib Sens Netw"},{"issue":"4","key":"4407_CR21","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1504\/IJAHUC.2019.103263","volume":"32","author":"Z Han","year":"2019","unstructured":"Han Z, Shi T, Lv X, Jia X, Wang Z, Zhou D (2019) Data gathering maximisation for wireless sensor networks with a mobile sink. Int J Ad Hoc Ubiquitous Comput 32(4):224\u2013235","journal-title":"Int J Ad Hoc Ubiquitous Comput"},{"issue":"8","key":"4407_CR22","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.3390\/s19081838","volume":"19","author":"Y Gao","year":"2019","unstructured":"Gao Y, Wang J, Wu W, Sangaiah AK, Lim S-J (2019) Travel route planning with optimal coverage in difficult wireless sensor network environment. Sensors 19(8):1838","journal-title":"Sensors"},{"key":"4407_CR23","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.asoc.2018.05.008","volume":"69","author":"P Kumar","year":"2018","unstructured":"Kumar P, Amgoth T, Annavarapu CSR (2018) Aco-based mobile sink path determination for wireless sensor networks under non-uniform data constraints. Appl Soft Comput 69:528\u2013540","journal-title":"Appl Soft Comput"},{"issue":"10","key":"4407_CR24","doi-asserted-by":"publisher","first-page":"8991","DOI":"10.1007\/s12652-020-02595-7","volume":"12","author":"PK Donta","year":"2021","unstructured":"Donta PK, Amgoth T, Annavarapu CSR (2021) An extended ACO-based mobile sink path determination in wireless sensor networks. J Ambient Intell Human Comput 12(10):8991\u20139006","journal-title":"J Ambient Intell Human Comput"},{"key":"4407_CR25","doi-asserted-by":"publisher","first-page":"19463","DOI":"10.1109\/ACCESS.2017.2742138","volume":"5","author":"C Wu","year":"2017","unstructured":"Wu C, Liu Y, Wu F, Fan W, Tang B (2017) Graph-based data gathering scheme in WSNs with a mobility-constrained mobile sink. IEEE Access 5:19463\u201319477","journal-title":"IEEE Access"},{"key":"4407_CR26","doi-asserted-by":"publisher","first-page":"176204","DOI":"10.1109\/ACCESS.2019.2957834","volume":"7","author":"X He","year":"2019","unstructured":"He X, Fu X, Yang Y (2019) Energy-efficient trajectory planning algorithm based on multi-objective PSO for the mobile sink in wireless sensor networks. IEEE Access 7:176204\u2013176217","journal-title":"IEEE Access"},{"issue":"2","key":"4407_CR27","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1109\/JSEN.2017.2773119","volume":"18","author":"W Wen","year":"2018","unstructured":"Wen W, Zhao S, Shang C, Chang C-Y (2018) EAPC: energy-aware path construction for data collection using mobile sink in wireless sensor networks. IEEE Sens J 18(2):890\u2013901","journal-title":"IEEE Sens J"},{"issue":"9","key":"4407_CR28","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.3390\/s18092899","volume":"18","author":"J Anzola","year":"2018","unstructured":"Anzola J, Pascual J, Gonzalez Tarazona G, Crespo R (2018) A clustering WSN routing protocol based on KD tree algorithm. Sensors 18(9):2899","journal-title":"Sensors"},{"issue":"3","key":"4407_CR29","doi-asserted-by":"publisher","first-page":"3173","DOI":"10.1109\/JSYST.2020.3019213","volume":"15","author":"D Dash","year":"2020","unstructured":"Dash D, Kumar N, Ray PP, Kumar N (2020) Reducing data gathering delay for energy efficient wireless data collection by jointly optimizing path and speed of Mobile Sink. IEEE Syst J 15(3):3173\u20133184","journal-title":"IEEE Syst J"},{"issue":"21","key":"4407_CR30","doi-asserted-by":"publisher","first-page":"7209","DOI":"10.1109\/JSEN.2017.2755122","volume":"17","author":"B Khalifa","year":"2017","unstructured":"Khalifa B, Al Aghbari Z, Khedr AM, Abawajy JH (2017) Coverage hole repair in WSNs using cascaded neighbor intervention. IEEE Sens J 17(21):7209\u20137216","journal-title":"IEEE Sens J"},{"key":"4407_CR31","doi-asserted-by":"crossref","unstructured":"Htun AM, Maw MS, Sasase I (2014) Reduced complexity on mobile sensor deployment and coverage hole healing by using adaptive threshold distance in hybrid wireless sensor networks. In: IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC), vol 2014. IEEE, pp 1547\u20131552","DOI":"10.1109\/PIMRC.2014.7136414"},{"issue":"3","key":"4407_CR32","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/JSEN.2013.2286332","volume":"14","author":"S Mini","year":"2014","unstructured":"Mini S, Udgata SK, Sabat SL (2014) Sensor deployment and scheduling for target coverage problem in wireless sensor networks. IEEE Sens J 14(3):636\u2013644","journal-title":"IEEE Sens J"},{"issue":"1","key":"4407_CR33","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.engappai.2012.05.018","volume":"26","author":"S Sengupta","year":"2013","unstructured":"Sengupta S, Das S, Nasir M, Panigrahi BK (2013) Multi-objective node deployment in WSNs: in search of an optimal trade-off among coverage, lifetime, energy consumption, and connectivity. Eng Appl Artif Intell 26(1):405\u2013416","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"4407_CR34","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A et al (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B Cybern 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"4407_CR35","unstructured":"Merry B, Gain J, Marais P (2013) Accelerating kd-tree searches for all k-nearest neighbours. Tech. Rep., University of Cape Town"},{"issue":"1","key":"4407_CR36","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04407-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04407-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04407-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T14:12:16Z","timestamp":1656943936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04407-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":36,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["4407"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04407-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,3,21]]},"assertion":[{"value":"24 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}