Deployment optimization for target perpetual coverage in energy harvesting wireless sensor network

Energy limitation of traditional Wireless Sensor Networks(WSNs)greatly confines the network lifetime due to generating and processing massive sensing data with a limited battery.The energy harvesting WSN is a novel network architecture to address the limitation of traditional WSN.However,existing coverage and deployment schemes neglect the environmental correlation of sensor nodes and external energy with respect to physical space.Comprehensively considering the spatial correlation of the environment and the uneven distribution of energy in energy harvesting WSN,we investigate how to deploy a collection of sensor nodes to save the deployment cost while ensuring the target perpetual coverage.The Confident Information Coverage(CIC)model is adopted to formulate the CIC Minimum Deployment Cost Target Perpetual Coverage(CICMTP)problem to minimize the deployed sensor nodes.As the CICMTP is NP-hard,we devise two approximation algorithms named Local Greedy Threshold Algorithm based on CIC(LGTA-CIC)and Overall Greedy Search Algorithm based on CIC(OGSA-CIC).The LGTA-CIC has a low time complexity and the OGSA-CIC has a better approximation rate.Extensive simulation results demonstrate that the OGSA-CIC is able to achieve lower deployment cost and the performance of the proposed algorithms outperforms GRNP,TPNP and EENP algorithms.

An Optimization Approach of IoD Deployment for Optimal Coverage Based on Radio Frequency Model

Recently,Internet of Drones(IoD)has garnered significant attention due to its widespread applications.However,deploying IoD for area coverage poses numerous limitations and challenges.These include interference between neighboring drones,the need for directional antennas,and altitude restrictions for drones.These challenges necessitate the development of efficient solutions.This research paper presents a cooperative decision-making approach for an efficient IoDdeployment to address these challenges effectively.The primary objective of this study is to achieve an efficient IoDdeployment strategy thatmaximizes the coverage regionwhile minimizing interference between neighboring drones.In deployment problem,the interference increases as the number of deployed drones increases,resulting in bad quality of communication.On the other hand,deploying a few drones cannot satisfy the coverage demand.To accomplish this,an enhanced version of a concise population-based meta-heuristic algorithm,namely Improved Particle SwarmOptimization(IPSO),is applied.The objective function of IPSO is defined based on the coverage probability,which is primarily influenced by the characteristics of the antennas and drone altitude.A radio frequency(RF)model is derived to evaluate the coverage quality,considering both Line of Sight(LOS)and Non-Line of Sight(NLOS)down-link coverage probabilities for ground communication.It is assumed that each drone is equipped with a directional antenna to optimize coverage in a given region.Extensive simulations are conducted to assess the effectiveness of the proposed approach.Results demonstrate that the proposed method achieves maximum coverage with minimum transmission power.Furthermore,a comparison is made against Collaborative Visual Area Coverage Approach(CVACA),and a game-based approach in terms of coverage quality and convergence speed.The simulation results reveal that our approach outperforms both CVACA and the gamebased schemes in terms of coverage and convergence speed.Comparisons validate the superiority of our approach over existing methods.To assess the robustness of the proposed RFmodel,we have considered two distinct ranges of noise:range1 spanning from−120 to−90 dBm,and range2 spanning from−90 to−70 dBmfor different numbers of UAVs.In summary,this research presents a cooperative decision-making approach for efficient IoD deployment to address the challenges associatedwith area coverage and achieves an optimal coveragewithminimal interference.

Systematic Cloud-Based Optimization: Twin-Fold Moth Flame Algorithm for VM Deployment and Load-Balancing

Cloud computing has gained significant recognition due to its ability to provide a broad range of online services and applications.Nevertheless,existing commercial cloud computing models demonstrate an appropriate design by concentrating computational assets,such as preservation and server infrastructure,in a limited number of large-scale worldwide data facilities.Optimizing the deployment of virtual machines(VMs)is crucial in this scenario to ensure system dependability,performance,and minimal latency.A significant barrier in the present scenario is the load distribution,particularly when striving for improved energy consumption in a hypothetical grid computing framework.This design employs load-balancing techniques to allocate different user workloads across several virtual machines.To address this challenge,we propose using the twin-fold moth flame technique,which serves as a very effective optimization technique.Developers intentionally designed the twin-fold moth flame method to consider various restrictions,including energy efficiency,lifespan analysis,and resource expenditures.It provides a thorough approach to evaluating total costs in the cloud computing environment.When assessing the efficacy of our suggested strategy,the study will analyze significant metrics such as energy efficiency,lifespan analysis,and resource expenditures.This investigation aims to enhance cloud computing techniques by developing a new optimization algorithm that considers multiple factors for effective virtual machine placement and load balancing.The proposed work demonstrates notable improvements of 12.15%,10.68%,8.70%,13.29%,18.46%,and 33.39%for 40 count data of nodes using the artificial bee colony-bat algorithm,ant colony optimization,crow search algorithm,krill herd,whale optimization genetic algorithm,and improved Lévy-based whale optimization algorithm,respectively.

