Average Secrecy Capacity of the Reconfigurable Intelligent Surface-Assisted Integrated Satellite Unmanned Aerial Vehicle Relay Networks

Integrated satellite unmanned aerial vehicle relay networks(ISUAVRNs)have become a prominent topic in recent years.This paper investigates the average secrecy capacity(ASC)for reconfigurable intelligent surface(RIS)-enabled ISUAVRNs.Especially,an eve is considered to intercept the legitimate information from the considered secrecy system.Besides,we get detailed expressions for the ASC of the regarded secrecy system with the aid of the reconfigurable intelligent.Furthermore,to gain insightful results of the major parameters on the ASC in high signalto-noise ratio regime,the approximate investigations are further gotten,which give an efficient method to value the secrecy analysis.At last,some representative computer results are obtained to prove the theoretical findings.

基于SEM与ANN混合方法的社交问答平台用户转移行为

社交问答平台得到了用户的广泛使用,但由于各平台的功能类似,用户转移起来较为容易,这将导致用户流失。基于PPM模型,研究社交问答平台用户转移行为。采集447份有效数据,采用SEM(结构方程模型)与ANN(人工神经网络)混合方法进行分析。结果发现:推力因素(不满意度、厌倦性)和拉力因素(内容质量、用户体验)正向影响用户的转移意向,锚定因素(转移成本)负向影响转移意向,且负向调节推力因素和拉力因素的作用。ANN结果显示:不满意度是影响转移意向的最重要因素。因此,社交问答平台需要提高内容质量,改善用户体验,降低用户的不满意度和厌倦性,从而防止用户的转移行为,实现用户保持。

Generative Adversarial Networks Based Digital Twin Channel Modeling for Intelligent Communication Networks

Integration of digital twin(DT)and wireless channel provides new solution of channel modeling and simulation,and can assist to design,optimize and evaluate intelligent wireless communication system and networks.With DT channel modeling,the generated channel data can be closer to realistic channel measurements without requiring a prior channel model,and amount of channel data can be significantly increased.Artificial intelligence(AI)based modeling approach shows outstanding performance to solve such problems.In this work,a channel modeling method based on generative adversarial networks is proposed for DT channel,which can generate identical statistical distribution with measured channel.Model validation is conducted by comparing DT channel characteristics with measurements,and results show that DT channel leads to fairly good agreement with measured channel.Finally,a link-layer simulation is implemented based on DT channel.It is found that the proposed DT channel model can be well used to conduct link-layer simulation and its performance is comparable to using measurement data.The observations and results can facilitate the development of DT channel modeling and provide new thoughts for DT channel applications,as well as improving the performance and reliability of intelligent communication networking.

Coordinated Planning Transmission Tasks in Heterogeneous Space Networks:A Semi-Distributed Approach

This paper studies the coordinated planning of transmission tasks in the heterogeneous space networks to enable efficient sharing of ground stations cross satellite systems.Specifically,we first formulate the coordinated planning problem into a mixed integer liner programming(MILP)problem based on time expanded graph.Then,the problem is transferred and reformulated into a consensus optimization framework which can be solved by satellite systems parallelly.With alternating direction method of multipliers(ADMM),a semi-distributed coordinated transmission task planning algorithm is proposed,in which each satellite system plans its own tasks based on local information and limited communication with the coordination center.Simulation results demonstrate that compared with the centralized and fully-distributed methods,the proposed semi-distributed coordinated method can strike a better balance among task complete rate,complexity,and the amount of information required to be exchanged.

Coordinated planning for flexible interconnection and energy storage system in low-voltage distribution networks to improve the accommodation capacity of photovoltaic

The increasing proportion of distributed photovoltaics(DPVs)and electric vehicle charging stations in low-voltage distribution networks(LVDNs)has resulted in challenges such as distribution transformer overloads and voltage violations.To address these problems,we propose a coordinated planning method for flexible interconnections and energy storage systems(ESSs)to improve the accommodation capacity of DPVs.First,the power-transfer characteristics of flexible interconnection and ESSs are analyzed.The equipment costs of the voltage source converters(VSCs)and ESSs are also analyzed comprehensively,considering the differences in installation and maintenance costs for different installation locations.Second,a bilevel programming model is established to minimize the annual comprehensive cost and yearly total PV curtailment capacity.Within this framework,the upper-level model optimizes the installation locations and capacities of the VSCs and ESSs,whereas the lower-level model optimizes the operating power of the VSCs and ESSs.The proposed model is solved using a non-dominated sorting genetic algorithm with an elite strategy(NSGA-II).The effectiveness of the proposed planning method is validated through an actual LVDN scenario,which demonstrates its advantages in enhancing PV accommodation capacity.In addition,the economic benefits of various planning schemes with different flexible interconnection topologies and different PV grid-connected forms are quantitatively analyzed,demonstrating the adaptability of the proposed coordinated planning method.

