Average consensus of multi-agent systems with communication time delays and noisy links

In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies：fixed and switching topologies.By utilizing the stability theory of the stochastic differential equations,we analytically show that the average consensus could be achieved almost surely with the perturbation of noise and the communication time delays even if the time delay is time-varying.The theoretical results show that multi-agent systems can tolerate relatively large time delays if the noise is weak,and they can tolerate relatively strong noise if the time delays are low.The simulation results show that systems with strong noise intensities yield slow convergence.

Online Delay-Evaluation Approach in Networked Control Systems

This paper presents an online evaluation approach of time delays for networked control systems (NCS), which characterizes the time delays without any synchronized clock in the network and any assumptions of time delays. With this approach, an optimal control scheme based on the approach is designed to achieve the desired performance despite the uncertain delays in the system. The experimental results based on CANbus illustrate the effectiveness of the proposed control design and satisfactory performance of the closed-loop system.

Some generalized limit theorems concerning delayed sums of random sequence

For a sequence of arbitrarily dependent m-valued random variables （Xn） n∈N , the generalized strong limit theorem of the delayed average is investigated. In our proof, we improved the method proposed by Liu [6] . As an application, we also studied some limit properties of delayed average for inhomogeneous Markov chains.

A modified averaging scheme with application to the secondary Hopf bifurcation of a delayed van der Pol oscillator

In this paper, a modified averaging scheme is presented for a class of time-delayed vibration systems with slow variables. The new scheme is a combination of the averaging techniques proposed by Hale and by Lehman and Weibel, respectively. The averaged equation obtained from the modified scheme is simple enough but it retains the required information for the local nonlinear dynamics around an equilibrium. As an application of the present method, the delay value for which a secondary Hopf bifurcation occurs is successfully located for a delayed van der Pol oscillator.

Multi-Objective Optimization of Traffic Signal Timing at Typical Junctions Based on Genetic Algorithms

With the rapid development of urban road traffic and the increasing number of vehicles,how to alleviate traffic congestion is one of the hot issues that need to be urgently addressed in building smart cities.Therefore,in this paper,a nonlinear multi-objective optimization model of urban intersection signal timing based on a Genetic Algorithm was constructed.Specifically,a typical urban intersection was selected as the research object,and drivers’acceleration habits were taken into account.What’s more,the shortest average delay time,the least average number of stops,and the maximum capacity of the intersection were regarded as the optimization objectives.The optimization results show that compared with the Webster method when the vehicle speed is 60 km/h and the acceleration is 2.5 m/s^(2),the signal intersection timing scheme based on the proposed Genetic Algorithm multi-objective optimization reduces the intersection signal cycle time by 14.6%,the average vehicle delay time by 12.9%,the capacity by 16.2%,and the average number of vehicles stop by 0.4%.To verify the simulation results,the authors imported the optimized timing scheme into the constructed Simulation of the Urban Mobility model.The experimental results show that the authors optimized timing scheme is superior to Webster’s in terms of vehicle average loss time reduction,carbon monoxide emission,particulate matter emission,and vehicle fuel consumption.The research in this paper provides a basis for Genetic algorithms in traffic signal control.

Research of improving the dynamic scheduling algorithm in the CAN bus control networks

Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority＇s messages will be delayed considerably more, even some data will be lost when the bus＇s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model＇s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.

A Multi-Hop Dynamic Path-Selection (MHDP) Algorithm for the Augmented Lifetime of Wireless Sensor Networks

In Wireless Sensor Networks (WSN), the lifetime of sensors is the crucial issue. Numerous schemes are proposed to augment the life time of sensors based on the wide range of parameters. In majority of the cases, the center of attraction will be the nodes’ lifetime enhancement and routing. In the scenario of cluster based WSN, multi-hop mode of communication reduces the communication cast by increasing average delay and also increases the routing overhead. In this proposed scheme, two ideas are introduced to overcome the delay and routing overhead. To achieve the higher degree in the lifetime of the nodes, the residual energy (remaining energy) of the nodes for multi-hop node choice is taken into consideration first. Then the modification in the routing protocol is evolved (Multi-Hop Dynamic Path-Selection Algorithm—MHDP). A dynamic path updating is initiated in frequent interval based on nodes residual energy to avoid the data loss due to path extrication and also to avoid the early dying of nodes due to elevation of data forwarding. The proposed method improves network’s lifetime significantly. The diminution in the average delay and increment in the lifetime of network are also accomplished. The MHDP offers 50% delay lesser than clustering. The average residual energy is 20% higher than clustering and 10% higher than multi-hop clustering. The proposed method improves network lifetime by 40% than clustering and 30% than multi-hop clustering which is considerably much better than the preceding methods.

A new constrained-send mechanism to enhance the performance of IEEE 802.11 DCF

In this paper, a modified access mechanism named Constrained-send DCF (CDCF) is proposed to improve the performance of IEEE 802.11 DCF protocol. It is found that, in DCF, the transmission probability is higher than the reasonable value when the node number is greater than 4 under basic access scheme or than 17 under RTS/CTS scheme, and it results in serious collision. To avoid collision of high access loading, a constrained-send probability is introduced at the end of each back off procedure for the station transmitting. The performance of this mechanism is analyzed based on a 2-Dimension Markov analytical model, after that the optimum constrained-send probability is derived. Numerical results show that the CDCF mechanism has much better performance than DCF with respect to both system throughput and average packet delay. And under RTS/CTS scheme, although CDCF slightly improve the throughput performance (due to the natural good throughput performance of RTS/CTS-scheme DCF), it leads to a much better average packet delay performance compared to DCF. The CDCF keeps all the features of the IEEE 802.11 DCF protocol and is quite easy to implement.