Optimization and Deployment of Memory-Intensive Operations in Deep Learning Model on Edge

As a large amount of data is increasingly generated from edge devices,such as smart homes,mobile phones,and wearable devices,it becomes crucial for many applications to deploy machine learning modes across edge devices.The execution speed of the deployed model is a key element to ensure service quality.Considering a highly heterogeneous edge deployment scenario,deep learning compiling is a novel approach that aims to solve this problem.It defines models using certain DSLs and generates efficient code implementations on different hardware devices.However,there are still two aspects that are not yet thoroughly investigated yet.The first is the optimization of memory-intensive operations,and the second problem is the heterogeneity of the deployment target.To that end,in this work,we propose a system solution that optimizes memory-intensive operation,optimizes the subgraph distribution,and enables the compiling and deployment of DNN models on multiple targets.The evaluation results show the performance of our proposed system.

Topology Optimization of Sound-Absorbing Materials for Two-Dimensional Acoustic Problems Using Isogeometric Boundary Element Method

In this work,an acoustic topology optimizationmethod for structural surface design covered by porous materials is proposed.The analysis of acoustic problems is performed using the isogeometric boundary elementmethod.Taking the element density of porousmaterials as the design variable,the volume of porousmaterials as the constraint,and the minimum sound pressure or maximum scattered sound power as the design goal,the topology optimization is carried out by solid isotropic material with penalization(SIMP)method.To get a limpid 0–1 distribution,a smoothing Heaviside-like function is proposed.To obtain the gradient value of the objective function,a sensitivity analysis method based on the adjoint variable method(AVM)is proposed.To find the optimal solution,the optimization problems are solved by the method of moving asymptotes(MMA)based on gradient information.Numerical examples verify the effectiveness of the proposed topology optimization method in the optimization process of two-dimensional acoustic problems.Furthermore,the optimal distribution of sound-absorbingmaterials is highly frequency-dependent and usually needs to be performed within a frequency band.

Hybrid Power Bank Deployment Model for Energy Supply Coverage Optimization in Industrial Wireless Sensor Network

Energy supply is one of the most critical challenges of wireless sensor networks(WSNs)and industrial wireless sensor networks(IWSNs).While research on coverage optimization problem(COP)centers on the network’s monitoring coverage,this research focuses on the power banks’energy supply coverage.The study of 2-D and 3-D spaces is typical in IWSN,with the realistic environment being more complex with obstacles(i.e.,machines).A 3-D surface is the field of interest(FOI)in this work with the established hybrid power bank deployment model for the energy supply COP optimization of IWSN.The hybrid power bank deployment model is highly adaptive and flexible for new or existing plants already using the IWSN system.The model improves the power supply to a more considerable extent with the least number of power bank deployments.The main innovation in this work is the utilization of a more practical surface model with obstacles and training while improving the convergence speed and quality of the heuristic algorithm.An overall probabilistic coverage rate analysis of every point on the FOI is provided,not limiting the scope to target points or areas.Bresenham’s algorithm is extended from 2-D to 3-D surface to enhance the probabilistic covering model for coverage measurement.A dynamic search strategy(DSS)is proposed to modify the artificial bee colony(ABC)and balance the exploration and exploitation ability for better convergence toward eliminating NP-hard deployment problems.Further,the cellular automata(CA)is utilized to enhance the convergence speed.The case study based on two typical FOI in the IWSN shows that the CA scheme effectively speeds up the optimization process.Comparative experiments are conducted on four benchmark functions to validate the effectiveness of the proposed method.The experimental results show that the proposed algorithm outperforms the ABC and gbest-guided ABC(GABC)algorithms.The results show that the proposed energy coverage optimization method based on the hybrid power bank deployment model generates more accurate results than the results obtained by similar algorithms(i.e.,ABC,GABC).The proposed model is,therefore,effective and efficient for optimization in the IWSN.