Pluggable multitask diffractive neural networks based on cascaded metasurfaces

Optical neural networks have significant advantages in terms of power consumption,parallelism,and high computing speed,which has intrigued extensive attention in both academic and engineering communities.It has been considered as one of the powerful tools in promoting the fields of imaging processing and object recognition.However,the existing optical system architecture cannot be reconstructed to the realization of multi-functional artificial intelligence systems simultaneously.To push the development of this issue,we propose the pluggable diffractive neural networks(P-DNN),a general paradigm resorting to the cascaded metasurfaces,which can be applied to recognize various tasks by switching internal plug-ins.As the proof-of-principle,the recognition functions of six types of handwritten digits and six types of fashions are numerical simulated and experimental demonstrated at near-infrared regimes.Encouragingly,the proposed paradigm not only improves the flexibility of the optical neural networks but paves the new route for achieving high-speed,low-power and versatile artificial intelligence systems.

基于BP-ANN与RBF-ANN的钢筋与混凝土黏结强度预测模型研究

为研究神经网络对钢筋与混凝土黏结强度的预测能力以及神经网络的输出性能,基于大量的试验数据,提出一种基于改进神经网络的变形钢筋与混凝土黏结强度预测模型,对混凝土结构的研究与实际工程应用均有着重要的意义。收集290组黏结锚固试验数据,引入基于反向传播人工神经网络(BP-ANN)与径向基函数神经网络(RBF-ANN)算法,揭示混凝土强度、保护层厚度、钢筋直径、锚固长度及配箍率对变形钢筋与混凝土黏结性能的影响规律,建立基于改进神经网络算法的钢筋与混凝土黏结强度预测模型。对比分析不同数据预处理方法和训练神经元个数对建议模型预测结果的影响,评估各经典模型与建议模型的预测精度和离散性,提出临界锚固长度计算公式。结果表明:BP-ANN预测值与试验值比值的均值、标准差及变异系数分别为1.009、0.188、0.86,其预测精度略高于RBF-ANN;建议模型能够更准确、更稳定地预测钢筋与混凝土的黏结强度,该方法为解决钢筋与混凝土黏结问题提供了新思路。

基于GA改进ANN算法的车载网控系统故障诊断

车载网控系统是保证运行安全的一类重要控制设备,也是确保系统稳定运行的核心部件。为了提高车载网控系统故障诊断效率,通过遗传算法(GA)具有的全局寻优功能来实现对神经网络初始阈值与权值的优化,把寻优结果代到神经网络内完成训练过程;使ANN泛化方法具有的映射性能获得充分利用可以防止产生局部极小值情况,获得更高的分类精度;利用实例分析方式测试车载故障诊断过程的有效性。研究结果表明:采用GA改进ANN算法可以有效优化平均误差及数据正确率,有效降低迭代次数,表明可以通过GA改进ANN方法来提升神经网络运算性能。经过遗传算法优化处理的ANN在训练过程中可以获得比初始ANN更快时收敛速率。

Blockchain Driven Metaheuristic Route Planning in Secure Wireless Sensor Networks

Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vital element of IoT paradigm since its inception and has developed into one of the chosen platforms for deploying many smart city application regions such as disaster management,intelligent transportation,home automation,smart buildings,and other such IoT-based application.The routing approaches were extremely-utilized energy efficient approaches with an initial drive that is,for balancing the energy amongst sensor nodes.The clustering and routing procedures assumed that Non-Polynomial(NP)hard problems but bio-simulated approaches are utilized to a recognized time for resolving such problems.With this motivation,this paper presents a new blockchain with Enhanced Hunger Games Search based Route Planning(BCEHGS-RP)scheme for IoT assisted WSN.The presented BCEHGS-RP model majorly employs BC technology for secure communication in the IoT supportedWSN environment.In addition,an effective multihop route planning approach was designed by the use of EHGS technique.The proposed EHGS technique is derived from the concept of Hill Climbing strategy(HCS)and HGS algorithm.Moreover,a fitness function with two parameters namely residual energy(RE)and intercluster distance to elect optimal routes.The performance validation of the BCEHGS-RP model is experimented with under diverse number of nodes.Extensive experimental outcomes highlighted the better performance of the BCEHGS-RP technique on recent approaches.

