A Neural-network-based Alternative Scheme to Include Nonhydrostatic Processes in an Atmospheric Dynamical Core

Here,a nonhydrostatic alternative scheme(NAS)is proposed for the grey zone where the nonhydrostatic impact on the atmosphere is evident but not large enough to justify the necessity to include an implicit nonhydrostatic solver in an atmospheric dynamical core.The NAS is designed to replace this solver,which can be incorporated into any hydrostatic models so that existing well-developed hydrostatic models can effectively serve for a longer time.Recent advances in machine learning(ML)provide a potential tool for capturing the main complicated nonlinear-nonhydrostatic relationship.In this study,an ML approach called a neural network(NN)was adopted to select leading input features and develop the NAS.The NNs were trained and evaluated with 12-day simulation results of dry baroclinic-wave tests by the Weather Research and Forecasting(WRF)model.The forward time difference of the nonhydrostatic tendency was used as the target variable,and the five selected features were the nonhydrostatic tendency at the last time step,and four hydrostatic variables at the current step including geopotential height,pressure in two different forms,and potential temperature,respectively.Finally,a practical NAS was developed with these features and trained layer by layer at a 20-km horizontal resolution,which can accurately reproduce the temporal variation and vertical distribution of the nonhydrostatic tendency.Corrected by the NN-based NAS,the improved hydrostatic solver at different horizontal resolutions can run stably for at least one month and effectively reduce most of the nonhydrostatic errors in terms of system bias,anomaly root-mean-square error,and the error of the wave spatial pattern,which proves the feasibility and superiority of this scheme.

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.

Reliable Data Collection Model and Transmission Framework in Large-Scale Wireless Medical Sensor Networks

Large-scale wireless sensor networks(WSNs)play a critical role in monitoring dangerous scenarios and responding to medical emergencies.However,the inherent instability and error-prone nature of wireless links present significant challenges,necessitating efficient data collection and reliable transmission services.This paper addresses the limitations of existing data transmission and recovery protocols by proposing a systematic end-to-end design tailored for medical event-driven cluster-based large-scale WSNs.The primary goal is to enhance the reliability of data collection and transmission services,ensuring a comprehensive and practical approach.Our approach focuses on refining the hop-count-based routing scheme to achieve fairness in forwarding reliability.Additionally,it emphasizes reliable data collection within clusters and establishes robust data transmission over multiple hops.These systematic improvements are designed to optimize the overall performance of the WSN in real-world scenarios.Simulation results of the proposed protocol validate its exceptional performance compared to other prominent data transmission schemes.The evaluation spans varying sensor densities,wireless channel conditions,and packet transmission rates,showcasing the protocol’s superiority in ensuring reliable and efficient data transfer.Our systematic end-to-end design successfully addresses the challenges posed by the instability of wireless links in large-scaleWSNs.By prioritizing fairness,reliability,and efficiency,the proposed protocol demonstrates its efficacy in enhancing data collection and transmission services,thereby offering a valuable contribution to the field of medical event-drivenWSNs.

Information Centric Networking Based Cooperative Caching Framework for 5G Communication Systems

The demands on conventional communication networks are increasing rapidly because of the exponential expansion of connected multimedia content.In light of the data-centric aspect of contemporary communication,the information-centric network(ICN)paradigm offers hope for a solution by emphasizing content retrieval by name instead of location.If 5G networks are to meet the expected data demand surge from expanded connectivity and Internet of Things(IoT)devices,then effective caching solutions will be required tomaximize network throughput andminimize the use of resources.Hence,an ICN-based Cooperative Caching(ICN-CoC)technique has been used to select a cache by considering cache position,content attractiveness,and rate prediction.The findings show that utilizing our suggested approach improves caching regarding the Cache Hit Ratio(CHR)of 84.3%,Average Hop Minimization Ratio(AHMR)of 89.5%,and Mean Access Latency(MAL)of 0.4 s.Within a framework,it suggests improved caching strategies to handle the difficulty of effectively controlling data consumption in 5G networks.These improvements aim to make the network run more smoothly by enhancing content delivery,decreasing latency,and relieving congestion.By improving 5G communication systems’capacity tomanage the demands faced by modern data-centric applications,the research ultimately aids in advancement.

Event-triggered H_(∞) PI state estimation for delayed switched neural networks

