Skip to main content

Advertisement

SpringerLink
Log in

NRSM: node redeployment shrewd mechanism for wireless sensor network

  • Original Article
  • Published:
Iran Journal of Computer Science Aims and scope Submit manuscript

Abstract

Despite numerous advantages, the challenges for wireless sensor communication always remains open due to which a continuous effort is being applied to tackle the unavoidable conditions regarding wireless network coverage. Somehow, the uncouth deployment of the sensor nodes is making the tribulation queue longer day by day which eventually has great impact over sensor coverage range. To address the issues related with network coverage and uncouth energy wastage, a sensor node redeployment-based shrewd mechanism (NRSM) has been proposed where new intended positions for sensor node are rummaged out in the coverage area. The proposed algorithm operates in two phases; in first phase it locates the intended node positions through Dissimilitude Enhancement Scheme (DES) and moves the node to new position. While second phase is called a Depuration, when the moving distance between initial and intended node position is shrewdly reduced. Further, different variation factors of NRSM such as loudness, pulse emission rate, maximum frequency, and sensing radius have been explored and related optimized parameters are identified. The performance metric has been meticulously analyzed through simulation rounds in Matlab and compared with state of art algorithms like Fruit Fly Optimization Algorithm (FOA), Jenga-inspired optimization algorithm (JOA) and Bacterial Foraging Algorithm (BFA) in terms of mean coverage range, computation time, standard deviation and network energy diminution. The performance metrics vouches the effectiveness of the proposed algorithm as compared to the FOA, JOA and BFA.

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

Similar content being viewed by others

