Optimization of communication topology for persistent formation in case of communication faults

To address the optimization problem of communication topology for persistent formation in the case of communication faults such as link interruption,transmitter failure,and receiver failure a two-stage model including fast reconstruction of communication topology and re-optimization of communication topology is constructed.Then,a fast reconstruction algorithm of communication topology for persistent formation(FRA-CT-PF),based on optimally rigid graph,arc addition operation,and path reversal operation,is proposed,which can quickly generate a feasible reconstructed communication topology after communication faults,thus ensuring the safety of the agents and maintaining the formation shape of persistent formation.Furthermore,a re-optimization algorithm of communication topology for persistent formation(ROA-CTPF),based on agent position exchange,is proposed,which can further obtain a reoptimized communication topology to minimize the formation communication cost while still maintaining the formation shape of persistent formation.The time complexities of these two algorithms are also analyzed.Finally,the effectiveness of the above algorithms is verified by numerical experiments.Compared with existing algorithms,FRA-CT-PF can always obtain feasible reconstructed communication topology in much less time under all communication fault scenarios,and ROA-CT-PF can obtain a reoptimized communication topology to further reduce the formation communication cost in a shorter time.

A Distributed Cooperative Localization Algorithm for Mobile Multi-platforms Oriented to Unpredicted Communication Topology

The cooperative localization(CL)is affected by the communication topology among the platforms.Based on the unscented Kalman filtering,the distributed CL(DCL)oriented to the unpredicted communication topology is investigated.To improve the adaptability,the character of the look-up Cholesky decomposition is exploited for the covariance matrix decomposing.Then,the distributed U transformation can be dynamically implemented according to the available communication topology.In the proposed algorithm,the global information is not required for the individual,and only the available information from the neighbor is used.Each platform’s state can be estimated independently.The error covariance of the state estimates can be updated in the single platform.The algorithm is adaptive to any serial communication topologies where the measuring to the measured platform is a starting path.The applicability of the proposed algorithm to unpredicted communication topology is improved,remaining equivalent localization performance to free connection communication.

Consensus of high-order dynamic multi-agent systems with switching topology and time-varying delays

This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed consensus protocol is proposed, which only depends on the agent＇s own information and its neighbors＇ partial information. By introducing a decomposition of the state vector and performing a state space transformation, the closed-loop dynamics of the multi-agent system is converted into two decoupled subsystems. Based on the decoupled subsystems, some sufficient conditions for the convergence to consensus are established, which provide the upper bounds on the admissible communication delays. Also, the explicit expression of the consensus state is derived. Moreover, the results on the consensus seeking of the group of high-order agents have been extended to a network of agents with dynamics modeled as a completely controllable linear time-invariant system. It is proved that the convergence to consensus of this network is equivalent to that of the group of high-order agents. Finally, some numerical examples are given to demonstrate the effectiveness of the main results.

Distributed Secondary Control of AC Microgrids With External Disturbances and Directed Communication Topologies:A Full-Order Sliding-Mode Approach

This paper addresses the problem of distributed secondary control for islanded AC microgrids with external disturbances.By using a full-order sliding-mode(FOSM)approach,voltage regulation and frequency restoration are achieved in finite time.For voltage regulation,a distributed observer is proposed for each distributed generator(DG)to estimate a reference voltage level.Different from some conventional observers,the reference voltage level in this paper is accurately estimated under directed communication topologies.Based on the observer,a new nonlinear controller is designed in a backstepping manner such that an FOSM surface is reached in finite time.On the surface,the voltages of DGs are regulated to the reference level in finite time.For frequency restoration,a distributed controller is further proposed such that a constructed FOSM surface is reached in finite time,on which the frequencies of DGs are restored to a reference level in finite time under directed communication topologies.Finally,case studies on a modified IEEE 37-bus test system are conducted to demonstrate the effectiveness,the robustness against load changes,and the plug-and-play capability of the proposed controllers.

Limited-Budget Consensus Design and Analysis for Multiagent Systems With Switching Topologies and Intermittent Communications

This paper investigates limited-budget consensus design and analysis problems of general high-order multiagent systems with intermittent communications and switching topologies.The main contribution of this paper is that the tradeoff design between the energy consumption and the consensus performance can be realized while achieving leaderless or leaderfollowing consensus,under constraints of limited budgets and intermittent communications.Firstly,a new intermittent limitedbudget consensus control protocol with a practical trade-off design index is proposed,where the total budget of the whole multiagent system is limited.Then,leaderless limited-budget consensus design and analysis criteria are derived,in which the matrix variables of linear matrix inequalities are determined according to the total budget and the practical trade-off design parameters.Meanwhile,an explicit formulation of the consensus function is derived to describe the consensus state trajectory of the whole system.Moreover,a new two-stage transformation strategy is utilized for leader-following cases,by which the dynamics decomposition of leaderless and leader-following cases can be converted into a unified framework,and sufficient conditions of the leader-following limited-budget consensus design and analysis are determined via those of the leaderless cases.Finally,numerical simulations are given to illustrate theoretical results.