On state estimation problems of switched neural networks,most existing results with an event-triggered scheme(ETS)not only ignore the estimator information,but also just employ a fixed triggering threshold,and the estimation error cannot be guaranteed to converge to zero.In addition,the state estimator of non-switched neural networks with integral and exponentially convergent terms cannot be used to improve the estimation performance of switched neural networks due to the difficulties caused by the nonsmoothness of the considered Lyapunov function at the switching instants.In this paper,we aim at overcoming such difficulties and filling in the gaps,by proposing a novel adaptive ETS(AETS)to design an event-based H_(∞)switched proportional-integral(PI)state estimator.A triggering-dependent exponential convergence term and an integral term are introduced into the switched PI state estimator.The relationship among the average dwell time,the AETS and the PI state estimator are established by the triggering-dependent exponential convergence term such that estimation error asymptotically converges to zero with H_(∞)performance level.It is shown that the convergence rate of the resultant error system can be adaptively adjusted according to triggering signals.Finally,the validity of the proposed theoretical results is verified through two illustrative examples.

Defending Against Link Failure in Virtual Network Embedding Using a Hybrid Scheme

Nowadays network virtualization is utterly popular.As a result,how to protect the virtual networks from attacking on the link is increasingly important.Existing schemes are mainly backup-based,which suffer from data loss and are helpless to such attacks like data tampering.To offer high security level,in this paper,we first propose a multipath and decision-making(MD) scheme which applies multipath simultaneously delivery and decision-making for protecting the virtual network.Considering different security requirement for virtual link,we devise a hybrid scheme to protect the virtual links.For the critical links,MD scheme is adopted.For the other links,we adopt the Shared Backup Scheme.Our simulation results indicate the proposed scheme can significantly increase the security level of the critical link high in the loss of less acceptance ratio.

SEMANTIC NETWORK PRESENTATION OF MECHANICAL MOTION SCHEME AND ITS MECHANISM TYPES SELECTION METHOD

The presentation method of the mechanical motion scheme must support thewhole process of conceptual design. To meet the requirement, a semantic network method is selectedto represent process level, action level, mechanism level and relationships among them. Computeraided motion cycle chart exploration can be realized by the representation and revision of timecoordination of mechanism actions and their effect on the design scheme. The uncertain reasoningtechnology based on semantic network is applied in the mechanism types selection of the needledriving mechanism of industrial sewing mechanism, and the application indicated it is correct,useful and advance.

A sink moving scheme based on local residual energy of nodes in wireless sensor networks

In the application of periodic data-gathering in sensor networks,sensor nodes located near the sink have to forward the data received from all other nodes to the sink,which depletes their energy very quickly.A moving scheme for the sink based on local residual energy was proposed.In the scheme,the sink periodically moves to a new location with the highest stay-value defined by the average residual energy and the number of neighbors.The scheme can balance energy consumption and prevent nodes around sink from draining their energy very quickly in the networks.The simulation results show that the scheme can prolong the network lifetime by 26%-65%compared with the earlier schemes where the sink is static or moves randomly.

Edge Computing-Based Joint Client Selection and Networking Scheme for Federated Learning in Vehicular IoT

In order to support advanced vehicular Internet-of-Things(IoT)applications,information exchanges among different vehicles are required to find efficient solutions for catering to different application requirements in complex and dynamic vehicular environments.Federated learning(FL),which is a type of distributed learning technology,has been attracting great interest in recent years as it performs knowledge exchange among different network entities without a violation of user privacy.However,client selection and networking scheme for enabling FL in dynamic vehicular environments,which determines the communication delay between FL clients and the central server that aggregates the models received from the clients,is still under-explored.In this paper,we propose an edge computing-based joint client selection and networking scheme for vehicular IoT.The proposed scheme assigns some vehicles as edge vehicles by employing a distributed approach,and uses the edge vehicles as FL clients to conduct the training of local models,which learns optimal behaviors based on the interaction with environments.The clients also work as forwarder nodes in information sharing among network entities.The client selection takes into account the vehicle velocity,vehicle distribution,and the wireless link connectivity between vehicles using a fuzzy logic algorithm,resulting in an efficient learning and networking architecture.We use computer simulations to evaluate the proposed scheme in terms of the communication overhead and the information covered in learning.

A Novel Resource Allocation Algorithm based on Downlink and Uplink Decouple Access Scheme in Heterogeneous Networks

Traditional cellular network requires that a user equipment(UE) should associate to the same base station(BS) in both the downlink(DL) and the uplink(UL). Based on dual connectivity(DC) introduced in LTE-Advanced R12, DL/UL decouple access scheme has been proposed, which is especially suitable for heterogeneous networks(Het Nets). This paper is the pioneer to take the DL/UL decouple access scheme into consideration and develop a novel resource allocation algorithm in a two-tier Het Net to improve the total system throughput in the UL and ease the load imbalance between macro base stations(MBSs) and pico base stations(PBSs). A model is formulated as a nonlinear integer programming, and the proposed algorithm is a sub-optimal algorithm based on the graph theory. First, an undirected and weighted interference graph is obtained. Next, the users are grouped to let users with large mutual interferences to be assigned to different clusters. Then, the users in different clusters are allocated to different resource blocks(RBs) by using the Hungarian algorithm. Simulation results show that the proposed algorithm can provide great promotions for both the total system throughput and the average cell edge user throughput and successfully ease the load imbalance between MBSs and PBSs.