Distributed robust power control in two-tier vehicle networks under uncertain channel environments

This paper proposes a novel optimization scheme to support stable and reliable vehicle-to-everything connections in two-tier networks,where the uplink channel of the cellular user is reused by underlay vehicle-to-vehicle communications.However,considering complex channel fading and high-speed vehicle movement,the cer-tainty assumption is impractical and fails to maintain power control strategy in reality in the traditional statical vehicular networks.Rather than the perfect channel state information assumption,the first-order Gauss-Markov process which is a probabilistic model affected by vehicle speed and fading is introduced to describe imperfect channel gains.Moreover,interference management is a major challenge in reusing communications,especially in uncertain channel environments.Power control is an effective way to realize interference management,and optimal power allocation can ensure that interference of the user meets the communication requirements.In this study,the sum-rate-oriented power control scheme and minimum-rate-oriented power control scheme were implemented to manage interference and satisfy different design objectives.Since both of these schemes are non-convex and intractable,the Bernstein approximation and successive convex approximation methods were adopted to transform the original problems into convex ones.Furthermore,a novel distributed robust power control al-gorithm was developed to determine the optimal solutions.The performance of the algorithm was evaluated through numerical simulations,and the results indicate that the proposed algorithm is effective in vehicular communication networks with uncertain channel environments.

Using Hybrid Penalty and Gated Linear Units to Improve Wasserstein Generative Adversarial Networks for Single-Channel Speech Enhancement

Recently,speech enhancement methods based on Generative Adversarial Networks have achieved good performance in time-domain noisy signals.However,the training of Generative Adversarial Networks has such problems as convergence difficulty,model collapse,etc.In this work,an end-to-end speech enhancement model based on Wasserstein Generative Adversarial Networks is proposed,and some improvements have been made in order to get faster convergence speed and better generated speech quality.Specifically,in the generator coding part,each convolution layer adopts different convolution kernel sizes to conduct convolution operations for obtaining speech coding information from multiple scales;a gated linear unit is introduced to alleviate the vanishing gradient problem with the increase of network depth;the gradient penalty of the discriminator is replaced with spectral normalization to accelerate the convergence rate of themodel;a hybrid penalty termcomposed of L1 regularization and a scale-invariant signal-to-distortion ratio is introduced into the loss function of the generator to improve the quality of generated speech.The experimental results on both TIMIT corpus and Tibetan corpus show that the proposed model improves the speech quality significantly and accelerates the convergence speed of the model.

Dynamic channel estimation-aware routing protocol in mobile cognitive radio networks for smart IIoT applications

Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)applications.In order to provide an efficient connection among IIoT devices,CRNs enhance spectrum utilization by using licensed spectrum.However,the routing protocol in these networks is considered one of the main problems due to node mobility and time-variant channel selection.Specifically,the channel selection for routing protocol is indispensable in CRNs to provide an adequate adaptation to the Primary User(PU)activity and create a robust routing path.This study aims to construct a robust routing path by minimizing PU interference and routing delay to maximize throughput within the IIoT domain.Thus,a generic routing framework from a cross-layer perspective is investigated that intends to share the information resources by exploiting a recently proposed method,namely,Channel Availability Probability.Moreover,a novel cross-layer-oriented routing protocol is proposed by using a time-variant channel estimation technique.This protocol combines lower layer(Physical layer and Data Link layer)sensing that is derived from the channel estimation model.Also,it periodically updates and stores the routing table for optimal route decision-making.Moreover,in order to achieve higher throughput and lower delay,a new routing metric is presented.To evaluate the performance of the proposed protocol,network simulations have been conducted and also compared to the widely used routing protocols,as a benchmark.The simulation results of different routing scenarios demonstrate that our proposed solution outperforms the existing protocols in terms of the standard network performance metrics involving packet delivery ratio(with an improved margin of around 5–20%approximately)under varying numbers of PUs and cognitive users in Mobile Cognitive Radio Networks(MCRNs).Moreover,the cross-layer routing protocol successfully achieves high routing performance in finding a robust route,selecting the high channel stability,and reducing the probability of PU interference for continued communication.

Anti-jamming channel access in 5G ultra-dense networks: a game-theoretic learning approach

