Shortest Path Discovery for Area Coverage (SPDAC) Using Prediction-Based Clustering in WSN

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Area coverage has been one among the major limitations in wireless sensor networks (WSNs). The main drawback in WSN is their limited lifetime. Hence, this has become the popular topic in WSNs recent research trend. Optimization of area traversed paths is one of the key factors in the proposal of area coverage approaches in WSN. This work presents the shortest path discovery for area coverage (SPDAC) approach to optimize the path trajectory of mobile relay node (MRN) to solve area coverage problems through the strategic deployment of sensors. Also, we extend the algorithm to reduce static node communication overhead by introducing a new scheme prediction-based clustering protocol for energy consumption (PCP-EC). These two approaches together will help in extending lifetime of the network. Simulations are carried out using network simulator tool to analyze the reduction in number of static nodes interactions and other quality of services.

Cite

CITATION STYLE

APA

Abhilash, C. N., Manjula, S. H., Tanuja, R., & Venugopal, K. R. (2021). Shortest Path Discovery for Area Coverage (SPDAC) Using Prediction-Based Clustering in WSN. In Advances in Intelligent Systems and Computing (Vol. 1133, pp. 1345–1357). Springer. https://doi.org/10.1007/978-981-15-3514-7_101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free