Stability analysis of synchronization in discrete-time complex dynamical networks

In this paper, by using both the linear stability analysis and Lyapunov function approach, some conditions for stabilizing synchronization behavior in a discrete-time complex dynamical network were derived. These conditions were determined by the coupling strength and the eigenvalues of coupling configuration matrix. Furthermore, some explicit results were obtained when the coupling map between the nodes is equal to the dynamics function of the network, which implies that the product of the coupling strength and the eigenvalues is bounded.

A Discrete-Time Traffic and Topology Adaptive Routing Algorithm for LEO Satellite Networks

“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.

More relaxed condition for dynamics of discrete time delayed Hopfield neural networks

The dynamics of discrete time delayed Hopfield neural networks is investigated. By using a difference inequality combining with the linear matrix inequality, a sufficient condition ensuring global exponential stability of the unique equilibrium point of the networks is found. The result obtained holds not only for constant delay but also for time-varying delays.

Robust Sliding Mode Control for Nonlinear Discrete-Time Delayed Systems Based on Neural Network

This paper presents a robust sliding mode controller for a class of unknown nonlinear discrete-time systems in the presence of fixed time delay. A neural-network approximation and the Lyapunov-Krasovskii functional theory into the sliding-mode technique is used and a neural-network based sliding mode control scheme is proposed. Because of the novality of Chebyshev Neural Networks (CNNs), that it requires much less computation time as compare to multi layer neural network (MLNN), is preferred to approximate the unknown system functions. By means of linear matrix inequalities, a sufficient condition is derived to ensure the asymptotic stability such that the sliding mode dynamics is restricted to the defined sliding surface. The proposed sliding mode control technique guarantees the system state trajectory to the designed sliding surface. Finally, simulation results illustrate the main characteristics and performance of the proposed approach.

IMPULSIVE EXPONENTIAL SYNCHRONIZATION OF FRACTIONAL-ORDER COMPLEX DYNAMICAL NETWORKS WITH DERIVATIVE COUPLINGS VIA FEEDBACK CONTROL BASED ON DISCRETE TIME STATE OBSERVATIONS

This article aims to address the global exponential synchronization problem for fractional-order complex dynamical networks(FCDNs)with derivative couplings and impulse effects via designing an appropriate feedback control based on discrete time state observations.In contrast to the existing works on integer-order derivative couplings,fractional derivative couplings are introduced into FCDNs.First,a useful lemma with respect to the relationship between the discrete time observations term and a continuous term is developed.Second,by utilizing an inequality technique and auxiliary functions,the rigorous global exponential synchronization analysis is given and synchronization criterions are achieved in terms of linear matrix inequalities(LMIs).Finally,two examples are provided to illustrate the correctness of the obtained results.

Community detection in signed networks based on discrete-time model

Community detection in signed networks has been studied widely in recent years. In this paper, a discrete difference equation is proposed to imitate the consistently changing phases of the nodes. During the interaction, each node will update its phase based on the difference equation. Each node has many different nodes connected with it, and these neighbors have different influences on it. The similarity between two nodes is applied to describe the influences between them. Nodes with high positive similarities will get together and nodes with negative similarities will be far away from each other.Communities are detected ultimately when the phases of the nodes are stable. Experiments on real world and synthetic signed networks show the efficiency of detection performance. Moreover, the presented method gains better detection performance than two existing good algorithms.

Binary ABR flow control over ATM networks with uncertainty using discrete-time variable structure controller

A binary available bit rate （ABR） scheme based on discrete-time variable structure control （DVSC） theory is proposed to solve the problem of asynchronous transfer mode （ATM） networks congestion in this paper. A discrete-time system model with uncertainty is introduced to depict the time-varying ATM networks. Based on the system model, an asymptotically stable sliding surface is designed by linear matrix inequality （LMI）. In addition, a novel discrete-time reaching law that can obviously reduce chatter is also put forward. The proposed discrete-time variable structure controller can effectively constrain the oscillation of allowed cell rate （ACR） and the queue length in a router. Moreover, the controller is self-adaptive against the uncertainty in the system. Simulations are done in different scenarios. The results demonstrate that the controller has better stability and robustness than the traditional binary flow controller, so it is good for adequately exerting the simplicity of binary flow control mechanisms.

Improved results on passivity analysis of discrete-time stochastic neural networks with time-varying delay