Exponential networked synchronization of master-slave chaotic systems with timevarying communication topologies

The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple linear state feedback controller is designed to synchronize the master chaotic system and the slave chaotic systems with a time- varying communication topology connection. The exponential stability of the closed-loop networked synchronization error system is guaranteed by applying Lyapunov stability theory. The derived novel criteria are in the form of linear matrix inequalities （LMIs）, which are easy to examine and tremendously reduce the computation burden from the feedback matrices. This paper provides an alternative networked secure communication scheme which can be extended conveniently. An illustrative example is given to demonstrate the effectiveness of the proposed networked synchronization method.

Tracking problem under a time-varying topology

This paper studies the multi-agent tracking problem of a third-order maneuvering target under uncertain communication environments. Each tracking agent is assumed to be a third-order system and can only use its own and neighbors＇ position, velocity, and acceleration information to design its control input. In this work, the uncertain communication environments are modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sufficient conditions for the existence of a tracking strategy have been expressed in terms of the solvability of linear matrix inequalities. Finally, a numerical example is employed to demonstrate the effectiveness of the proposed tracking strategy.

5G High Mobility Wireless Communications: Challenges and Solutions

The fifth generation(5G) network is expected to support significantly large amount of mobile data traffic and huge number of wireless connections,to achieve better spectrum- and energy-efficiency,as well as quality of service(QoS) in terms of delay,reliability and security.Furthermore,the 5G network shall also incorporate high mobility requirements as an integral part,providing satisfactory service to users travelling at a speed up to 500 km/h.This paper provides a survey of potential high mobility wireless communication(HMWC) techniques for 5G network.After discussing the typical requirements and challenges of HMWC,key techniques to cope with the challenges are reviewed,including transmission techniques under the fast timevarying channels,network architecture with mobility support,and mobility management.Finally,future research directions on 5G high mobility communications are given.

Multi-agent consensus with time-varying delays and switching topologies

The consensus problems of multi-agents with time-varying delays and switching topologies are studied. First, assume that an agent receives state information from its neighbors with fixed communication delays and processes its own state information with time-varying self-delay respectively. The state time-delay feedback is introduced into the existing consensus protocol to begenerate an improved protocol. Then a sufficient condition is derived which can make the system with time-varying self-delays achieve the consensus. On this basis, a specific form of consensus equilibrium influenced by the initial states of agents, time-delays and state feedback intensity is figured out. In addition, the multi-agent consensus is considered with time-varying topologies. Finally, simulations are presented to il ustrate the validity of theoretical results.

A Clustering-tree Topology Control Based on the Energy Forecast for Heterogeneous Wireless Sensor Networks

