The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(I...The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(IoT)relies on the support of base stations,which provide a solid foundation for achieving a more intelligent way of living.In a specific area,achieving higher signal coverage with fewer base stations has become an urgent problem.Therefore,this article focuses on the effective coverage area of base station signals and proposes a novel Evolutionary Particle Swarm Optimization(EPSO)algorithm based on collective prediction,referred to herein as ECPPSO.Introducing a new strategy called neighbor-based evolution prediction(NEP)addresses the issue of premature convergence often encountered by PSO.ECPPSO also employs a strengthening evolution(SE)strategy to enhance the algorithm’s global search capability and efficiency,ensuring enhanced robustness and a faster convergence speed when solving complex optimization problems.To better adapt to the actual communication needs of base stations,this article conducts simulation experiments by changing the number of base stations.The experimental results demonstrate thatunder the conditionof 50 ormore base stations,ECPPSOconsistently achieves the best coverage rate exceeding 95%,peaking at 99.4400%when the number of base stations reaches 80.These results validate the optimization capability of the ECPPSO algorithm,proving its feasibility and effectiveness.Further ablative experiments and comparisons with other algorithms highlight the advantages of ECPPSO.展开更多
1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Int...1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Intergovernmental Panel on Climate Change(IPCC)—consistently predict the widespread implementation of CO_(2)geological storage on a global scale.展开更多
In the context of security systems,adequate signal coverage is paramount for the communication between security personnel and the accurate positioning of personnel.Most studies focus on optimizing base station deploym...In the context of security systems,adequate signal coverage is paramount for the communication between security personnel and the accurate positioning of personnel.Most studies focus on optimizing base station deployment under the assumption of static obstacles,aiming to maximize the perception coverage of wireless RF(Radio Frequency)signals and reduce positioning blind spots.However,in practical security systems,obstacles are subject to change,necessitating the consideration of base station deployment in dynamic environments.Nevertheless,research in this area still needs to be conducted.This paper proposes a Dynamic Indoor Environment Beacon Deployment Algorithm(DIE-BDA)to address this problem.This algorithm considers the dynamic alterations in obstacle locations within the designated area.It determines the requisite number of base stations,the requisite time,and the area’s practical and overall signal coverage rates.The experimental results demonstrate that the algorithm can calculate the deployment strategy in 0.12 s following a change in obstacle positions.Experimental results show that the algorithm in this paper requires 0.12 s to compute the deployment strategy after the positions of obstacles change.With 13 base stations,it achieves an effective coverage rate of 93.5%and an overall coverage rate of 97.75%.The algorithm can rapidly compute a revised deployment strategy in response to changes in obstacle positions within security systems,thereby ensuring the efficacy of signal coverage.展开更多
This study investigates the disparities in the deployment of photovoltaic(PV)technology for carbon emissions reduction across different nations,highlighting the mismatch between countries with high economic capacity a...This study investigates the disparities in the deployment of photovoltaic(PV)technology for carbon emissions reduction across different nations,highlighting the mismatch between countries with high economic capacity and those where PV installation would maximize global decarbonization benefits.This mismatch is discussed based on three key factors influencing decarbonization via PV technology:per capita gross domestic product;carbon intensity of the energy system;and solar resource availability.Current PV deployment is predominantly concentrated in economically advanced countries,and does not coincide with regions where the environmental and economic impact of such installations would be most significant.Through a series of thought experiments,it is demonstrated how alternative prioritization strategies could significantly reduce global carbon emissions.Argument is put forward for a globally coordinated approach to PV deployment,particularly targeting high-impact sunbelt regions,to enhance the efficacy of decarbonization efforts and promote equitable energy access.The study underscores the need for international policies that support sustainable energy transitions in economically less developed regions through workforce development and assistance with the activation of capital.展开更多
Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic ...Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.展开更多
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 ne...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.展开更多
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 ...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.展开更多
1|OVERVIEW.Machine learning(ML)has been increasingly used for tackling various diagnostic,therapeutic,and prognostic tasks owing to its capability to learn and reason without explicit programming[1].Most developed ML ...1|OVERVIEW.Machine learning(ML)has been increasingly used for tackling various diagnostic,therapeutic,and prognostic tasks owing to its capability to learn and reason without explicit programming[1].Most developed ML models have had their accuracy proven through internal validation using retrospective data.However,external validation using retrospective data,continual monitoring using prospective data,and randomized controlled trials(RCTs)using prospective data are important for the translation of ML models into real-world clinical practice[2].展开更多
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 betwee...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.展开更多
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 at...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.展开更多
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...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.展开更多
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 UAV...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.展开更多
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 th...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.展开更多
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 de...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.展开更多
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 des...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.展开更多
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 concer...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.展开更多
By optimizing the network topology, this paper proposes a newmethod of queuing theory clustering algorithm based on dynamic programming in a home energy management system（ HEMS）. First, the total cost of the HEMS sy...By optimizing the network topology, this paper proposes a newmethod of queuing theory clustering algorithm based on dynamic programming in a home energy management system（ HEMS）. First, the total cost of the HEMS system is divided into two parts, the gateway installation cost and the data transmission cost. Secondly, through comparing two kinds of different queuing theories, the cost problem of the HEMS is converted into the problem of gateway deployment. Finally, a machine-to-machine（ M2M） gateway configuration scheme is designed to minimize the cost of the system. Simulation results showthat the cost of the HEMS system mainly comes from the installation cost of the gateways when the gateway buffer space is large enough. If the gateway buffer space is limited, the proposed queue algorithm can effectively achieve optimal gateway setting while maintaining the minimal cost of the HEMS at desired levels through marginal analyses and the properties of cost minimization.展开更多
Tethered satellite systems（TSSs） have attracted significant attention due to their potential and valuable applications for scientific research. With the development of various launched on-orbit missions, the deploym...Tethered satellite systems（TSSs） have attracted significant attention due to their potential and valuable applications for scientific research. With the development of various launched on-orbit missions, the deployment of tethers is considered a crucial technology for operation of a TSS. Both past orbiting experiments and numerical results have shown that oscillations of the deployed tether due to the Coriolis force and environmental perturbations are inevitable and that the impact between the space tether and end-body at the end of the deployment process leads to complicated nonlinear phenomena. Hence, a set of suitable control methods plays a fundamental role in tether deployment. This review article summarizes previous work on aspects of the dynamics, control, and ground-based experiments of tether deployment. The relevant basic principles, analytical expressions, simulation cases, and experimental results are presented as well.展开更多
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 ...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.展开更多
To deal with a bottom up process model for design reuses a specific extended house of quality(EHOQ)is proposed Two kinds of supported functions,basic supported functions and new supported functions,are defined.Two ...To deal with a bottom up process model for design reuses a specific extended house of quality(EHOQ)is proposed Two kinds of supported functions,basic supported functions and new supported functions,are defined.Two processes to determine two kinds of functions are presented A kind of EHOQ matrix for a company is given and its management steps are studied.展开更多
基金supported by the National Natural Science Foundation of China(Nos.62272418,62102058)Basic Public Welfare Research Program of Zhejiang Province(No.LGG18E050011)the Major Open Project of Key Laboratory for Advanced Design and Intelligent Computing of the Ministry of Education under Grant ADIC2023ZD001,National Undergraduate Training Program on Innovation and Entrepreneurship(No.202410345054).
文摘The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(IoT)relies on the support of base stations,which provide a solid foundation for achieving a more intelligent way of living.In a specific area,achieving higher signal coverage with fewer base stations has become an urgent problem.Therefore,this article focuses on the effective coverage area of base station signals and proposes a novel Evolutionary Particle Swarm Optimization(EPSO)algorithm based on collective prediction,referred to herein as ECPPSO.Introducing a new strategy called neighbor-based evolution prediction(NEP)addresses the issue of premature convergence often encountered by PSO.ECPPSO also employs a strengthening evolution(SE)strategy to enhance the algorithm’s global search capability and efficiency,ensuring enhanced robustness and a faster convergence speed when solving complex optimization problems.To better adapt to the actual communication needs of base stations,this article conducts simulation experiments by changing the number of base stations.The experimental results demonstrate thatunder the conditionof 50 ormore base stations,ECPPSOconsistently achieves the best coverage rate exceeding 95%,peaking at 99.4400%when the number of base stations reaches 80.These results validate the optimization capability of the ECPPSO algorithm,proving its feasibility and effectiveness.Further ablative experiments and comparisons with other algorithms highlight the advantages of ECPPSO.
基金supported by the National Key Research and Development Program of China(2022YFE0206700)。
文摘1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Intergovernmental Panel on Climate Change(IPCC)—consistently predict the widespread implementation of CO_(2)geological storage on a global scale.
文摘In the context of security systems,adequate signal coverage is paramount for the communication between security personnel and the accurate positioning of personnel.Most studies focus on optimizing base station deployment under the assumption of static obstacles,aiming to maximize the perception coverage of wireless RF(Radio Frequency)signals and reduce positioning blind spots.However,in practical security systems,obstacles are subject to change,necessitating the consideration of base station deployment in dynamic environments.Nevertheless,research in this area still needs to be conducted.This paper proposes a Dynamic Indoor Environment Beacon Deployment Algorithm(DIE-BDA)to address this problem.This algorithm considers the dynamic alterations in obstacle locations within the designated area.It determines the requisite number of base stations,the requisite time,and the area’s practical and overall signal coverage rates.The experimental results demonstrate that the algorithm can calculate the deployment strategy in 0.12 s following a change in obstacle positions.Experimental results show that the algorithm in this paper requires 0.12 s to compute the deployment strategy after the positions of obstacles change.With 13 base stations,it achieves an effective coverage rate of 93.5%and an overall coverage rate of 97.75%.The algorithm can rapidly compute a revised deployment strategy in response to changes in obstacle positions within security systems,thereby ensuring the efficacy of signal coverage.
基金supported by the Helmholtz Association within the framework of the innovation platform“Solar TAP”[Az:714-62150-3/1(2023)]co-funded by the European Union(ERC,C2C-PV,project number 101088359)。
文摘This study investigates the disparities in the deployment of photovoltaic(PV)technology for carbon emissions reduction across different nations,highlighting the mismatch between countries with high economic capacity and those where PV installation would maximize global decarbonization benefits.This mismatch is discussed based on three key factors influencing decarbonization via PV technology:per capita gross domestic product;carbon intensity of the energy system;and solar resource availability.Current PV deployment is predominantly concentrated in economically advanced countries,and does not coincide with regions where the environmental and economic impact of such installations would be most significant.Through a series of thought experiments,it is demonstrated how alternative prioritization strategies could significantly reduce global carbon emissions.Argument is put forward for a globally coordinated approach to PV deployment,particularly targeting high-impact sunbelt regions,to enhance the efficacy of decarbonization efforts and promote equitable energy access.The study underscores the need for international policies that support sustainable energy transitions in economically less developed regions through workforce development and assistance with the activation of capital.
基金supported by the National Natural Science Foundation of China under Grant Nos.U21A20464,62066005Innovation Project of Guangxi Graduate Education under Grant No.YCSW2024313.
文摘Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.
基金supported by National Natural Science Foundation of China(Grant No.61871209,No.62272182 and No.61901210)Shenzhen Science and Technology Program under Grant JCYJ20220530161004009+2 种基金Natural Science Foundation of Hubei Province(Grant No.2022CF011)Wuhan Business University Doctoral Fundamental Research Funds(Grant No.2021KB005)in part by Artificial Intelligence and Intelligent Transportation Joint Technical Center of HUST and Hubei Chutian Intelligent Transportation Co.,LTD under project Intelligent Tunnel Integrated Monitoring and Management System.
文摘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.
基金Supported by National Key R&D Program of China (Grant No.2023YFB3407103)National Natural Science Foundation of China (Grant Nos.52175242,52175027)Young Elite Scientists Sponsorship Program by CAST (Grant No.2022QNRC001)。
文摘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.
文摘1|OVERVIEW.Machine learning(ML)has been increasingly used for tackling various diagnostic,therapeutic,and prognostic tasks owing to its capability to learn and reason without explicit programming[1].Most developed ML models have had their accuracy proven through internal validation using retrospective data.However,external validation using retrospective data,continual monitoring using prospective data,and randomized controlled trials(RCTs)using prospective data are important for the translation of ML models into real-world clinical practice[2].
基金funded by Project Number INML2104 under the Interdisciplinary Center of Smart Mobility and Logistics at King Fahd University of Petroleum and Minerals.This study also was supported by the Special Research Fund BOF23KV17.
文摘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.
基金the National Natural Science Foundation of China(Grant No.42174047 and No.42174036)the National Science Foundation Project for Outstanding Youth(No.42104034).
文摘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.
基金supported in part by the Beijing Natural Science Foundation under Grant L201011in part by the National Natural Science Foundation of China(U2001213 and 61971191)in part by National Key Research and Development Project(2020YFB1807204)。
文摘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.
基金supported by Project funded by China Postdoctoral Science Foundation(No.2021MD703980)。
文摘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.
基金supported by Fundamental Research Program of Shanxi Province(No.20210302123444)the Research Project at the College Level of China Institute of Labor Relations(No.23XYJS018)+2 种基金the ICH Digitalization and Multi-Source Information Fusion Fujian Provincial University Engineering Research Center 2022 Open Fund Project(G3-KF2207)the China University Industry University Research Innovation Fund(No.2021FNA02009)the Key R&D Program(International Science and Technology Cooperation Project)of Shanxi Province China(No.201903D421003).
文摘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.
文摘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.
基金This work was supported in part by the Natural Science Foundation of the Education Department of Henan Province(Grant 22A520025)the National Natural Science Foundation of China(Grant 61975053)the National Key Research and Development of Quality Information Control Technology for Multi-Modal Grain Transportation Efficient Connection(2022YFD2100202).
文摘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.
文摘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.
基金The National Natural Science Foundation of China(No.61471031)the Fundamental Research Funds for the Central Universities(No.2013JBZ01)the Program for New Century Excellent Talents in University of Ministry of Education of China(No.NCET-12-0766)
文摘By optimizing the network topology, this paper proposes a newmethod of queuing theory clustering algorithm based on dynamic programming in a home energy management system（ HEMS）. First, the total cost of the HEMS system is divided into two parts, the gateway installation cost and the data transmission cost. Secondly, through comparing two kinds of different queuing theories, the cost problem of the HEMS is converted into the problem of gateway deployment. Finally, a machine-to-machine（ M2M） gateway configuration scheme is designed to minimize the cost of the system. Simulation results showthat the cost of the HEMS system mainly comes from the installation cost of the gateways when the gateway buffer space is large enough. If the gateway buffer space is limited, the proposed queue algorithm can effectively achieve optimal gateway setting while maintaining the minimal cost of the HEMS at desired levels through marginal analyses and the properties of cost minimization.
基金funded by the National Natural Science Foundation of China (11672125, 11732006)the Civil Aerospace Pre-research Project of China (D010305)+1 种基金the Research Fund of State Key Laboratory of Mechanics and Control of Mechanical Structures (Nanjing University of Aeronautics and Astronautics, MCMS-0116K01)the Fundamental Research Funds for the Central Universities (NS2016009)
文摘Tethered satellite systems（TSSs） have attracted significant attention due to their potential and valuable applications for scientific research. With the development of various launched on-orbit missions, the deployment of tethers is considered a crucial technology for operation of a TSS. Both past orbiting experiments and numerical results have shown that oscillations of the deployed tether due to the Coriolis force and environmental perturbations are inevitable and that the impact between the space tether and end-body at the end of the deployment process leads to complicated nonlinear phenomena. Hence, a set of suitable control methods plays a fundamental role in tether deployment. This review article summarizes previous work on aspects of the dynamics, control, and ground-based experiments of tether deployment. The relevant basic principles, analytical expressions, simulation cases, and experimental results are presented as well.
文摘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.
基金This project is supported by Provincial Natural Science Foundation of both Hebei (No.699059) and Tianjin(No.003804611).
文摘To deal with a bottom up process model for design reuses a specific extended house of quality(EHOQ)is proposed Two kinds of supported functions,basic supported functions and new supported functions,are defined.Two processes to determine two kinds of functions are presented A kind of EHOQ matrix for a company is given and its management steps are studied.
