Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

An adaptive coverage aware data gathering scheme using KD-tree and ACO for WSNs with mobile sink

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

While several Mobile Sink (MS)-based data gathering methods have been proposed for Wireless Sensor Networks, most of them are less adaptive to changes in network topology, and the planned MS trajectory cannot be refined to accommodate node failures. Hence, a KD-Tree-based scheme (KDT) is proposed, which is an adaptive and robust algorithm that reduces network energy consumption and data gathering delay. In contrast to many existing algorithms, the number of Rendezvous Points (RPs) are assigned dynamically by prioritizing the nodes’ coverage. Overlapping coverage of RPs is minimized, while guaranteeing 100% coverage of nodes. KDT is adaptive to network topology changes, and the planned MS trajectory can be refined to accommodate node failures. The shortest MS path is found using Ant Colony Optimization. Simulation results show that KDT requires approximately half the number of RPs and about 13% reduction in MS travel time compared to existing schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. 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–2434

    Article  Google Scholar 

  2. Abu Safia A, Al Aghbari Z, Kamel I (2016) Phenomena detection in mobile wireless sensor networks. J Netw Syst Manag 24(1):92–115

    Article  Google Scholar 

  3. Yick J, Mukherjee B, Ghosal D (2008) Wireless sensor network survey. Comput Netw 52(12):2292–2330

    Article  Google Scholar 

  4. 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–77387

    Article  Google Scholar 

  5. 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–938

    Article  Google Scholar 

  6. Khedr AM (2015) Effective data acquisition protocol for multi-hop heterogeneous wireless sensor networks using compressive sensing. Algorithms 8(4):910–928

    Article  Google Scholar 

  7. 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–18

    Article  Google Scholar 

  8. 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–375

    Google Scholar 

  9. 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–2663

    Article  Google Scholar 

  10. 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–28

    Article  Google Scholar 

  11. 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–226

    Article  Google Scholar 

  12. Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509–517

    Article  Google Scholar 

  13. 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–647

    Article  Google Scholar 

  14. 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–6486

  15. 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–2998

    Article  Google Scholar 

  16. 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–12

    Article  Google Scholar 

  17. 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–976

    Article  Google Scholar 

  18. 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–133596

    Article  Google Scholar 

  19. 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

  20. 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

    Google Scholar 

  21. 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–235

    Article  Google Scholar 

  22. 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

    Article  Google Scholar 

  23. 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–540

    Article  Google Scholar 

  24. 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–9006

    Article  Google Scholar 

  25. 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–19477

    Article  Google Scholar 

  26. 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–176217

    Article  Google Scholar 

  27. 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–901

    Article  Google Scholar 

  28. Anzola J, Pascual J, Gonzalez Tarazona G, Crespo R (2018) A clustering WSN routing protocol based on KD tree algorithm. Sensors 18(9):2899

    Article  Google Scholar 

  29. 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–3184

    Article  Google Scholar 

  30. 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–7216

    Article  Google Scholar 

  31. 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–1552

  32. 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–644

    Article  Google Scholar 

  33. 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–416

    Article  Google Scholar 

  34. 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–41

    Article  Google Scholar 

  35. Merry B, Gain J, Marais P (2013) Accelerating kd-tree searches for all k-nearest neighbours. Tech. Rep., University of Cape Town

  36. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Sharjah, Sharjah, 27272, United Arab Emirates

    Zaher Al Aghbari, Ahmed M. Khedr, Banafsj Khalifa & Pravija P. V. Raj

Authors
  1. Zaher Al Aghbari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ahmed M. Khedr
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Banafsj Khalifa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pravija P. V. Raj
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zaher Al Aghbari.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Al Aghbari, Z., Khedr, A.M., Khalifa, B. et al. An adaptive coverage aware data gathering scheme using KD-tree and ACO for WSNs with mobile sink. J Supercomput 78, 13530–13553 (2022). https://doi.org/10.1007/s11227-022-04407-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04407-5

Keywords

Search

Navigation