Skip to main content

Advertisement

SpringerLink
Log in

CAPP: coverage aware topology adaptive path planning algorithm for data collection in wireless sensor networks

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Data collection is an important task in many mobile wireless sensor network (MWSN) applications. The energy of sensor nodes around the sink depletes rapidly due to transmitting large amounts of data from neighboring nodes. This problem can be mitigated through the use of intelligent mobile vehicles to collect the data. While traditional data collection methods focus on maximizing data acquisition or reducing network energy consumption, they do not take into account the actual sensor nodes’ coverage of the region of interest (ROI). To the best of our knowledge, most research on data collection focuses on path planning for the mobile collector in a static environment. During the lifetime of the network, coverage holes may appear due to node energy depletion. We propose a coverage aware topology adaptive path planning algorithm (CAPP) for path planning for WSNs where all sensor nodes are coverage aware and respond by moving to better locations to improve coverage of the network and compensate for the failed nodes. First, the path planning algorithm determines the number of Stop Points (SPs) where it will stop to gather data. Then, Particle Swarm Optimization is used to find the best location for these SPs. Finally, the shortest path through these SPs is determined by Ant Colony Optimization. Through extensive simulation, we show that CAPP performs efficiently in data collection while also allowing the nodes to move for coverage hole repair. The result shows improvement in area coverage and reduced delay in data collection, with no increase in energy consumption.

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

Access this article

Log in via an institution

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
Fig. 13

Similar content being viewed by others