References

  1. F. Ait Aoudia, M. Gautier, M. Magno, O. Berder, and L. Benini, “A generic framework for modeling MAC protocols in wireless sensor networks,” IEEEACM Trans. Netw., 25(3):1489–1500, 2017, doi: https://doi.org/10.1109/TNET.2016.2631642.

  2. S. Ashraf, M. Gao, Z. Chen, S. Kamran, and Z. Raza, “Efficient node monitoring mechanism in wsn using Contikimac protocol,” Int. J. Adv. Comput. Sci. Appl., 8(11), 2017, doi: https://doi.org/10.14569/IJACSA.2017.081152.

  3. S. Balsamo, A. Marin, and E. Vicario, Eds., New frontiers in quantitative methods in informatics: 7th Workshop, InfQ 2017, Venice, Italy, December 4, 2017, Revised Selected Papers, 1st ed. 2018 edition. New York, NY: Springer, 2018.

  4. “Shortest path routing protocol based on the vertical angle for underwater acoustic networks.” https://www.hindawi.com/journals/js/2019/9145675/. Accessed May 12, 2020.

  5. S. Ashraf and T. Ahmed, “Machine learning Shrewd approach for an imbalanced dataset conversion samples,” J. Eng. Technol. JET, 11(1), 2020, https://journal.utem.edu.my/index.php/jet/article/view/5896. Accessed Jul 05, 2020 [Online]

  6. Ashraf, S., Ahmed, T., Raza, A., Naeem, H.: Design of Shrewd underwater routing synergy using porous energy shells. Smart Cities 3(1), 74–92 (2020). https://doi.org/10.3390/smartcities3010005

    Article  Google Scholar 

  7. “Flower pollination algorithm based localization of wireless sensor network - IEEE Conference Publication.” https://ieeexplore.ieee.org/document/7453299/. Accessed May 12, 2020.

  8. Ashraf, S., Ahmed, T., Saleem, S., Aslam, Z.: Diverging mysterious in green supply chain management. Orient. J. Comput. Sci. Technol. 13(1), 22–28 (2020). https://doi.org/10.13005/ojcst13.01.02

    Article  Google Scholar 

  9. J. Zhang, Y. Lei, C. Chen, and F. Lin, “Directional probability perceived nodes deployment based on particle swarm optimization”. 2016. https://journals.sagepub.com/doi/full/https://doi.org/10.1155/2016/2046392. Accessed Jun 07, 2020.

  10. Das, S., Biswas, A., Dasgupta, S., Abraham, A.: Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications. In: Abraham, A., Hassanien, A.-E., Siarry, P., Engelbrecht, A. (eds.) Foundations of computational intelligence volume 3: global optimization, pp. 23–55. Springer, Berlin (2009)

    Chapter  Google Scholar 

  11. Ashraf, S., Aslam, Z., Yahya, A., Tahir, A.: Underwater routing protocols analysis of intrepid link selection mechanism, challenges and strategies. Int. J. Sci. Res. Comput. Sci. Eng. 8(2), 1–9 (2020). https://doi.org/10.26438/ijsrcse/v8i2.19

    Article  Google Scholar 

  12. Ashraf, S., Gao, M., Mingchen, Z., Ahmed, T., Raza, A., Naeem, H.: USPF: underwater shrewd packet flooding mechanism through surrogate holding time. Wirel. Commun. Mob. Comput. 2020, 1–12 (2020). https://doi.org/10.1155/2020/9625974

    Article  Google Scholar 

  13. S. Ashraf, A. Raza, Z. Aslam, H. Naeem, and T. Ahmed, “Underwater resurrection routing synergy using astucious energy pods,” J. Robot. Control JRC, 1(5), 2020, doi: https://doi.org/10.18196/jrc.1535.

  14. Ashraf, S., Saleem, S., Chohan, A.H., Aslam, Z., Raza, A.: Challenging strategic trends in green supply chain management. Int. J. Res. Eng. Appl. Sci. JREAS 5(2), 71–74 (2020)

    Google Scholar 

  15. Ashraf, S., Arfeen, Z.A., Khan, M.A., Ahmed, T.: SLM-OJ: surrogate learning mechanism during outbreak juncture. Int. J. Mod. Trends Sci. Technol. 6(5), 162–167 (2020). https://doi.org/10.46501/IJMTST060525

    Article  Google Scholar 

  16. Zhang, Q., Fok, M.: A two-phase coverage-enhancing algorithm for hybrid wireless sensor networks. Sensors 17(12), 117 (2017). https://doi.org/10.3390/s17010117

    Article  Google Scholar 

  17. Li, J., Zhang, B., Cui, L., Chai, S.: An extended virtual force-based approach to distributed self-deployment in mobile sensor networks. Int. J. Distrib. Sens. Netw. 8(3), 417307 (2012). https://doi.org/10.1155/2012/417307

    Article  Google Scholar 

  18. Wang, G., Cao, G., La Porta, T.F.: Movement-assisted sensor deployment. IEEE Trans. Mob. Comput. 5(6), 640–652 (2006). https://doi.org/10.1109/TMC.2006.80

    Article  Google Scholar 

  19. Mahboubi, H., Aghdam, A.G.: Distributed deployment algorithms for coverage improvement in a network of wireless mobile sensors: relocation by virtual force. IEEE Trans. Control Netw. Syst. 4(4), 736–748 (2017). https://doi.org/10.1109/TCNS.2016.2547579

    Article  MathSciNet  MATH  Google Scholar 

  20. W.-T. Pan, “A new fruit fly optimization algorithm: taking the financial distress model as an example,” Knowl.-Based Syst., 26: 69–74, 2012, doi: https://doi.org/10.1016/j.knosys.2011.07.001.

  21. Aliyu, M.S., Abdullah, A.H., Chizari, H., Sabbah, T., Altameem, A.: Coverage enhancement algorithms for distributed mobile sensors deployment in wireless sensor networks. Int. J. Distrib. Sens. Netw. 12(3), 9169236 (2016). https://doi.org/10.1155/2016/9169236

    Article  Google Scholar 

  22. M. Abazeed, N. Faisal, S. Zubair, and A. Ali, “Routing protocols for wireless multimedia sensor network: a survey,” J. Sens., 2013. https://www.hindawi.com/journals/js/2013/469824/. Accessed Jul 27, 2020.

  23. Yoon, Y., Kim, Y.-H.: An efficient genetic algorithm for maximum coverage deployment in wireless sensor networks. IEEE Trans. Cybern. 43(5), 1473–1483 (2013). https://doi.org/10.1109/TCYB.2013.2250955

    Article  Google Scholar 

  24. L. Sun, X. Song, and T. Chen, “An improved convergence particle swarm optimization algorithm with random sampling of control parameters,” J. Control Sci. Eng., 2019. https://www.hindawi.com/journals/jcse/2019/7478498/. Accessed Jul 27, 2020.

  25. “How to Calculate Euclidean Distance.” https://sciencing.com/how-to-calculate-euclidean-distance-12751761.html. Accessed May 12, 2020.

  26. Ashraf, S., Ahmad, A., Yahya, A., Ahmed, T.: Underwater routing protocols: analysis of link selection challenges. AIMS Electron. Electr. Eng. 4(3), 234–248 (2020). https://doi.org/10.3934/ElectrEng.2020.3.234

    Article  Google Scholar 

  27. Storn, R., Price, K.: Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997). https://doi.org/10.1023/A:1008202821328

    Article  MathSciNet  MATH  Google Scholar 

  28. Ashraf, S., Ahmed, T.: Dual-nature biometric recognition epitome. Trends Comput. Sci. Inf. Technol. 5(1), 008–014 (2020). https://doi.org/10.17352/tcsit.000012

    Article  Google Scholar 

Download references

Funding

This work is completely self-funded, thereby no any financial agency’s role is available.

Author information

Authors and Affiliations

  1. College of Internet of Things Engineering, Hohai University, Changzhou, China

    Shahzad Ashraf & Tauqeer Ahmed

  2. Muhammad Nawaz Sharif University of Engineering and Technology, Multan, Pakistan

    Sehrish Saleem

Authors
  1. Shahzad Ashraf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tauqeer Ahmed
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sehrish Saleem
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shahzad Ashraf.

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

Ashraf, S., Ahmed, T. & Saleem, S. NRSM: node redeployment shrewd mechanism for wireless sensor network. Iran J Comput Sci 4, 171–183 (2021). https://doi.org/10.1007/s42044-020-00075-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s42044-020-00075-x

Keywords

Search

Navigation