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.

Deployment Dynamic Modeling and Driving Schemes for a Ring-Truss Deployable Antenna

Mesh reflector antennas are widely used in space tasks owing to their light weight,high surface accuracy,and large folding ratio.They are stowed during launch and then fully deployed in orbit to form a mesh reflector that transmits signals.Smooth deployment is essential for duty services;therefore,accurate and efficient dynamic modeling and analysis of the deployment process are essential.One major challenge is depicting time-varying resistance of the cable network and capturing the cable-truss coupling behavior during the deployment process.This paper proposes a general dynamic analysis methodology for cable-truss coupling.Considering the topological diversity and geometric nonlinearity,the cable network's equilibrium equation is derived,and an explicit expression of the time-varying tension of the boundary cables,which provides the main resistance in truss deployment,is obtained.The deployment dynamic model is established,which considers the coupling effect between the soft cables and deployable truss.The effects of the antenna's driving modes and parameters on the dynamic deployment performance were investigated.A scaled prototype was manufactured,and the deployment experiment was conducted to verify the accuracy of the proposed modeling method.The proposed methodology is suitable for general cable antennas with arbitrary topologies and parameters,providing theoretical guidance for the dynamic performance evaluation of antenna driving schemes.

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.

Deployment of Edge Computing Nodes in IoT:Effective Implementation of Simulated Annealing Method Based on User Location

Edge computing paradigm for 5G architecture has been considered as one of the most effective ways to realize low latency and highly reliable communication,which brings computing tasks and network resources to the edge of network.The deployment of edge computing nodes is a key factor affecting the service performance of edge computing systems.In this paper,we propose a method for deploying edge computing nodes based on user location.Through the combination of Simulation of Urban Mobility(SUMO)and Network Simulator-3(NS-3),a simulation platform is built to generate data of hotspot areas in Io T scenario.By effectively using the data generated by the communication between users in Io T scenario,the location area of the user terminal can be obtained.On this basis,the deployment problem is expressed as a mixed integer linear problem,which can be solved by Simulated Annealing(SA)method.The analysis of the results shows that,compared with the traditional method,the proposed method has faster convergence speed and better performance.

Full-domain collaborative deployment method of multiple interference sources and evaluation of its deployment effect

This paper realizes the full-domain collaborative deployment of multiple interference sources of the global satellite navigation system(GNSS)and evaluates the deployment effect to enhance the ability to disturb the attacker and the capability to defend the GNSS during navigation countermeasures.Key evaluation indicators for the jamming effect of GNSS suppressive and deceptive jamming sources are first created,their evaluation models are built,and their detection procedures are sorted out,as the basis for determining the deployment principles.The principles for collaboratively deploying multi-jamming sources are developed to obtain the deployment structures(including the required number,structures in demand,and corresponding positions)of three single interference sources required by collaboratively deploying.Accordingly,simulation and hardware-in-loop testing results are presented to determine a rational configuration of the collaborative deployment of multi-jamming sources in the set situation and further realize the full-domain deployment of an interference network from ground,air to space.Varied evaluation indices for the deployment effect are finally developed to evaluate the deployment effect of the proposed configuration and further verify its reliability and rationality.

Joint Optimization for on-Demand Deployment of UAVs and Spectrum Allocation in UAVs-Assisted Communication

To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles(UAVs),a joint optimization method for on-demand deployment and spectrum allocation of UAVs is proposed,which is modeled as a mixed-integer non-convex optimization problem(MINCOP).An algorithm to estimate the minimum number of required UAVs is firstly proposed based on the pre-estimation and simulated annealing.The MINCOP is then decomposed into three sub-problems based on the block coordinate descent method,including the spectrum allocation of UAVs,the association between UAVs and ground users,and the deployment of UAVs.Specifically,the optimal spectrum allocation is derived based on the interference mitigation and channel reuse.The association between UAVs and ground users is optimized based on local iterated optimization.A particle-based optimization algorithm is proposed to resolve the subproblem of the UAVs deployment.Simulation results show that the proposed method could effectively improve the minimum transmission rate of UAVs as well as user fairness of spectrum allocation.

Improving Network Availability through Optimized Multipath Routing and Incremental Deployment Strategies

