Related Experiment Video
Updated: Dec 13, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Regional Optimization Dynamic Algorithm for Node Placement in Wireless Sensor Networks
1Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, No. 130, Meilong Road, Shanghai 200237, China.
Abstract:
Node placement is one of the basic problems in a Wireless Sensor Network (WSN). During the operation of a WSN, sensor nodes may fail or die suddenly, which may lead to a coverage hole. To solve this problem, the node placement needs to be re-optimized. The dimensions of node placement optimization are high because of the large node number. In view of this defect, a regional optimization dynamic algorithm is put forward. In this paper, the regional optimization problem of node placement is modeled, and a regional optimization dynamic algorithm with a mixed strategy for node placement (MRDA) is proposed. Simulation experiments are carried out for the proposed algorithm and other comparison algorithms. Results of experiments show that the proposed algorithm can greatly reduce the dimensions and narrow the search range, with a significant improvement in the search performance and convergence speed.
Related Concept Videos
Distributed Loads: Problem Solving
Fast Decoupled and DC Powerflow
Nodal Analysis
Consider, for instance, a simple circuit composed of three nodes and three resistors, as shown in...
Area Computation by the Alternative Coordinate Method
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
The Midpoint Formula

