An Improved Interior Search Algorithm for Node Deployment in Wireless Sensor Networks
摘要
Wireless sensor networks (WSNs) possess numerous significant applications, encompassing both research and domestic utilization. The primary function of these entities is to gather and convey data originating from a designated region of interest (ROI) to a central station for the purpose of subsequent processing and analysis. As a result, it’s critical to guarantee both connectivity among the network’s nodes and maximum coverage of the selected region. The placement of sensors with the aim of ensuring optimum coverage and communication between sensor nodes is a significant issue in network architecture. The objective is to establish an ideal deployment that extends network lifespan and coverage rate while using the least amount of energy possible. Deploying sensor nodes randomly generates communication holes, which can degrade network performance. In order to solve optimization problems, this work introduces the interior search algorithm (ISA). The ISA reconstructs the network using minimal transmission lines from sink nodes to sensor nodes, using inspiration from interior design and aesthetics. This algorithm offers new insights for global optimization and minimizes end-to-end delay and energy consumption. Through network parameter optimization and a limit on the overall number of installed relays, the ISA-based deployment provides a prolonged lifespan. Simulations demonstrate that the suggested approach is successful in a range of issue complexity scenarios.