Currently,distributed routing protocols are constrained by offering a single path between any pair of nodes,thereby limiting the potential throughput and overall network performance.This approach not only restricts the flow of data but also makes the network susceptible to failures in case the primary path is disrupted.In contrast,routing protocols that leverage multiple paths within the network offer a more resilient and efficient solution.Multipath routing,as a fundamental concept,surpasses the limitations of traditional shortest path first protocols.It not only redirects traffic to unused resources,effectively mitigating network congestion,but also ensures load balancing across the network.This optimization significantly improves network utilization and boosts the overall performance,making it a widely recognized efficient method for enhancing network reliability.To further strengthen network resilience against failures,we introduce a routing scheme known as Multiple Nodes with at least Two Choices(MNTC).This innovative approach aims to significantly enhance network availability by providing each node with at least two routing choices.By doing so,it not only reduces the dependency on a single path but also creates redundant paths that can be utilized in case of failures,thereby enhancing the overall resilience of the network.To ensure the optimal placement of nodes,we propose three incremental deployment algorithms.These algorithms carefully select the most suitable set of nodes for deployment,taking into account various factors such as node connectivity,traffic patterns,and network topology.By deployingMNTCon a carefully chosen set of nodes,we can significantly enhance network reliability without the need for a complete overhaul of the existing infrastructure.We have conducted extensive evaluations of MNTC in diverse topological spaces,demonstrating its effectiveness in maintaining high network availability with minimal path stretch.The results are impressive,showing that even when implemented on just 60%of nodes,our incremental deployment method significantly boosts network availability.This underscores the potential of MNTC in enhancing network resilience and performance,making it a viable solution for modern networks facing increasing demands and complexities.The algorithms OSPF,TBFH,DC and LFC perform fast rerouting based on strict conditions,while MNTC is not restricted by these conditions.In five real network topologies,the average network availability ofMNTCis improved by 14.68%,6.28%,4.76%and 2.84%,respectively,compared with OSPF,TBFH,DC and LFC.

A Combined Antenna Array Deployment with High Positioning Accuracy and Low Angular Measurement Error

In this paper,an antenna array composed of circular array and orthogonal linear array is proposed by using the design of long and short baseline“orthogonal linear array”and the circular array ambiguity resolution design of multi-group baseline clustering.The effectiveness of the antenna array in this paper is verified by sufficient simulation and experiment.After the system deviation correction work,it is found that in the L/S/C/X frequency bands,the ambiguity resolution probability is high,and the phase difference system error between each channel is basically the same.The angle measurement error is less than 0.5°,and the positioning error is less than 2.5 km.Notably,as the center frequency increases,calibration consistency improves,and the calibration frequency points become applicable over a wider frequency range.At a center frequency of 11.5 GHz,the calibration frequency point bandwidth extends to 1200 MHz.This combined antenna array deployment holds significant promise for a wide range of applications in contemporary wireless communication systems.

Solar-assisted two-stage catalytic membrane reactor for coupling CO_(2) splitting with methane oxidation reaction

A two-stage catalytic membrane reactor(CMR)that couples CO_(2) splitting with methane oxidation reactions was constructed based on an oxygen-permeable perovskite asymmetric membrane.The asymmetric membrane comprises a dense SrFe_(0.9)Ta_(0.1)O_(3-σ)(SFT)separation layer and a porous Sr_(0.9)(Fe_(0.9)Ta_(0.1))_(0.9)Cu_(0.1)O_(3-σ)(SFTC)catalytic layer.In thefirst stage reactor,a CO_(2) splitting reaction(CDS:2CO_(2)→2CO+O_(2))occurs at the SFTC catalytic layer.Subsequently,the O_(2) product is selectively extracted through the SFT separation layer to the permeated side for the methane combustion reaction(MCR),which provides an extremely low oxygen partial pressure to enhance the oxygen extraction.In the second stage,a Sr_(0.9)(Fe_(0.9)Ta_(0.1))_(0.9)Ni_(0.1)O_(3-σ)(SFTN)catalyst is employed to reform the products derived from MCR.The two-stage CMR design results in a remarkable 35.4%CO_(2) conversion for CDS at 900℃.The two-stage CMR was extended to a hollowfiber configuration combining with solar irradiation.The solar-assisted two-stage CMR can operate stably for over 50 h with a high hydrogen yield of 18.1 mL min^(-1) cm^(-2).These results provide a novel strategy for reducing CO_(2) emissions,suggesting potential avenues for the design of the high-performance CMRs and catalysts based on perovskite oxides in the future.

Two-Stage Optimal Scheduling of Community Integrated Energy System

From the perspective of a community energy operator,a two-stage optimal scheduling model of a community integrated energy system is proposed by integrating information on controllable loads.The day-ahead scheduling analyzes whether various controllable loads participate in the optimization and investigates the impact of their responses on the operating economy of the community integrated energy system(IES)before and after;the intra-day scheduling proposes a two-stage rolling optimization model based on the day-ahead scheduling scheme,taking into account the fluctuation of wind turbine output and load within a short period of time and according to the different response rates of heat and cooling power,and solves the adjusted output of each controllable device.The simulation results show that the optimal scheduling of controllable loads effectively reduces the comprehensive operating costs of community IES;the two-stage optimal scheduling model can meet the energy demand of customers while effectively and timely suppressing the random fluctuations on both sides of the source and load during the intra-day stage,realizing the economic and smooth operation of IES.