Study on the Optimization of Two-dimensional Electrophoresis Technology System for Rapeseed Proteome

[Objective] The research aimed to establish the two-dimensional electrophoresis（2-DE）technology which was suitable for the rapeseed proteome research.[Method] Xiangyou 17 was as the material.The sample preparation method,gel concentration and loading amount,etc.in 2-DE technology were optimized.[Result] The best extraction method of total protein of rapeseed was TCA-acetone method,and the protein spots on 2-DE map were the most.When IPG strip（pH 3-10）and 12% gel were used,and the loading amount was 250 μg,the two-dimensional electrophoresis map with the clear background,good repeatability and high protein spot resolution was obtained.[Conclusion] The research laid the foundation for carrying out the rapeseed proteomics research.

Optimal deployment of swarm positions in cooperative interception of multiple UAV swarms

In order to prevent the attacker from breaking through the blockade of the interception,deploying multiple Unmanned Aerial Vehicle(UAV)swarms on the interception line is a new combat style.To solve the optimal deployment of swarm positions in the cooperative interception,an optimal deployment optimization model is presented by minimizing the penetration zones'area and the analytical expression of the optimal deployment positions is deduced.Firstly,from the view of the attackers breaking through the interception line,the situations of vertical penetration and oblique penetration are analyzed respectively,and the mathematical models of penetration zones are obtained under the condition of a single UAV swarm and multiple UAV swarms.Secondly,based on the optimization goal of minimizing the penetration area,the optimal deployment optimization model for swarm positions is proposed,and the analytical solution of the optimal deployment is solved by using the convex programming theory.Finally,the proposed optimal deployment is compared with the uniform deployment and random deployment to verify the validity of the theoretical analysis.

Cuckoo search algorithm-based optimal deployment method of heterogeneous multistatic radar for barrier coverage

This paper proposes an optimal deployment method of heterogeneous multistatic radars to construct arc barrier coverage with location restrictions.This method analyzes and proves the properties of different deployment patterns in the optimal deployment sequence.Based on these properties and considering location restrictions,it introduces an optimization model of arc barrier coverage and aims to minimize the total deployment cost of heterogeneous multistatic radars.To overcome the non-convexity of the model and the non-analytical nature of the objective function,an algorithm combining integer line programming and the cuckoo search algorithm(CSA)is proposed.The proposed algorithm can determine the number of receivers and transmitters in each optimal deployment squence to minimize the total placement cost.Simulations are conducted in different conditions to verify the effectiveness of the proposed method.

Numerical Simulation of Two-Phase Flow in Glutenite Reservoirs for Optimized Deployment in Horizontal Wells

It is known that the pore media characteristics of glutenite reservoirs are different from those of conventional sandstone reservoirs.Low reservoir permeability and naturally developed microfractures make water injection in this kind of reservoir very difficult.In this study,new exploitation methods are explored.Using a real glutenite reservoir as a basis,a three-dimensional fine geological model is elaborated.Then,combining the model with reservoir performance information,and through a historical fitting analysis,the saturation abundance distribution of remaining oil in the reservoir is determined.It is shown that,using this information,predictions can be made about whether the considered reservoir is suitable for horizontal well fracturing or not.The direction,well length,well spacing and productivity of horizontal well are also obtained.

Sensors deployment optimization in multi-dimensional space based on improved particle swarm optimization algorithm

Sensors deployment optimization has become one of the most attractive fields in recent years. However, most of the previous work focused on the deployment problem in 2D space.Compared to the traditional form, sensors deployment in multidimensional space has greater research significance and practical potential to satisfy the detecting needs in complex environment.Aiming at solving this issue, a multi-dimensional space sensor network model is established, and the radar system is selected as an example. Considering the possible working mode of the radar system(e.g., searching and tracking), two distinctive deployment models are proposed based on maximum coverage area and maximum target detection probability in the attack direction respectively. The latter one is usually ignored in the previous literature.For uncovering the optimal deployment of the sensor network, the particle swarm optimization(PSO) algorithm is improved using the proposed weights determination scheme, in which the linear decreasing, the pooling strategy and the cloud theory are combined for weights updating. Experimental results illustrate the effectiveness of the proposed method.

Hybrid optimization of dynamic deployment for networked fire control system

