Deployment techniques in wireless sensor networks: a survey, classification, challenges, and future research issues

• Published in: The Journal of supercomputing Vol. 76; no. 9; pp. 7333 - 7373
• Main Authors: Priyadarshi, Rahul, Gupta, Bharat, Anurag, Amulya
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.09.2020; Springer Nature B.V
• Subjects: Classification; Compilers; Computational geometry; Computer Science; Computer simulation; Heuristic methods; Interpreters; Performance measurement; Processor Architectures; Programming Languages; Simulators; Wireless networks; Wireless sensor networks; FoI; Metaheuristics; Node; Deployment; Connectivity; Coverage; Simulators
• ISSN: 0920-8542; 1573-0484
• DOI: 10.1007/s11227-020-03166-5

Wireless sensor networks (WSNs) have been considered as one of the fine research areas in recent years because of vital role in numerous applications. To process the extracted data and transmit it to the various location, a large number of nodes must be deployed in a proper way because deployment is one of the major issues in WSNs. Hence, the minimum number of node deployment to attain full coverage is of enormous significance for research. The prime agenda of the presented paper is to categorize various coverage techniques into four major parts: computational geometry-based techniques, force-based techniques, grid-based techniques, and metaheuristic-based techniques. Additionally, several comparisons amid these schemes are provided in view of their benefits and drawbacks. Our discussion weighs on the classification of coverage, practical challenges in the deployment of WSNs, sensing models, and research issues in WSNs. Moreover, a detailed analysis of performance metrics and comparison among various WSNs simulators is listed. In conclusion, standing research issues along with potential work guidelines are discussed.