Two-Stage Planning of Distributed Power Supply and Energy Storage Capacity Considering Hierarchical Partition Control of Distribution Network with Source-Load-Storage

Aiming at the consumption problems caused by the high proportion of renewable energy being connected to the distribution network,it also aims to improve the power supply reliability of the power system and reduce the operating costs of the power system.This paper proposes a two-stage planning method for distributed generation and energy storage systems that considers the hierarchical partitioning of source-storage-load.Firstly,an electrical distance structural index that comprehensively considers active power output and reactive power output is proposed to divide the distributed generation voltage regulation domain and determine the access location and number of distributed power sources.Secondly,a two-stage planning is carried out based on the zoning results.In the phase 1 distribution network-zoning optimization layer,the network loss is minimized so that the node voltage in the area does not exceed the limit,and the distributed generation configuration results are initially determined;in phase 2,the partition-node optimization layer is planned with the goal of economic optimization,and the distance-based improved ant lion algorithm is used to solve the problem to obtain the optimal distributed generation and energy storage systemconfiguration.Finally,the IEEE33 node systemwas used for simulation.The results showed that the voltage quality was significantly improved after optimization,and the overall revenue increased by about 20.6%,verifying the effectiveness of the two-stage planning.

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.

QoS-Constrained,Reliable and Energy-Efficient Task Deployment in Cloud Computing

Reliability,QoS and energy consumption are three important concerns of cloud service providers.Most of the current research on reliable task deployment in cloud computing focuses on only one or two of the three concerns.However,these three factors have intrinsic trade-off relationships.The existing studies show that load concentration can reduce the number of servers and hence save energy.In this paper,we deal with the problem of reliable task deployment in data centers,with the goal of minimizing the number of servers used in cloud data centers under the constraint that the job execution deadline can be met upon single server failure.We propose a QoS-Constrained,Reliable and Energy-efficient task replica deployment(QSRE)algorithm for the problem by combining task replication and re-execution.For each task in a job that cannot finish executing by re-execution within deadline,we initiate two replicas for the task:main task and task replica.Each main task runs on an individual server.The associated task replica is deployed on a backup server and completes part of the whole task load before the main task failure.Different from the main tasks,multiple task replicas can be allocated to the same backup server to reduce the energy consumption of cloud data centers by minimizing the number of servers required for running the task replicas.Specifically,QSRE assigns the task replicas with the longest and the shortest execution time to the backup servers in turn,such that the task replicas can meet the QoS-specified job execution deadline under the main task failure.We conduct experiments through simulations.The experimental results show that QSRE can effectively reduce the number of servers used,while ensuring the reliability and QoS of job execution.

Influence of two-stage harvesting on the properties of cold-pressed rapeseed(Brassica napus L.)oils

Rapeseed(Brassica napus L.)harvesting method is critical since it significantly determines the seed yield,oil quality,and industrial efficiency.This study investigated the influences of harvesting methods on the quality of cold-pressed rapeseed oil of two varieties.Oil color,peroxide value(POV),tocopherol content,fatty acid composition,and polarity of total polyphenols(PTP)contents of two rapeseed varieties in Huanggang and Xiangyang were compared through artificially simulated combined harvesting and two-stage harvesting.Results showed significant differences in the quality of rapeseed oil between the two harvesting methods.The red value(R-value),POV,total tocopherol contents,linoleic and linolenic acid content,and PTP content of the pressed rapeseed oil prepared by the combined harvesting method were about 27.6,5.7,15.8,2.0,0.5,and 28.6%lower than those of the oil produced from the two-stage harvesting method,respectively.Xiangyang and Huayouza62 performed better in the two regions and two varieties,respectively.To sum up,the rapeseed oil obtained 41–44 days after final flowering of combined harvesting,35 days after final flowering,and six days of post-ripening of the two-stage harvesting had the best quality.

Optimization method of linear barrier coverage deployment for multistatic radar

To address the problem of building linear barrier coverage with the location restriction, an optimization method for deploying multistatic radars is proposed, where the location restriction splits the deployment line into two segments. By proving the characteristics of deployment patterns, an optimal deployment sequence consisting of multiple deployment patterns is proposed and exploited to cover each segment. The types and numbers of deployment patterns are determined by an algorithm that combines the integer linear programming(ILP)and exhaustive method(EM). In addition, to reduce the computation amount, a formula is introduced to calculate the upper threshold of receivers’ number in a deployment pattern. Furthermore, since the objective function is non-convex and non-analytic, the overall model is divided into two layers concerning two suboptimization problems. Subsequently, another algorithm that integrates the segments and layers is proposed to determine the deployment parameters, such as the minimum cost, parameters of the optimal deployment sequence, and the location of the split point. Simulation results demonstrate that the proposed method can effectively determine the optimal deployment parameters under the location restriction.