With applying the information technology to the military field, the advantages and importance of the networked combat are more and more obvious. In order to make full use of limited battlefield resources and maximally destroy enemy targets from arbitrary angle in a limited time, the research on firepower nodes dynamic deployment becomes a key problem of command and control. Considering a variety of tactical indexes and actual constraints in air defense, a mathematical model is formulated to minimize the enemy target penetration probability. Based on characteristics of the mathematical model and demands of the deployment problems, an assistance-based algorithm is put forward which combines the artificial potential field （APF） method with a memetic algorithm. The APF method is employed to solve the constraint handling problem and generate feasible solutions. The constrained optimization problem transforms into an optimization problem of APF parameters adjustment, and the dimension of the problem is reduced greatly. The dynamic deployment is accomplished by generation and refinement of feasible solutions. The simulation results show that the proposed algorithm is effective and feasible in dynamic situation.

System deployment optimization in architecture design

Optimization of architecture design has recently drawn research interest. System deployment optimization （SDO） refers to the process of optimizing systems that are being deployed to activi- ties. This paper first formulates a mathematical model to theorize and operationalize the SDO problem and then identifies optimal so- lutions to solve the SDO problem. In the solutions, the success rate of the combat task is maximized, whereas the execution time of the task and the cost of changes in the system structure are mini- mized. The presented optimized algorithm generates an optimal solution without the need to check the entire search space. A novel method is finally proposed based on the combination of heuristic method and genetic algorithm （HGA）, as well as the combination of heuristic method and particle swarm optimization （HPSO）. Experi- ment results show that the HPSO method generates solutions faster than particle swarm optimization （PSO） and genetic algo- rithm （GA） in terms of execution time and performs more efficiently than the heuristic method in terms of determining the best solution.

Landslide Monitoring Point Optimization Deployment Based on Fuzzy Cluster Analysis

Landslide monitoring is one of the important means to landslide control. In order to do well this job in landslide monitoring work, first in ascertaining the geological conditions, then laying out a variety of professional monitoring points. This paper adopts the fuzzy cluster analysis method, and the landslide monitoring points by using fuzzy cluster analysis method, through the calculation of deformation of fuzzy clustering, finally draws the conclusion that the landslide monitoring point classification. The method for the landslide monitoring point optimization, as well as the landslide deformation monitoring plan modification and perfect have very important reference value.

LED Adaptive Deployment Optimization in Indoor VLC Networks

Driven by the continuous penetration of high data rate services and applications,a large amount of unregulated visible light spectrum is used for communication to fully meet the needs of 6th generation(6G)mobile technologies.Visible light communication(VLC)faces many challenges as a solution that complements existing radio frequency(RF)networks.This paper studies the optimal configuration of LEDs in indoor environments under the constraints of illumination and quality of experience(QoE).Based on the Voronoi tessellation(VT)and centroidal Voronoi tessellation(CVT)theory,combined with the Lloyd’s algorithm,we propose two approaches for optimizing LED deployments to meet the illumination and QoE requirements of all users.Focusing on(i)the minimization of the number of LEDs to be installed in order to meet illumination and average QoE constraints,and(ii)the maximization of the average QoE of users to be served with a fixed number of LEDs.Monte Carlo simulations are carried out for different user distribution compared with hexagonal,square and VT deployment.The simulation results illustrate that under the same conditions,the proposed deployment approach can provide less LEDs and achieve better QoE performance.

Image Thresholding Using Two-Dimensional Tsallis Cross Entropy Based on Either Chaotic Particle Swarm Optimization or Decomposition

The segmentation effect of Tsallis entropy method is superior to that of Shannon entropy method, and the computation speed of two-dimensional Shannon cross entropy method can be further improved by optimization. The existing two-dimensional Tsallis cross entropy method is not the strict two-dimensional extension. Thus two new methods of image thresholding using two-dimensional Tsallis cross entropy based on either Chaotic Particle Swarm Optimization (CPSO) or decomposition are proposed. The former uses CPSO to find the optimal threshold. The recursive algorithm is adopted to avoid the repetitive computation of fitness function in iterative procedure. The computing speed is improved greatly. The latter converts the two-dimensional computation into two one-dimensional spaces, which makes the computational complexity further reduced from O(L2) to O(L). The experimental results show that, compared with the proposed recently two-dimensional Shannon or Tsallis cross entropy method, the two new methods can achieve superior segmentation results and reduce running time greatly.

