In order to realize the intelligent management of a power materials warehouse, the Internet of Things based on wireless sensor networks (WSNs) is a promising effective solution. Considering the limited battery capacity of sensor nodes, the optimization of the topology control and the determination of the amount of collected data are critical for prolonging the survival time of WSNs and increasing the satisfaction of the warehouse supplier. Therefore, in this paper, an optimization problem on sensor association and acquisition data satisfaction is proposed, and the subproblem of the sensor association is modeled as the knapsack problem. To cope with it, the block coordinate descent method is used to obtain the suboptimal solution. A sensor association scheme based on the ant colony algorithm (ACO) is proposed, and the upper and lower bounds of this optimization problem are also obtained. After this, a cluster head selection algorithm is given to find the optimal cluster head. Finally, the experimental simulations show that the algorithms proposed in this paper can effectively improve the energy utilization of WSNs to ensure the intelligent management of a power materials warehouse.
Wireless sensor networks are used to monitor the operating status of the microgrids, which can effectively improve the stability of power supplies. The topology control is a critical issue of wireless sensor networks, which affects monitoring data transmission reliability and lifetime of wireless sensor networks. Meanwhile, the data acquisition accuracy of wireless sensor networks has a great impact on the quality of monitoring. Therefore, this paper focuses on improving wireless sensor networks data acquisition satisfaction and energy efficiency. A joint acquisition time design and sensor association optimization algorithm is proposed to prolong the lifetime of wireless sensor networks and enhance the stability of monitoring, which considers the cluster heads selection, data collection satisfaction and sensor association. First, a multi-constrained mixed-integer programming problem, which combines acquisition time design and sensor association, is formulated to maximize data acquisition satisfaction and minimize energy consumption. To solve this problem, we propose an iterative algorithm based on block coordinate descent technology. In each iteration, the acquisition time is obtained by Lagrangian duality. After that, the sensor association is modeled as a 0–1 knapsack problem, and the three different methods are proposed to solve it. Finally, the simulations are provided to demonstrate the efficiency of the algorithm proposed in this paper.