Mobile Edge Computing Servers Deployment with Improved Genetic Algorithm in Cellular Internet of Things

Mobile edge computing(MEC)provides services to devices and reduces latency in cellular internet of things(IoT)networks.However,the challenging problem is how to deploy MEC servers economically and efficiently.This paper investigates the deployment problem of MEC servers of the real-world road network by employing an improved genetic algorithm(GA)scheme.We first use the threshold-based K-means algorithm to form vehicle clusters according to their locations.We then select base stations(BSs)based on clustering center coordinates as the deployment locations set for potential MEC servers.We further select BSs using a combined simulated annealing(SA)algorithm and GA to minimize the deployment cost.The simulation results show that the improved GA deploys MEC servers effectively.In addition,the proposed algorithm outperforms GA and SA algorithms in terms of convergence speed and solution quality.

Tourism Route Recommendation Based on A Multi-Objective Evolutionary Algorithm Using Two-Stage Decomposition and Pareto Layering

Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions problems,which leads to uneven distribution and weak diversity of optimization solutions of tourism routes.Inspired by these limitations,we propose a multi-objective evolutionary algorithm for tourism route recommendation(MOTRR)with two-stage and Pareto layering based on decomposition.The method decomposes the multiobjective problem into several subproblems,and improves the distribution of solutions through a two-stage method.The crowding degree mechanism between extreme and intermediate populations is used in the two-stage method.The neighborhood is determined according to the weight of the subproblem for crossover mutation.Finally,Pareto layering is used to improve the updating efficiency and population diversity of the solution.The two-stage method is combined with the Pareto layering structure,which not only maintains the distribution and diversity of the algorithm,but also avoids the same solutions.Compared with several classical benchmark algorithms,the experimental results demonstrate competitive advantages on five test functions,hypervolume(HV)and inverted generational distance(IGD)metrics.Using the experimental results of real scenic spot datasets from two famous tourism social networking sites with vast amounts of users and large-scale online comments in Beijing,our proposed algorithm shows better distribution.It proves that the tourism routes recommended by our proposed algorithm have better distribution and diversity,so that the recommended routes can better meet the personalized needs of tourists.

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.

A multi-enterprise quality function deployment paradigm with unstructured decision-making in linguistic contexts

This paper presents an operational framework of unstructured decision-making approach involving quality function deployment(QFD)in an uncertain linguistic context.Firstly,QFD is extended to the multi-enterprise paradigm in a real-world manufacturing environment.Secondly,hesitant fuzzy linguistic term sets(HFLTSs),which facilitate the management and handling of information equivocality,are designed to construct a house of quality(HoQ)in the product planning process.The technique of computing with words is applied to bridge the gap between mechanisms of the human brain and machine processes with fuzzy linguistic term sets.Thirdly,a multi-enterprise QFD pattern is formulated as an unstructured decision-making problem for alternative infrastructure project selection in a manufacturing organization.The inter-relationships of cooperative partners are directly matched with a back propagation neural network(BPNN)to construct the multi-enterprise manufacturing network.The resilience of the manufacturing organization is considered by formulating an outranking method on the basis of HFLTSs to decide on infrastructure project alternatives.Finally,a real-world example,namely,the prototype manufacturing of an automatic transmission for a vehicle,is provided to illustrate the effectiveness of the proposed decision-making approach.

Multi-source coordinated stochastic restoration for SOP in distribution networks with a two-stage algorithm

After suffering from a grid blackout, distributed energy resources(DERs), such as local renewable energy and controllable distributed generators and energy storage can be used to restore loads enhancing the system’s resilience. In this study, a multi-source coordinated load restoration strategy was investigated for a distribution network with soft open points(SOPs). Here, the flexible regulation ability of the SOPs is fully utilized to improve the load restoration level while mitigating voltage deviations. Owing to the uncertainty, a scenario-based stochastic optimization approach was employed,and the load restoration problem was formulated as a mixed-integer nonlinear programming model. A computationally efficient solution algorithm was developed for the model using convex relaxation and linearization methods. The algorithm is organized into a two-stage structure, in which the energy storage system is dispatched in the first stage by solving a relaxed convex problem. In the second stage, an integer programming problem is calculated to acquire the outputs of both SOPs and power resources. A numerical test was conducted on both IEEE 33-bus and IEEE 123-bus systems to validate the effectiveness of the proposed strategy.