How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks(HWSN).In this paper, a clustering-tree topology control algorithm based on the energy forecast(CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round(the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function(including the energy, link quality and packet loss rate) and their distance.The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several noncluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy(LEACH), energy dissipation forecast and clustering management(EDFCM) and efficient and dynamic clustering scheme(EDCS)protocols, CTEF has longer network lifetime and receives more data packets at base station.

Optimum Relay Location in Cooperative Communication Networks with Single AF Relay

In recent years cooperative diversity has been widely used in wireless networks. In particular, cooperative communication with a single relay is a simple, practical technology for wireless sensor networks. In this paper, we analyze several simple network topologies. Under the condition of equal power allocating, the optimum relay location of each network topology are respectively made sure by using symbol error rate (SER) formula. And these types of topologies are compared, the analysis results show that, linear network topology has the best system performance, the system performance of isosceles triangle topology is better than that of equilateral triangle topology.

Time-varying formation for general linear multi-agent systems via distributed event-triggered control under switching topologies

This paper investigates the time-varying formation problem for general linear multi-agent systems using distributed event-triggered control strategy.Different from the previous works,to achieve the desired time-varying formation,a distributed control scheme is designed in an event-triggered way,in which for each agent the controller is triggered only at its own event times.The interaction topology among agents is assumed to be switching.The common Lyapunov function as well as Riccati inequality is applied to solve the time-varying formation problem.Moreover,the Zeno behavior of triggering time sequences can be excluded for each agent.Finally,a simulation example is presented to illustrate the effectiveness of the theoretical results.

Two-Tier Hierarchical Cluster Based Topology in Wireless Sensor Networks for Contention Based Protocol Suite

The 802.15.4 Wireless Sensor Networks (WSN) becomes more economical, feasible and sustainable for new generation communication environment, however their limited resource constraints such as limited power capacity make them difficult to detect and defend themselves against variety of attacks. The radio interference attacks that generate for WSN at the Physical Layer cannot be defeated through conventional security mechanisms proposed for 802.15.4 standards. The first section introduces the deployment model of two-tier hierarchical cluster topology architecture and investigates different jamming techniques proposed for WSN by creating specific classification of different types of jamming attacks. The following sections expose the mitigation techniques and possible built-in mechanisms to mitigate the link layer jamming attacks on proposed two-tier hierarchical clustered WSN topology. The two-tier hierarchical cluster based topology is investigated based on contention based protocol suite through OPNET simulation scenarios.

Dynamic Event-Triggered Consensus Control for Input Constrained Multi-Agent Systems With a Designable Minimum Inter-Event Time

This paper investigates the consensus control of multi-agent systems(MASs) with constrained input using the dynamic event-triggered mechanism(ETM).Consider the MASs with small-scale networks where a centralized dynamic ETM with global information of the MASs is first designed.Then,a distributed dynamic ETM which only uses local information is developed for the MASs with large-scale networks.It is shown that the semi-global consensus of the MASs can be achieved by the designed bounded control protocol where the Zeno phenomenon is eliminated by a designable minimum inter-event time.In addition,it is easier to find a trade-off between the convergence rate and the minimum inter-event time by an adjustable parameter.Furthermore,the results are extended to regional consensus of the MASs with the bounded control protocol.Numerical simulations show the effectiveness of the proposed approach.

Distributed Flocking Algorithm for Multi-UAV System Based on Behavior Method and Topological Communication

There are many interesting flocking phenomena in nature,such as joint predation and group migration,and the intrinsic communication patterns of flocking are essential for studying group behavior.Traditional models of communication such as the pigeon flock model and the wolf pack model define all agents within a perceptual distance as the neighborhoods,and some models have fixed communicating numbers.There is a significant impact on the quality of the flocking formation when encountering poor initial state of the flocking,multiple obstacles,or loss of certain agents.To solve this problem,this paper proposes a local communication model with nearest agents in four directions.Based on this model and behavioral method,two distributed flocking formation algorithms are designed in this paper for different scenarios,namely the flocking algorithm and the circular formation algorithm.Numerical simulation results show that the flocking can pass through the obstacle area and re-formation smoothly,and also the formation quality of the flocking is better compared with the traditional communication model.

Consensus of multiple autonomous underwater vehicles with double independent Markovian switching topologies and timevarying delays

A new method in which the consensus algorithm is used to solve the coordinate control problems of leaderless multiple autonomous underwater vehicles（multi-AUVs） with double independent Markovian switching communication topologies and time-varying delays among the underwater sensors is investigated.This is accomplished by first dividing the communication topology into two different switching parts,i.e.,velocity and position,to reduce the data capacity per data package sent between the multi-AUVs in the ocean.Then,the state feedback linearization is used to simplify and rewrite the complex nonlinear and coupled mathematical model of the AUVs into a double-integrator dynamic model.Consequently,coordinate control of the multi-AUVs is regarded as an approximating consensus problem with various time-varying delays and velocity and position topologies.Considering these factors,sufficient conditions of consensus control are proposed and analyzed and the stability of the multi-AUVs is proven by Lyapunov-Krasovskii theorem.Finally,simulation results that validate the theoretical results are presented.

Consensus of single integrator multi-agent systems with directed topology and communication delays

In this paper, a distributed control scheme has been developed for consensus of single integrator multi-agent systems with directed fixed communication topology for arbitrarily large constant, time-varying or distributed communication delays. It is proved that the closed loop control system can reach consensus with an exponential convergence rate if and only if the topology is quasi-strongly connected. Simulation results are also provided to demonstrate the effectiveness of the proposed controller.

Generalized Consensus of Discrete-Time Multi-Agent Systems with Directed Topology and Communication Delay

Compared with traditional consensus,this paper studies the generalized consensus problem for discrete-time multi-agent systems with directed topology and communication delay.Novel distributed consensus protocols with and without communication delay are designed.Based on the analysis of error dynamical system and graph theory,the generalized consensus is globally asymptotically achieved under suitable conditions without changing the zero row-sums property of Laplacian matrix in networks.Moreover,the sufficient conditions for generalized consensus of communication delay are obtained under directed connections.Finally,some simulations have been provided to verify the theoretical results.

Consensus of multi-vehicle cooperative attack with stochastic multi-hop time-varying delay and actuator fault

A consensus-distributed fault-tolerant(CDFT)control law is proposed for a class of leader-following multi-vehicle cooperative attack(MVCA)systems in this paper.In particular,the switching communication topologies,stochastic multi-hop timevarying delays,and actuator faults are considered,which may lead to system performance degradation or on certain occasions even cause system instability.Firstly,the estimator of actuator faults for the following vehicle is designed to identify the actuator faults under a fixed topology.Then the CDFT control protocol and trajectory following error are derived by the relevant content of Lyapunov stability theory,the graph theory,and the matrix theory.The CDFT control protocol is proposed in the same manner,where a more realistic scenario is considered,in which the maximum trajectory following error and information on the switching topologies during the cooperative attack are available.Finally,numerical simulation are carried out to indicate that the proposed distributed fault-tolerant(DFT)control law is effective.

Global Exponential Stability of Almost Periodic Solution of Cellular Neural Networks with Time-Varying Delays

In this paper, global exponential stability of almost periodic solution of cellular neural networks with time-varing delays （CNNVDs） is considered. By using the methods of the topological degree theory and generalized Halanay inequality, a few new applicable criteria are established for the existence and global exponential stability of almost periodic solution. Some previous results are improved and extended in this letter and one example is given to illustrate the effectiveness of the new results.