Multi-sink Deployment Strategy for Wireless Sensor Networks Based on Improved Particle Swarm Clustering Optimization Algorithm

In wireless sensor networks(WSNs) with single sink,the nodes close to the sink consume their energy too fast due to transferring a large number of data packages,resulting in the "energy hole" problem.Deploying multiple sink nodes in WSNs is an effective strategy to solve this problem.A multi-sink deployment strategy based on improved particle swarm clustering optimization(IPSCO) algorithm for WSNs is proposed in this paper.The IPSCO algorithm is a combination of the improved particle swarm optimization(PSO) algorithm and K-means clustering algorithm.According to the sink nodes number K,the IPSCO algorithm divides the sensor nodes in the whole network area into K clusters based on the distance between them,making the total within-class scatter to minimum,and outputs the center of each cluster.Then,multiple sink nodes in the center of each cluster can be deployed,to achieve the effects of partition network reasonably and deploy multi-sink nodes optimally.The simulation results show that the deployment strategy can prolong the network lifetime.

Mathematical Modeling and Design of RIS Deployment in a RIS-Assisted Metal Cuboid for WAIC Systems

Wireless avionics intra-communications(WAIC)is an emergent research topic,since it can improve fuel efficiency and enhance aircraft safety significantly.However,there are numerous baffles in an aircraft,e.g.,seats and cabin bulkheads,resulting in serious blockage and even destroying wireless communications.Thus,this paper focuses on the reconfigurable intelligent surface(RIS)deployment issue of RIS-assisted WAIC systems,to solve the blockage problem caused by baffles.We first propose the mirror-symmetric imaging principle for mathematically analyzing electromagnetic(EM)wave propagation in a metal cuboid,which is a typical structure of WAIC systems.Based on the mirror-symmetric imaging principle,the mathematical channel model in a metal cuboid is deduced in detail.In addition,we develop an objective function of RIS's location and deduce the optimal RIS deployment location based on the geometric center optimization lemma.A two-dimensional gravity center search algorithm is then presented.Simulation results show that the designed RIS deployment can greatly increase the received power and efficiently solve the blockage problem in the aircraft.

Joint On-Demand Pruning and Online Distillation in Automatic Speech Recognition Language Model Optimization

Automatic speech recognition(ASR)systems have emerged as indispensable tools across a wide spectrum of applications,ranging from transcription services to voice-activated assistants.To enhance the performance of these systems,it is important to deploy efficient models capable of adapting to diverse deployment conditions.In recent years,on-demand pruning methods have obtained significant attention within the ASR domain due to their adaptability in various deployment scenarios.However,these methods often confront substantial trade-offs,particularly in terms of unstable accuracy when reducing the model size.To address challenges,this study introduces two crucial empirical findings.Firstly,it proposes the incorporation of an online distillation mechanism during on-demand pruning training,which holds the promise of maintaining more consistent accuracy levels.Secondly,it proposes the utilization of the Mogrifier long short-term memory(LSTM)language model(LM),an advanced iteration of the conventional LSTM LM,as an effective alternative for pruning targets within the ASR framework.Through rigorous experimentation on the ASR system,employing the Mogrifier LSTM LM and training it using the suggested joint on-demand pruning and online distillation method,this study provides compelling evidence.The results exhibit that the proposed methods significantly outperform a benchmark model trained solely with on-demand pruning methods.Impressively,the proposed strategic configuration successfully reduces the parameter count by approximately 39%,all the while minimizing trade-offs.

Shape-sizing nested optimization of deployable structures using SQP

The potential role of formal structural optimization was investigated for designing foldable and deployable structures in this work.Shape-sizing nested optimization is a challenging design problem.Shape,represented by the lengths and relative angles of elements,is critical to achieving smooth deployment to a desired span,while the section profiles of each element must satisfy structural dynamic performances in each deploying state.Dynamic characteristics of deployable structures in the initial state,the final state and also the middle deploying states are all crucial to the structural dynamic performances.The shape was represented by the nodal coordinates and the profiles of cross sections were represented by the diameters and thicknesses.SQP(sequential quadratic programming) method was used to explore the design space and identify the minimum mass solutions that satisfy kinematic and structural dynamic constraints.The optimization model and methodology were tested on the case-study of a deployable pantograph.This strategy can be easily extended to design a wide range of deployable structures,including deployable antenna structures,foldable solar sails,expandable bridges and retractable gymnasium roofs.