References

  • 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 

  • Akyildiz IF, Weilian S, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Net 38(4):393–422

    Article  Google Scholar 

  • Aghbari ZA, Kamel I, Awad T (2012) On clustering large number of data streams. Intell Data Analy 16(1):69–91

    Article  Google Scholar 

  • Aghbari ZA, Kamel I, Elbaroni W (2013) Energy-efficient distributed wireless sensor network scheme for cluster detection. Intern J Para Emerg Distrib Syst 28(1):1–28

    Article  Google Scholar 

  • Zaher AA, Khedr Ahmed M, Walid O, Ifra A, Agrawal Dharma P (2019) Routing in wireless sensor networks using optimization techniques: A survey. Wireless Person Commun 111:1–28

    Google Scholar 

  • Zaher AA, Khedr Ahmed M, Banafsj K, Raj Pravija PV (2022) An adaptive coverage aware data gathering scheme using kd-tree and aco for wsns with mobile sink. J Supercomput 78(11):1–24

    Google Scholar 

  • Alsaafin A, Khedr AM, Aghbari ZA (2018) Distributed trajectory design for data gathering using mobile sink in wireless sensor networks. AEU-Intern J Electron Commun 96:1–12

    Article  Google Scholar 

  • Amgoth T, Jana PK (2017) Coverage hole detection and restoration algorithm for wireless sensor networks. Peer-to-Peer Net Appl 10(1):66–78

    Article  Google Scholar 

  • Di Francesco M, Das SK, Anastasi G (2011) Data collection in wireless sensor networks with mobile elements: a survey. ACM Trans Sens Net (TOSN) 8(1):7

    Google Scholar 

  • Dorigo M, Maniezzo V, Colorni A et al (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybernet Part B Cybernet 26(1):29–41

    Article  Google Scholar 

  • Gao S, Zhang H, Das SK (2010) Efficient data collection in wireless sensor networks with path-constrained mobile sinks. IEEE Trans Mob Comput 10(4):592–608

    Article  Google Scholar 

  • Gao Y, Wang J, Wenbing W, Sangaiah A K, Lim S-J (2019) Travel route planning with optimal coverage in difficult wireless sensor network environment. Sensors 19(8):1838

    Article  Google Scholar 

  • Habib A, Saha S, Nur F N, Razzaque A, Mamun-Or-Rashid M (2018) An efficient mobile-sink trajectory to maximize network lifetime in wireless sensor network. In 2018 International Conference on Innovation in Engineering and Technology (ICIET). IEEE. New Jersey, USA, 1–5

  • Han Z, Shi T, Lv X, Jia X, Wang Z, Zhou D (2019) Data gathering maximisation for wireless sensor networks with a mobile sink. Intern J Ad Hoc Ubiquit Comput 32(4):224–235

    Article  Google Scholar 

  • Karakus C, Gurbuz AC, Tavli B (2013) Analysis of energy efficiency of compressive sensing in wireless sensor networks. IEEE Sensors Journal 13(5):1999–2008

    Article  Google Scholar 

  • Khalifa B, Aghbari ZA, Khedr AM, Abawajy JH (2017) Coverage hole repair in wsns using cascaded neighbor intervention. IEEE Sens J 17(21):7209–7216

    Article  Google Scholar 

  • Banafsj K, Khedr Ahmed M, Zaher AA (2019) A coverage maintenance algorithm for mobile wsns with adjustable sensing range. IEEE Sens J 20(3):1582–91

    Google Scholar 

  • Khan O, Khan FG, Nazir B, Wazir U (2016) Energy efficient routing protocols in wireless sensor networks: a survey. Intern J Comput Sci Inform Sec 14(6):398

    Google Scholar 

  • 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 

  • Khedr Ahmed M, Pravija RPV (2021) Drnna: Decomposable reverse nearest neighbor algorithm for vertically distributed databases. 2021 18th International Multi-Conference on Systems, Signals & Devices (SSD). IEEE. New Jersey, USA, pp 681–686

    Chapter  Google Scholar 

  • Khedr AM, Aghbari ZA, Pravija Raj PV (2020) Coverage aware face topology structure for wireless sensor network applications. Wireless Net 26(6):4557–4577

    Article  Google Scholar 

  • Khedr Ahmed M, Zaher AA, Pravija RPV (2022) An enhanced sparrow search based adaptive and robust data gathering scheme for wsns. IEEE Sens J 22(11):10602–12

    Article  Google Scholar 

  • Koç M, Korpeoglu I (2015) Coordinated movement of multiple mobile sinks in a wireless sensor network for improved lifetime. EURASIP J Wireless Commun Net 2015(1):245

    Article  Google Scholar 

  • Kwon S M, Kim J S (2008) Coverage ratio in the wireless sensor networks using monte carlo simulation. In Fourth International Conference on Networked Computing and Advanced Information Management. IEEE, p 235–238.

  • Liang W, Luo J, Xu X (2010) Prolonging network lifetime via a controlled mobile sink in wireless sensor networks. In 2010 IEEE global telecommunications conference GLOBECOM 2010. IEEE, p 1–6

  • Ma M, Yang Y, Zhao M (2012) Tour planning for mobile data-gathering mechanisms in wireless sensor networks. IEEE Trans Vehicul Technol 62(4):1472–1483

    Article  Google Scholar 

  • Majma MR, Almassi S, Shokrzadeh H (2016) Sgdd: self-managed grid-based data dissemination protocol for mobile sink in wireless sensor network. Intern J Commun Syst 29(5):959–976

    Article  Google Scholar 

  • Manoj BS, Sekhar A, Siva Ram Murthy C (2007) On the use of limited autonomous mobility for dynamic coverage maintenance in sensor networks. Comput Net 51(8):2126–2143

    Article  MATH  Google Scholar 

  • Miao Y, Sun Z, Wang N, Cao Y, Cruickshank H (2016) Time efficient data collection with mobile sink and vmimo technique in wireless sensor networks. IEEE Syst J 12(1):639–647

    Article  Google Scholar 

  • Mikhaylov K, Tervonen J (2013) Energy consumption of the mobile wireless sensor network’s node with controlled mobility. In 2013 27th International Conference on Advanced Information Networking and Applications Workshops. IEEE, p 1582–1587

  • 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 

  • 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. Wireless Person Commun 108(2):921–938

    Article  Google Scholar 

  • Osamy W, El-Sawy AA, Khedr AM (2020) Effective tdma scheduling for tree-based data collection using genetic algorithm in wireless sensor networks. Peer-to-Peer Net Appl 13(3):796–815

    Article  Google Scholar 

  • Pravija RPV, Khedr Ahmed M, Al AZ (2020) Data gathering via mobile sink in wsns using game theory and enhanced ant colony optimization. Wireless Net 26:1–16

    Google Scholar 

  • Soumyadip S, Das S, Nasir MD, 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 

  • Shi Y, Eberhart R C (1999) Empirical study of particle swarm optimization. In Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406). IEEE, volume 3, p 1945–1950

  • 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, p 6481–6486

  • Abhishek T, Prabhat GH, Tanima D, Rahul Mishra KK, Shukla SJ (2018) Coverage and connectivity in wsns: a survey, research issues and challenges. IEEE Access 6:26971–26992

    Article  Google Scholar 

  • Wang Jin J, Chunwei KH, Simon SR, Sungyoung L (2017) A mobile assisted coverage hole patching scheme based on particle swarm optimization for wsns. Clust Comput 22:1–9

    Google Scholar 

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

    Article  Google Scholar 

  • Yun Y, Xia Y, Behdani B, Cole Smith J (2012) Distributed algorithm for lifetime maximization in a delay-tolerant wireless sensor network with a mobile sink. IEEE Trans Mob Comput 12(10):1920–1930

    Article  Google Scholar 

  • Zhu C, Zheng C, Shu L, Han G (2012) A survey on coverage and connectivity issues in wireless sensor networks. J Net Comput Appl 35(2):619–632

    Article  Google Scholar 

Download references

Author information

Author notes

  1. Banafsj Khalifa, Zaher Al Aghbari and Ahmed Khedr authors contributed equally to this work.

Authors and Affiliations

  1. Department of Computer Science, University of Sharjah, Sharjah, 27272, UAE

    Banafsj Khalifa, Zaher Al Aghbari & Ahmed M. Khedr

  2. Mathematics Department, Zagazig University, Zagazig, 44519, Egypt

    Ahmed M. Khedr

Authors
  1. Banafsj Khalifa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zaher Al Aghbari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmed M. Khedr
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ahmed M. Khedr.

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khalifa, B., Al Aghbari, Z. & Khedr, A.M. CAPP: coverage aware topology adaptive path planning algorithm for data collection in wireless sensor networks. J Ambient Intell Human Comput 14, 4537–4549 (2023). https://doi.org/10.1007/s12652-023-04574-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-023-04574-0

Keywords

Search

Navigation