This paper investigates the Quality of Experience(QoE)oriented channel access anti-jamming problem in 5th Generation Mobile Communication(5G)ultra-dense networks.Firstly,considering that the 5G base station adopts beamforming technology,an anti-jamming model under Space Division Multiple Access(SDMA)conditions is proposed.Secondly,the confrontational relationship between users and the jammer is formulated as a Stackelberg game.Besides,to achieve global optimization,we design a local cooperation mechanism for users and formulate the cooperation and competition among users as a local altruistic game.By proving that the local altruistic game is an Exact Potential Game(EPG),we further prove the existence of pure strategy Nash Equilibrium(NE)among users and Stackelberg Equilibrium(SE)between users and jammer.Thirdly,to obtain the equilibrium solutions of the proposed games,we propose an anti-jamming channel selection algorithm and improve its convergence speed through heterogeneous learning parameters.The simulation results validate the convergence and effectiveness of the proposed algorithm.Compared with the throughput optimization scheme,our proposed scheme obtain a greater network satisfaction rate.Finally,we also analyze user fairness changes during the algorithm convergence process and get some interesting conclusions.

Information Freshness-Oriented Trajectory Planning and Resource Allocation for UAV-Assisted Vehicular Networks

In this paper,multi-UAV trajectory planning and resource allocation are jointly investigated to improve the information freshness for vehicular networks,where the vehicles collect time-critical traffic information by on-board sensors and upload to the UAVs through their allocated spectrum resource.We adopt the expected sum age of information(ESAoI)to measure the network-wide information freshness.ESAoI is jointly affected by both the UAVs trajectory and the resource allocation,which are coupled with each other and make the analysis of ESAoI challenging.To tackle this challenge,we introduce a joint trajectory planning and resource allocation procedure,where the UAVs firstly fly to their destinations and then hover to allocate resource blocks(RBs)during a time-slot.Based on this procedure,we formulate a trajectory planning and resource allocation problem for ESAoI minimization.To solve the mixed integer nonlinear programming(MINLP)problem with hybrid decision variables,we propose a TD3 trajectory planning and Round-robin resource allocation(TTPRRA).Specifically,we exploit the exploration and learning ability of the twin delayed deep deterministic policy gradient algorithm(TD3)for UAVs trajectory planning,and utilize Round Robin rule for the optimal resource allocation.With TTP-RRA,the UAVs obtain their flight velocities by sensing the locations and the age of information(AoI)of the vehicles,then allocate the RBs to the vehicles in a descending order of AoI until the remaining RBs are not sufficient to support another successful uploading.Simulation results demonstrate that TTP-RRA outperforms the baseline approaches in terms of ESAoI and average AoI(AAoI).

Influencer identification of dynamical networks based on an information entropy dimension reduction method

Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control.Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure.However, these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.

An Integrated Image Task Planning in Satellite Networks:From Instruction Release and Observation Perspective

The unreasonable observation arrangements in the satellite operation control center(SOCC)may result in the observation data cannot be downloaded as scheduled.Meanwhile,if the operation instructions released by the satellite telemetry tracking center(STTC)for the on-board payloads are not injected on the specific satellites in time,the corresponding satellites cannot perform the observation operations as planned.Therefore,there is an urgent need to design an integrated instruction release,and observation task planning(I-IRO-TP)scheme by efficiently collaborating the SOCC and STTC.Motivated by this fact,we design an interaction mechanism between the SOCC and the STTC,where we first formulate the I-IRO-TP problem as a constraint satisfaction problem aiming at maximizing the number of completed tasks.Furthermore,we propose an interactive imaging task planning algorithm based on the analysis of resource distribution in the STTC during the previous planning periods to preferentially select the observation arcs that not only satisfy the requirements in the observation resource allocation phase but also facilitate the arrangement of measurement and control instruction release.We conduct extensive simulations to demonstrate the effectiveness of the proposed algorithm in terms of the number of completed tasks.

Improving Performance of Recurrent Neural Networks Using Simulated Annealing for Vertical Wind Speed Estimation