The problem of passivity analysis for a class of discrete-time stochastic neural networks (DSNNs) with time-varying interval delay was investigated. The delay-dependent sufficient criteria were derived in terms of linear matrix inequalities (LMIs). The results are shown to be generalization of some previous results and are less conservative than the existing works. Meanwhile, the computational complexity of the obtained stability conditions is reduced because less variables are involved. A numerical example is given to show the effectiveness and the benefits of the proposed method.

Synchronization of stochastically hybrid coupled neural networks with coupling discrete and distributed time-varying delays

A general model of linearly stochastically coupled identical connected neural networks with hybrid coupling is proposed, which is composed of constant coupling, coupling discrete time-varying delay and coupling distributed timevarying delay. All the coupling terms are subjected to stochastic disturbances described in terms of Brownian motion, which reflects a more realistic dynamical behaviour of coupled systems in practice. Based on a simple adaptive feedback controller and stochastic stability theory, several sufficient criteria are presented to ensure the synchronization of linearly stochastically coupled complex networks with coupling mixed time-varying delays. Finally, numerical simulations illustrated by scale-free complex networks verify the effectiveness of the proposed controllers.

Attractors and the attraction basins of discrete-time cellular neural networks

The dynamic behavior of discrete-time cellular neural networks(DTCNN), which is strict with zero threshold value, is mainly studied in asynchronous mode and in synchronous mode. In general, a k-attractor of DTCNN is not a convergent point. But in this paper, it is proved that a k-attractor is a convergent point if the strict DTCNN satisfies some conditions. The attraction basin of the strict DTCNN is studied, one example is given to illustrate the previous conclusions to be wrong, and several results are presented. The obtained results on k-attractor and attraction basin not only correct the previous results, but also provide a theoretical foundation of performance analysis and new applications of the DTCNN.

Stability analysis of extended discrete-time BAMneural networks based on LMI approach

We propose a new approach for analyzing the global asymptotic stability of the extended discrete-time bidirectional associative memory （BAM） neural networks. By using the Euler rule, we discretize the continuous-time BAM neural networks as the extended discrete-time BAM neural networks with non-threshold activation functions. Here we present some conditions under which the neural networks have unique equilibrium points. To judge the global asymptotic stability of the equilibrium points, we introduce a new neural network model - standard neural network model （SNNM）. For the SNNMs, we derive the sufficient conditions for the global asymptotic stability of the equilibrium points, which are formulated as some linear matrix inequalities （LMIs）. We transform the discrete-time BAM into the SNNM and apply the general result about the SNNM to the determination of global asymptotic stability of the discrete-time BAM. The approach proposed extends the known stability results, has lower conservativeness, can be verified easily, and can also be applied to other forms of recurrent neural networks.

User-Based Discrete-Time Queuing Analysis for Opportunistic Spectrum Access in Cognitive Radio Networks

In cognitive radio networks, the spectrum utilization can be improved by cognitive users opportunistically using the idle channels licensed to the primary users. However, the new arrived cognitive users may not be able to use the channel immediately since the channel usage state is random. This will impose additional time delay for the cognitive users. Excessive waiting delay can make cognitive users miss the spectrum access chances. In this paper, a discrete-time Markov queuing model from a macro point of view is provided. Through the matrix-geometric solution theory, the average sojourn time for cognitive users in the steady state before accessing the spectrum is obtained. Given the tolerant delay of cognitive users, the macro-based throughput is derived and an access control mechanism is proposed. The numerical results show the effects of service completion probability on average sojourn time and throughput. It is confirmed that the throughput can be obviously improved by using the proposed access control mechanism. Finally, the performance evaluations based on users are compared to that based on data packets.

Study on Ecological Change Remote Sensing Monitoring Method Based on Elman Dynamic Recurrent Neural Network

