Skip to main content
Log in

Obstacle-aware connectivity restoration for the partitioned wireless sensor networks using mobile data carriers

  • Original Paper
  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In a Wireless Sensor Network (WSN), sensor nodes are deployed to detect physical parameters in hostile environments. The sensor nodes rely on each other for effective data transmission. When the articulation points fail, the network is split into disjoint segments, resulting in the network partitioning problem. In this situation, connecting the disjoint partitions using a mobile relay node (MD-carrier) is a must to maintain the functional operations of WSN. However, the presence of obstacles in the trajectory path makes touring a challenging task. Consequently, finding tour paths by avoiding obstacles has always been one of the most common WSN problems. An Obstacle-avoiding Connectivity Restoration Strategy for partitioned WSN using MD-carriers (OCRS-MD) to re-establish connectivity in the presence of obstacles has been proposed in this paper. OCRS-MD includes a path-finding algorithm that bypasses obstacles for the effectual touring of the MD-carrier. An algorithm has also been proposed for identifying the MD-carriers’ sojourn locations. Hence, the MD-carrier follows the optimal touring path, pausing at sojourn locations to collect data from the segments. As a result, OCRS-MD restores the partitioned WSN’s connectivity by reporting the collected data to the sink node. The primary goal of OCRS-MD is to restore network connectivity in the presence of obstacles with reduced travel distance and latency. The computational complexity of OCRS-MD is \(O(n^2)\), where ‘n’ is the number of disjoint segments in the network. The simulation results indicate that OCRS-MD reduces tour length and latency by an average of 16.89% and 15.47%, respectively, when compared to the existing OACE and EEDRM approaches.

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

Access this article

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

Instant access to the full article PDF.

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
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

Data Availability

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