An accurate vertical wind speed(WS)data estimation is required to determine the potential for wind farm installation.In general,the vertical extrapolation of WS at different heights must consider different parameters fromdifferent locations,such as wind shear coefficient,roughness length,and atmospheric conditions.The novelty presented in this article is the introduction of two steps optimization for the Recurrent Neural Networks(RNN)model to estimate WS at different heights using measurements from lower heights.The first optimization of the RNN is performed to minimize a differentiable cost function,namely,mean squared error(MSE),using the Broyden-Fletcher-Goldfarb-Shanno algorithm.Secondly,the RNN is optimized to reduce a non-differentiable cost function using simulated annealing(RNN-SA),namely mean absolute error(MAE).Estimation ofWS vertically at 50 m height is done by training RNN-SA with the actualWS data a 10–40 m heights.The estimatedWS at height of 50 m and the measured WS at 10–40 heights are further used to train RNN-SA to obtain WS at 60 m height.This procedure is repeated continuously until theWS is estimated at a height of 180 m.The RNN-SA performance is compared with the standard RNN,Multilayer Perceptron(MLP),Support Vector Machine(SVM),and state of the art methods like convolutional neural networks(CNN)and long short-term memory(LSTM)networks to extrapolate theWS vertically.The estimated values are also compared with realWS dataset acquired using LiDAR and tested using four error metrics namely,mean squared error(MSE),mean absolute percentage error(MAPE),mean bias error(MBE),and coefficient of determination(R2).The numerical experimental results show that the MSE values between the estimated and actualWS at 180mheight for the RNN-SA,RNN,MLP,and SVM methods are found to be 2.09,2.12,2.37,and 2.63,respectively.

Source localization in signed networks with effective distance

While progress has been made in information source localization,it has overlooked the prevalent friend and adversarial relationships in social networks.This paper addresses this gap by focusing on source localization in signed network models.Leveraging the topological characteristics of signed networks and transforming the propagation probability into effective distance,we propose an optimization method for observer selection.Additionally,by using the reverse propagation algorithm we present a method for information source localization in signed networks.Extensive experimental results demonstrate that a higher proportion of positive edges within signed networks contributes to more favorable source localization,and the higher the ratio of propagation rates between positive and negative edges,the more accurate the source localization becomes.Interestingly,this aligns with our observation that,in reality,the number of friends tends to be greater than the number of adversaries,and the likelihood of information propagation among friends is often higher than among adversaries.In addition,the source located at the periphery of the network is not easy to identify.Furthermore,our proposed observer selection method based on effective distance achieves higher operational efficiency and exhibits higher accuracy in information source localization,compared with three strategies for observer selection based on the classical full-order neighbor coverage.

Impact of different interaction behavior on epidemic spreading in time-dependent social networks

We investigate the impact of pairwise and group interactions on the spread of epidemics through an activity-driven model based on time-dependent networks.The effects of pairwise/group interaction proportion and pairwise/group interaction intensity are explored by extensive simulation and theoretical analysis.It is demonstrated that altering the group interaction proportion can either hinder or enhance the spread of epidemics,depending on the relative social intensity of group and pairwise interactions.As the group interaction proportion decreases,the impact of reducing group social intensity diminishes.The ratio of group and pairwise social intensity can affect the effect of group interaction proportion on the scale of infection.A weak heterogeneous activity distribution can raise the epidemic threshold,and reduce the scale of infection.These results benefit the design of epidemic control strategy.

Migration Networks Pattern of China’s Floating Population from the Perspective of Complex Network

Since China’s reform and opening-up,the growing disparity between urban and rural areas and regions has led to massive migration.With China’s Rural Revitalization Strategy and the industrial transfer from the eastern coastal areas to the inland,the migration direction and pattern of the floating population have undergone certain changes.Using the 2017 China Migrants Dynamic Survey(CMDS),excluding Hong Kong,Macao,and Taiwan regions of China,organized by China’s National Health Commission,the relationship matrix of the floating population is constructed according to the inflow place of the interviewees and their outflow place(the location of the registered residence)in the questionnaire survey.We then apply the complex network model to analyze the migration direction and network pattern of China’s floating population from the city scale.The migration network shows an obvious hierarchical agglomeration.The first-,second-,third-and fourth-tier distribution cities are municipalities directly under the central government,provincial capital cities,major cities in the central and western regions and ordinary cities in all provinces,respectively.The migration trend is from the central and western regions to the eastern coastal areas.The migration network has‘small world’characteristics,forming nine communities.It shows that most node cities in the same community are closely linked and geographically close,indicating that the migration network of floating population is still affected by geographical proximity.Narrowing the urban-rural and regional differences will promote the rational distribution this population.It is necessary to strengthen the reform of the registered residence system,so that the floating population can enjoy urban public services comparable to other populations,and allow migrants to live and work in peace.