CONTROL SCHEMES FOR CMAC NEURAL NETWORK-BASED VISUAL SERVOING

In IBVS (image based visual servoing), the error signal in image space should be transformed into the control signal in the input space quickly. To avoid the iterative adjustment and complicated inverse solution of image Jacobian, CMAC (cerebellar model articulation controller) neural network is inserted into visual servo control loop to implement the nonlinear mapping. Two control schemes are used. Simulation results on two schemes are provided, which show a better tracking precision and stability can be achieved using scheme 2.

A Transductive Scheme Based Inference Techniques for Network Forensic Analysis

Network forensics is a security infrastructure,and becomes the research focus of forensic investigation.However many challenges still exist in conducting network forensics:network has produced large amounts of data;the comprehensibility of evidence extracting from collected data;the efficiency of evidence analysis methods,etc.To solve these problems,in this paper we develop a network intrusion forensics system based on transductive scheme that can detect and analyze efficiently computer crime in networked environments,and extract digital evidence automatically.At the end of the paper,we evaluate our method on a series of experiments on KDD Cup 1999 dataset.The results demonstrate that our methods are actually effective for real-time network forensics,and can provide comprehensible aid for a forensic expert.

Neural Network Based Multi-level Fuzzy Evaluation Model for Mechanical Kinematic Scheme

To implement a quantificational evaluation for mechanical kinematic scheme more effectively,a multi-level and multi-objective evaluation model is presented using neural network and fuzzy theory. Firstly,the structure of evaluation model is constructed according to evaluation indicator system. Then evaluation samples are generated and provided to train this model. Thus it can reflect the relation between attributive value and evaluation result,as well as the weight of evaluation indicator. Once evaluation indicators of each candidate are fuzzily quantified and fed into the trained network model,the corresponding evaluation result is outputted and the best alternative can be selected. Under this model,expert knowledge can be effectively acquired and expressed,and the quantificational evaluation can be implemented for kinematic scheme with multi-level evaluation indicator system. Several key problems on this model are discussed and an illustration has demonstrated that this model is feasible and can be regarded as a new idea for solving kinematic scheme evaluation.

Incentive Schemes of Nodes for Ad Hoc and Multi-hop Cellular Networks

Nodes cooperation is a significant prerequisite for the realization of the relaying Ad Hoc.While with the development of multi-hop cellular networks, how to stimulate intermediate nodes to do the packet-forwarding deserves more concerning.At present research,the incentive schemes in pure Ad Hoc and multi-hop cellular networks are analyzed and compared to classify the strengths and drawbacks of each scheme.We explain in particular what the key issues are to implement incentive schemes for cooperation. Finally,an incentive scheme based on integration of reputation and charging systems is proposed not only to block the existence of selfish nodes,but to satisfy the rational requirement of nodes.

A Dual-Channel Secure Transmission Scheme for Internet-Based Networked Control Systems

Two significant issues in Internet-based networked control systems （ INCSs）, transport performance of different protocols and security breach from Internet side, are investigated. First, for improving the performance of data transmission, user datagram protocol （UDP） is adopted as the main stand for controllers and plants using INCSs. Second, a dual-channel secure transmission scheme （DCSTS）based on data transmission characteristics of INCSs is proposed, in which a raw UDP channel and a secure TCP （transmission control protocol） connection making use of SSL/TLS （secure sockets layer/transport layer security） are included. Further, a networked control protocol （NCP） at application layer for supporting DCSTS between the controllers and plants in INCSs is designed, and it also aims at providing a universal communication mechanism for interoperability of devices among the networked control laboratories in Beijing Institute of Technology of China, Central South University of China and Tokyo University of Technology of Japan. By means of a networked single-degree-of-free- dom robot arm, an INCS under the new protocol and security environment is created. Compared with systems such as IPSec or SSL/TLS, which may cause more than 91% network throughput deduction, the new DCSTS protocol may yield results ten times better, being just 5.67%.

Control schemes for synchronizing two subnetworks with weak couplings