References

  1. Pushpa Mettilsha, J., Sandhya, M. K., & Murugan, K. (2021). RPR: Reliable path routing protocol to mitigate congestion in critical IoT applications. Wireless Networks, 27, 1–15.

    Article  Google Scholar 

  2. Priyadarshi, R., Bharat, G., & Amulya, A. (2020). Deployment techniques in wireless sensor networks: A survey, classification, challenges, and future research issues. The Journal of Supercomputing, 76, 1–41.

    Article  Google Scholar 

  3. Suja Golden Shiny, S., & Murugan, K. (2021). TSDN-WISE: Automatic threshold-based low control-flow communication protocol for SDWSN. IEEE Sensors Journal, 21(17), 19560–19569.

    Article  Google Scholar 

  4. Sharmin, N., Karmaker, A., Lambert, W. L., Alam, M. S., & Shawkat, M. S. A. (2020). Minimizing the energy hole problem in wireless sensor networks: A wedge merging approach. Sensors, 20(1), 277.

    Article  Google Scholar 

  5. 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. International Journal of Mobile Network Design and Innovation, 4(1), 3–13.

    Article  Google Scholar 

  6. Behera, T. M., & Mohapatra, S. K. (2021). A novel scheme for mitigation of energy hole problem in wireless sensor network for military application. International Journal of Communication Systems, 34, e4886.

    Article  Google Scholar 

  7. Onuekwusi, N. C., Ndinechi, M. C., Ononiwu, G. C., & Nosiri, O. C. (2020). An energy balanced routing hole and network partitioning mitigation model for homogeneous hierarchical wireless sensor networks. International Journal of Interdisciplinary Telecommunications and Networking, 12(1), 28–42.

    Article  Google Scholar 

  8. Kandris, D., Nakas, C., Vomvas, D., & Koulouras, G. (2020). Applications of wireless sensor networks: An up-to-date survey. Applied System Innovation, 3(1), 14.

    Article  Google Scholar 

  9. Saeed, M. K., ul Hassan, M., Mahmood, K., Shah, A. M., & Khan, J. (2021). Efficient solution for connectivity restoration (ESCR) in wireless sensor and actor-networks. Wireless Personal Communications, 117, 2115–2134.

    Article  Google Scholar 

  10. Kumar, R., & Amgoth, T. (2020). Adaptive cluster-based relay-node placement for disjoint wireless sensor networks. Wireless Networks, 26(1), 651–666.

    Article  Google Scholar 

  11. Rajeswari, G., & Murugan, K. (2020). Healing of large-scale failures in WSN by the effectual placement of relay nodes. IET Communications, 14(17), 3030–3038.

    Article  Google Scholar 

  12. Gharaei, N., Bakar, A. K., Hashim, S. Z. M., & Pourasl, A. H. (2019). Energy-efficient intra-cluster routing algorithm to enhance the coverage time of wireless sensor networks. IEEE Sensors Journal, 19(12), 4501–4508.

    Article  Google Scholar 

  13. Kumar, N., & Dash, D. (2020). Flow based efficient data gathering in wireless sensor network using path-constrained mobile sink. Journal of Ambient Intelligence and Humanized Computing, 11(3), 1163–1175.

    Article  Google Scholar 

  14. Yogarajan, G., & Revathi, T. (2018). Nature inspired discrete firefly algorithm for optimal mobile data gathering in wireless sensor networks. Wireless Networks, 24(8), 2993–3007.

    Article  Google Scholar 

  15. Ma, G., Yang, Y., Qiu, X., & Gao, Z. (2016). Obstacle aware connectivity restoration for disjoint wireless sensor networks using a mix of stationary and mobile nodes. International Journal of Distributed Sensor Networks, 12(5), 6469341.

    Article  Google Scholar 

  16. Kumar, R., Amgoth, T., & Das, D. (2020). Obstacle-aware connectivity establishment in wireless sensor networks. IEEE Sensors Journal, 21(4), 5543–5552.

    Article  Google Scholar 

  17. Jin, W., Xiujian, G., Wei, L., Arun, K. S., & Hye-Jin, K. (2019). An empower hamilton loop based data collection algorithm with mobile agent for WSNs. Human-centric Computing and Information Sciences, 9(1), 1–14.

    Google Scholar 

  18. Xie, G., Ota, K., Dong, M., Pan, F., & Liu, A. (2017). Energy-efficient routing for mobile data collectors in wireless sensor networks with obstacles. Peer-to-Peer Networking and Applications, 10(3), 472–483.

    Article  Google Scholar 

  19. Senturk, I. F., Akkaya, K., & Janansefat, S. (2016). Towards realistic connectivity restoration in partitioned mobile sensor networks. International Journal of Communication Systems, 29(2), 230–250.

    Article  Google Scholar 

  20. Wang, X., Xu, L., & Zhou, S. (2017). A straight skeleton based connectivity restoration strategy in the presence of obstacles for WSNs. Sensors, 17(10), 2299.

    Article  Google Scholar 

  21. Magadevi, N., & Kumar, V. J. S. (2017). Energy efficient obstacle avoidance path planning trajectory for localization in wireless sensor network. Cluster Computing, 22(5), 1–7.

    Google Scholar 

  22. Selvaraj, S., & Vasanthamani, S. (2020). Energy efficient dynamic routing mechanism (EEDRM) with obstacles in WSN. Wireless Personal Communications, 112, 1–16.

    Article  Google Scholar 

  23. Guo, H., Shen, C., Zhang, H., Chen, H., & Jia, R. (2018). Simultaneous trajectory planning and tracking using an MPC method for cyber-physical systems: A case study of obstacle avoidance for an intelligent vehicle. IEEE Transactions on Industrial Informatics, 14(9), 4273–4283.

    Article  Google Scholar 

  24. Xie, Y., Zhang, Z., Wu, X., Shi, Z., Chen, Y., Wu, B., & Mantey, K. A. (2020). Obstacle avoidance and path planning for multi-joint manipulator in a space robot. IEEE Access, 8, 3511–3526.

    Article  Google Scholar 

  25. Najjar-Ghabel, S., Farzinvash, L., & Razavi, S. N. (2020). Mobile sink-based data gathering in wireless sensor networks with obstacles using artificial intelligence algorithm. Ad Hoc Networks, 106, 102243.

    Article  Google Scholar 

  26. Wang, X., Xu, L., Zhou, S., & Wu, W. (2017). Hybrid recovery strategy based on random terrain in wireless sensor networks. Scientific Programming, 1–19.

  27. Solmaz, M., & Gholamreza, F. (2021). A new algorithm inspired by Impala Mexican Wave with variable stride for relay node placement as a nested reverse p-median problem in disjoint wireless sensor networks. Wireless Networks, 27, 2347–2363.

    Article  Google Scholar 

  28. Alomari, A., Phillips, W., Aslam, N., & Comeau, F. (2018). Swarm intelligence optimization techniques for obstacle-avoidance mobility-assisted localization in wireless sensor networks. IEEE Access, 6, 22368–22385.

    Article  Google Scholar 

  29. Chen, B., Chen, H., & Wu, C. (2019). Obstacle-avoiding connectivity restoration based on quadrilateral Steiner tree in disjoint wireless sensor networks. IEEE Access, 7, 124116–124127.

    Article  Google Scholar 

  30. Xie, G., & Pan, F. (2016). Cluster-based routing for the mobile sink in wireless sensor networks with obstacles. IEEE Access, 4, 2019–2028.

    Article  Google Scholar 

  31. Tan, X., Sun, Z., Wang, P., & Sun, Y. (2020). Environment-aware localization for wireless sensor networks using magnetic induction. Ad Hoc Networks, 98, 102030.

    Article  Google Scholar 

  32. Matthew, C., Fletcher, T., Chen, W. H., & Liu, C. (2018). Optimal polygon decomposition for UAV survey coverage path planning in wind. Sensors, 18(7), 2132.

    Article  Google Scholar 

  33. Jothikumar, C., Ramana, K., Chakravarthy, V. D., Singh, S., & Ra, I. H. (2021). An efficient routing approach to maximize the lifetime of IoT-based wireless sensor networks in 5G and beyond. Mobile Information Systems, 2021, 1–11.

    Article  Google Scholar 

  34. Martínez, O., Soto, I., & Campa, R. (2021). Mathematical modeling of a 3-CUP parallel mechanism using the Fermat point. Mechanism and Machine Theory, 161, 104326.

    Article  Google Scholar 

  35. Mironitchev, A., & Morales, W. (2019). Trigonometric proofs for congruent triangles. Journal of Universality of Global Education Issues, 5, 1–16.

    Google Scholar 

  36. Cormen, T., Leiserson, C., Rivest, R., & Stein, C. (2009). Introduction to algorithms (3rd ed.). London: Massachusetts.

    MATH  Google Scholar 

Download references

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. The authors also thank the anonymous reviewers whose comments have led to the improvement of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to G. Rajeswari.

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

Rajeswari, G., Sandhya, M.K. & Murugan, K. Obstacle-aware connectivity restoration for the partitioned wireless sensor networks using mobile data carriers. Wireless Netw 29, 1703–1720 (2023). https://doi.org/10.1007/s11276-022-03221-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-022-03221-4

Keywords

Navigation