In this paper, Hailin City of Heilongjiang Province, China is taken as the research area. As an important city in Heilongjiang Province, China, the sustainable development of its ecological environment is related to the opening up, economic prosperity and social stability of Northeast China. In this paper, the remote sensing ecological index (RSEI) of Hailin City in recent 20 years was calculated by using Landsat 5/8/9 series satellite images, and the temporal and spatial changes of the ecological environment in Hailin City were further analyzed and the influencing factors were discussed. From 2003 to 2023, the mean value of RSEI in Hailin City decreased and increased, and the ecological environment decreased slightly as a whole. RSEI declined most significantly from 2003 to 2008, and it increased from 2008 to 2013, decreased from 2013 to 2018, and increased from 2018 to 2023 again, with higher RSEI value in the south and lower RSEI value in the northwest. It is suggested to appropriately increase vegetation coverage in the northwest to improve ecological quality. As a result, the predicted value of Elman dynamic recurrent neural network model is consistent with the change trend of the mean value, and the prediction error converges quickly, which can accurately predict the ecological environment quality in the future study area.

DTHMM based delay modeling and prediction for networked control systems

In the forward channel of a networked control system （NCS）, by defining the network states as a hidden Markov chain and quantizing the network-induced delays to a discrete sequence distributing over a finite time interval, the relation between the network states and the network-induced delays is modelled as a discrete-time hidden Markov model （DTHMM）. The expectation maximization （EM） algorithm is introduced to derive the maximumlikelihood estimation （MLE） of the parameters of the DTHMM. Based on the derived DTHMM, the Viterbi algorithm is introduced to predict the controller-to-actuator （C-A） delay during the current sampling period. The simulation experiments demonstrate the effectiveness of the modelling and predicting methods proposed.

PARAMETERS DETERMINATION METHOD OF PHASE-SPACE RECONSTRUCTION BASED ON DIFFERENTIAL ENTROPY RATIO AND RBF NEURAL NETWORK

Phase space reconstruction is the first step of recognizing the chaotic time series.On the basis of differential entropy ratio method,the embedding dimension opt m and time delay t are optimal for the state space reconstruction could be determined.But they are not the optimal parameters accepted for prediction.This study proposes an improved method based on the differential entropy ratio and Radial Basis Function(RBF)neural network to estimate the embedding dimension m and the time delay t,which have both optimal characteristics of the state space reconstruction and the prediction.Simulating experiments of Lorenz system and Doffing system show that the original phase space could be reconstructed from the time series effectively,and both the prediction accuracy and prediction length are improved greatly.

Spaces with σ-point-discrete N_0-weak bases

It is discussed in this paper the spaces with σ-point-discrete N_0-weak bases. The main results are： （1） A space X has a σ-compact-finite N_0-weak base if and only if X is a k-space with a σ-point-discrete N_0-weak base; （2） Under （CH）, every separable space with a σ-point-discrete N_0-weak base has a countable N_0-weak base.

Stability Analysis of Discrete-time Systems with Additive Time-varying Delays

In this paper, the problem of stability analysis of discrete-time delay systems with two additive time-varying delays is considered. A new stability result is derived for a general class of delay systems which has practical application background in networked control systems . The stability criterion is expressed in the form of linear matrix inequalities （LMIs）, which can be readily solved by using standard numerical software. An illustrative example is provided to show the advantage of the proposed stability condition.

DTMC-based Modeling and Analysis of Obstacle Ad hoc Networks

One of the main characteristics of Ad hoc networks is node mobility, which results in constantly changing in network topologies. Consequently, the ability to forecast the future status of mobility nodes plays a key role in QOS routing. We propose a random mobility model based on discretetime Markov chain, called ODM. ODM provides a mathematical framework for calculating some parameters to show the future status of mobility nodes, for instance, the state transition probability matrix of nodes, the probability that an edge is valid, the average number of valid-edges and the probability of a request packet found a valid route. Furthermore, ODM can account for obstacle environment. The state transition probability matrix of nodes can quantify the impact of obstacles. Several theorems are given and proved by using the ODM. Simulation results show that the calculated value can forecast the future status of mobility nodes.

H_∞Control of Uncertain Fuzzy Networked Control Systems with State Quantization

The problem of robust H∞ control for uncertain discrete-time Takagi and Sugeno (T-S) fuzzy networked control systems (NCSs) is investigated in this paper subject to state quantization. By taking into consideration network induced delays and packet dropouts, an improved model of network-based control is developed. A less conservative delay-dependent stability condition for the closed NCSs is derived by employing a fuzzy Lyapunov-Krasovskii functional. Robust H∞ fuzzy controller is constructed that guarantee asymptotic stabilization of the NCSs and expressed in LMI-based conditions. A numerical example illustrates the effectiveness of the developed technique.