In this paper, we propose a well-designed network model with a parameter and study full and partial synchronization of the network model based on the stability analysis. The network model is composed of a star-coupled subnetwork and a globally coupled subnetwork. By analyzing the special coupling configuration, three control schemes are obtained for synchronizing the network model. Further analysis indicates that even if the inner couplings in each subnetwork are very weak, two of the control schemes are still valid. In particular, if the outer coupling weight parameter 0 is larger than （n2 - 2n）/4, or the subnetwork size n is larger than 02, the two subnetworks with weak inner couplings can achieve synchronization. In addition, the synchronizability is independent of the network size in case of 0 〈 0 〈 n/（n ＋ 1 ）. Finally, we carry out some numerical simulations to confirm the validity of the obtained control schemes. It is worth noting that the main idea of this paper also applies to any network consisting of a dense subnetwork and a sparse network.

A Review and Analysis of Localization Techniques in Underwater Wireless Sensor Networks

In recent years,there has been a rapid growth in Underwater Wireless Sensor Networks(UWSNs).The focus of research in this area is now on solving the problems associated with large-scale UWSN.One of the major issues in such a network is the localization of underwater nodes.Localization is required for tracking objects and detecting the target.It is also considered tagging of data where sensed contents are not found of any use without localization.This is useless for application until the position of sensed content is confirmed.This article’s major goal is to review and analyze underwater node localization to solve the localization issues in UWSN.The present paper describes various existing localization schemes and broadly categorizes these schemes as Centralized and Distributed localization schemes underwater.Also,a detailed subdivision of these localization schemes is given.Further,these localization schemes are compared from different perspectives.The detailed analysis of these schemes in terms of certain performance metrics has been discussed in this paper.At the end,the paper addresses several future directions for potential research in improving localization problems of UWSN.

Robust H_(∞)state estimation for a class of complex networks with dynamic event-triggered scheme against hybrid attacks

We investigate the dynamic event-triggered state estimation for uncertain complex networks with hybrid delays suffering from both deception attacks and denial-of-service attacks.Firstly,the effects of time-varying delays and finitedistributed delays are considered during data transmission between nodes.Secondly,a dynamic event-triggered scheme(ETS)is introduced to reduce the frequency of data transmission between sensors and estimators.Thirdly,by considering the discussed plant,dynamic ETS,state estimator,and hybrid attacks into a unified framework,this framework is transferred into a novel dynamical model.Furthermore,with the help of Lyapunov stability theory and linear matrix inequality techniques,sufficient condition to ensure that the system is exponentially stable and satisfies H∞performance constraints is obtained,and the design algorithm for estimator gains is given.Finally,two numerical examples verify the effectiveness of the proposed method.

Discontinuous event-trigger scheme for global stabilization of state-dependent switching neural networks with communication delay

This paper is concerned with the global stabilization of state-dependent switching neural networks(SDSNNs)viadiscontinuous event-triggered control with network-induced communication delay.Aiming at decreasing triggering times,a discontinuous event-trigger scheme is utilized to determine whether the sampling information is required to be sent outor not.Meanwhile,under the effect of communication delay,the trigger condition and SDSNNs are transformed into twotractable models by designing a fictitious delay function.Then,using the Lyapunov–Krasovskii stability theory,someinequality estimation techniques,and extended reciprocally convex combination method,two sufficient criteria are established for ensuring the global stabilization of the resulting closed-loop SDSNNs,respectively.A unified framework isderived that has the ability to handle the simultaneous existence of the communication delay,the properties of discontinuousevent-trigger scheme,as well as feedback controller design.Additionally,the developed results demonstrate a quantitativerelationship among the event trigger parameter,communication delay,and triggering times.Finally,two numerical examples are presented to illustrate the usefulness of the developed stabilization scheme.

HHR:Hierarchical Hybrid Routing Scheme for Information-Centric Network

Publish/subscribe(pub/sub) paradigm is the main communication model for Information-Centric Network(ICN) proposals.A key issue for pub/sub system is how to route the content objects to the correct subscribers,and ICN is no exception.ICN network would be divided into core domain and many edge domains as today's internet does.HHR(Hierarchy Hybrid Routing scheme) is presented for ICN:A Chord-like routing scheme is used in core domain,while edge domains routing structure can be classified into three categories,Local Routing(LR),Delivery of Local Publication to Core domain(DLPC),and Remote Publication Routing into edge domain(RPR).LR can be decided by each edge domain,which determined by many factors,such as locality characteristic for pub/sub information and local policies.A hierarchical routing algorithm is proposed to solve DLPC and RPR simultaneously.Simulation results demonstrate that HHR can be fast deployed,and can be applied in large scale network or dynamic subscription environment.