Distributed fault detection over sensor networks with Markovian switching topologies

This paper deals with the distributed fault detection for discrete-time Markov jump linear systems over sensor networks with Markovian switching topologies. The sensors are scatteredly deployed in the sensor field and the fault detectors are physically distributed via a communication network. The system dynamics changes and sensing topology variations are modeled by a discrete-time Markov chain with incomplete mode transition probabilities. Each of these sensor nodes firstly collects measurement outputs from its all underlying neighboring nodes, processes these data in accordance with the Markovian switching topologies, and then transmits the processed data to the remote fault detector node. Network-induced delays and accumulated data packet dropouts are incorporated in the data transmission between the sensor nodes and the distributed fault detector nodes through the communication network. To generate localized residual signals, mode-independent distributed fault detection filters are proposed. By means of the stochastic Lyapunov functional approach, the residual system performance analysis is carried out such that the overall residual system is stochastically stable and the error between each residual signal and the fault signal is made as small as possible. Furthermore, a sufficient condition on the existence of the mode-independent distributed fault detection filters is derived in the simultaneous presence of incomplete mode transition probabilities, Markovian switching topologies, network-induced delays, and accumulated data packed dropouts. Finally, a stirred-tank reactor system is given to show the effectiveness of the developed theoretical results.     

An algorithm for clock synchronization with the gradient property in sensor networks

We introduce a distributed algorithm for clock synchronization in sensor networks. Our algorithm assumes that nodes in the network only know their immediate neighborhoods and an upper bound on the network’s diameter. Clock-synchronization messages are only sent as part of the communication–assumed to be reasonably frequent–that already takes place among nodes. The algorithm has the gradient property of [R. Fan, N. Lynch, Gradient clock synchronization, Distributed Computing 18 (2006) 255–266], achieving an O(1)$O\left(1\right)$ worst-case skew between the logical clocks of neighbors. The algorithm’s actions are such that no constant lower bound exists on the rate at which logical clocks progress in time, and for this reason the lower bound of [R. Fan, N. Lynch, Gradient clock synchronization, Distributed Computing 18 (2006) 255–266; L. Meier, L. Thiele, Brief announcement: Gradient clock synchronization in sensor networks, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005, p. 238] that forbids a constant clock skew between neighbors does not apply.     

Sensor-network-based robust distributed control and estimation

This paper proposes a novel distributed estimation and control method for uncertain plants. It is of application in the case of large-scale systems, where each control unit is assumed to have access only to a subset of the plant outputs, and possibly controls a restricted subset of input channels. A constrained communication topology between nodes is considered so the units can benefit from estimates of neighboring nodes to build their own estimates. The paper proposes a methodology to design a distributed control structure so that the system is asymptotically driven to equilibrium with L₂-gain disturbance rejection capabilities. A difficulty that arises is that the separation principle does not hold, as every single unit ignores the control action that other units might be applying. To overcome this, a two-stage design is proposed: firstly, the distributed controllers are obtained to robustly stabilize the plant despite the observation errors in the controlled output. At the second stage, the distributed observers are designed aiming to minimize the effects of the communication noise in the observation error. Both stages are formulated in terms of linear matrix inequalities. The performance is shown on a level-control real plant.     

Markovian jump guaranteed cost congestion control strategies for large scale mobile networks with differentiated services traffic

In this paper, two novel congestion control strategies for mobile networks with differentiated services (Diff-Serv) traffic are presented, namely (i) a Markovian jump decentralized guaranteed cost congestion control strategy, and (ii) a Markovian jump distributed guaranteed cost congestion control strategy. The switchings or changes in the network topology are modeled by a Markovian jump process. By utilizing guaranteed cost control principles, the proposed congestion control schemes do indeed take into account the associated physical network resource constraints and are shown to be robust to unknown and time-varying network latencies and time delays. A set of Linear Matrix Inequality (LMI) conditions are obtained to guarantee the QoS of the Diff-Serv traffic with a guaranteed upper bound cost. Simulation results are presented to illustrate the effectiveness and capabilities of our proposed strategies. Comparisons with centralized and other relevant works in the literature focused on Diff-Serv traffic and mobile networks are also provided to demonstrate the advantages of our proposed solutions.     

Average consensus in networks with nonlinearly delayed couplings and switching topology

The paper addresses consensus under nonlinear couplings and bounded delays for multi-agent systems, where the agents have the single-integrator dynamics. The network topology is undirected and may alter as time progresses. The couplings are uncertain and satisfy a conventional sector condition with known sector slopes. The delays are uncertain, time-varying and obey known upper bounds. The network satisfies a symmetry condition that resembles the Newton’s Third Law. Explicit analytical conditions for the robust consensus are offered that employ only the known upper bounds for the delays and the sector slopes.     

Passive stability and synchronization of complex spatio-temporal switching networks with time delays

In this paper, a new model of complex spatio-temporal switching network is established. Each subsystem of the network at a different time interval corresponds to a different switching mode. Switching the signal depends on both the instant time t and the index of node i. Based on passivity property, the passive stability and synchronization of this kind of network with time delays are taken into account. An example and simulation results are included.     

An event-triggered approach to state estimation with multiple point- and set-valued measurements

In this work, we consider state estimation based on the information from multiple sensors that provide their measurement updates according to separate event-triggering conditions. An optimal sensor fusion problem based on the hybrid measurement information (namely, point- and set-valued measurements) is formulated and explored. We show that under a commonly-accepted Gaussian assumption, the optimal estimator depends on the conditional mean and covariance of the measurement innovations, which applies to general event-triggering schemes. For the case that each channel of the sensors has its own event-triggering condition, closed-form representations are derived for the optimal estimate and the corresponding error covariance matrix, and it is proved that the exploration of the set-valued information provided by the event-triggering sets guarantees the improvement of estimation performance. The effectiveness of the proposed event-based estimator is demonstrated by extensive Monte Carlo simulation experiments for different categories of systems and comparative simulation with the classical Kalman filter.     

Point-to-group blocking in the switching networks with unicast and multicast switching

In this paper, a new approximate effective availability method of the point-to-group blocking probability calculation in switching networks carrying a mixture of different multi-rate unicast and multicast traffic streams is presented. Until recently, such methods have only been proposed for the single-services switching networks. To the best of our knowledge, methods of blocking probability calculation for multi-service switching network with multicast connection have not yet been considered. In this paper, four algorithms of setting-up multicast connections in multi-service switching networks are considered and discussed. Special attention is paid to the methods for determining the effective availability parameter in the case of multicast connections. The results of the analytical calculations are compared with the data of the digital simulations of the switching networks with unicast and multicast connections.     

Energy-efficient topology control algorithm for maximizing network lifetime in wireless sensor networks with mobile sink

Uneven energy consumption is an inherent problem in wireless sensor networks characterized by multi-hop routing and many-to-one traffic pattern. Such unbalanced energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of prolonging network lifetime in large-scale wireless sensor networks where a mobile sink gathers data periodically along the predefined path and each sensor node uploads its data to the mobile sink over a multi-hop communication path. By using greedy policy and dynamic programming, we propose a heuristic topology control algorithm with time complexity O(n(m + n log n)), where n and m are the number of nodes and edges in the network, respectively, and further discuss how to refine our algorithm to satisfy practical requirements such as distributed computing and transmission timeliness. Theoretical analysis and experimental results show that our algorithm is superior to several earlier algorithms for extending network lifetime.     

Cost-effective approach inter-LMA domain management and distributed mobility control scheme in proxy mobile IPv6 networks

The Proxy Mobile IPv6 (PMIPv6) is designed to provide network-based mobility management support to a mobile node (MN) without any involvement of the MN in mobility related signaling; hence, the proxy mobility entity performs all related signaling on behalf of the MN. The new principal functional entities of PMIPv6 are the local mobility anchor (LMA) and the mobile access gateway (MAG). In PMIPv6, all the data traffic sent from the MN gets routed to the LMA through a tunnel between the LMA and the MAG, but it still has a single point of failure (SPOF) and a bottleneck state of traffic. To solve these problems, various approaches directed towards PMIPv6 performance improvements, such as route optimization, have been proposed. However, these approaches add additional signaling to support the MN׳s mobility, which incurs extra network overhead and still provides difficulty when applied to multiple-LMA networks. In this paper, we propose an improved route optimization in PMIPv6-based multiple-LMA networks. All LMAs were connected to the proxy internetworking gateway (PIG), which performs inter-domain distributed mobility control. Each MAG keeps the information of all LMAs in the PMIPv6 domain, so it is possible to perform fast route optimization. Therefore, this method supported route optimization without any additional signaling because the LMA receives the state information of route optimization from the PIG.     

分布式控制系统的时间同步装置设计与应用

高精密时间同步是分布式控制系统一切应用的基础。文章介绍一种利用GPS接收机输出的Ipps信号设计分布式控制系统时间同步装置的基本原理，并给出了应用结论。     

On average consensus in directed networks of agents with switching topology and time delay

In this article, the average consensus problem in directed networks of agents with both switching topology and coupling delay is investigated. First, based on a specific orthogonal transformation of the Laplacian matrix, an important proposition for verifying the positive definiteness of a class of quadratic forms is provided, which is of independent interest in matrix theory. And the relation between weakly connected and strongly connected digraphs is also investigated. Then, it is proved that all the agents reach the average consensus asymptotically for appropriate time delay if the communication topology keeps weakly connected and balanced. Finally, a numerical example is given to demonstrate the effectiveness and advantage of the new result.     

Reliable and energy-efficient data collection in sparse sensor networks with mobile elements

Sparse wireless sensor networks (WSNs) are emerging as an effective solution for a wide range of applications, especially for environmental monitoring. In many scenarios, a moderate number of sparsely deployed nodes can be sufficient to get the required information about the sensed phenomenon. To this end, special mobile elements, i.e. mobile data collectors (MDCs), can be used to get data sampled by sensor nodes. In this paper we present an analytical evaluation of the data collection performance in sparse WSNs with MDCs. Our main contribution is the definition of a flexible model which can derive the total energy consumption for each message correctly transferred by sensors to the MDC. The obtained energy expenditure for data transfer also accounts for the overhead due to the MDC detection when sensor nodes operate with a low duty cycle. The results show that a low duty cycle is convenient and allows a significant amount of correctly received messages, especially when the MDC moves with a low speed. When the MDC moves fast, depending on its mobility pattern, a low duty cycle may not always be the most energy efficient option.     

Heuristic routing with bandwidth and energy constraints in sensor networks

Most of the routing algorithms devised for sensor networks considered either energy constraints or bandwidth constraints to maximize the network lifetime. In the real scenario, both energy and bandwidth are the scarcest resource for sensor networks. The energy constraints affect only sensor routing, whereas the link bandwidth affects both routing topology and data rate on each link. Therefore, a heuristic technique that combines both energy and bandwidth constraints for better routing in the wireless sensor networks is proposed. The link bandwidth is allocated based on the remaining energy making the routing solution feasible under bandwidth constraints. This scheme uses an energy efficient algorithm called nearest neighbor tree (NNT) for routing. The data gathered from the neighboring nodes are also aggregated based on averaging technique in order to reduce the number of data transmissions. Experimental results show that this technique yields good solutions to increase the sensor network lifetime. The proposed work is also tested for wildfire application.     

Consensus based overlapping decentralized estimation with missing observations and communication faults

In this paper a new algorithm for discrete-time overlapping decentralized state estimation of large scale systems is proposed in the form of a multi-agent network based on a combination of local estimators of Kalman filtering type and a dynamic consensus strategy, assuming intermittent observations and communication faults. Under general conditions concerning the agent resources and the network topology, conditions are derived for the convergence to zero of the estimation error mean and for the mean-square estimation error boundedness. A centralized strategy based on minimization of the steady-state mean-square estimation error is proposed for selection of the consensus gains; these gains can also be adjusted by local adaptation schemes. It is also demonstrated that there exists a connection between the network complexity and efficiency of denoising, i.e., of suppression of the measurement noise influence. Several numerical examples serve to illustrate characteristic properties of the proposed algorithm and to demonstrate its applicability to real problems.     

Modelling and analysis of pipelined circuit switching in interconnection networks with bursty traffic and hot-spot destinations

Pipelined circuit switching (PCS) that combines the advantages of both circuit switching and wormhole switching is an efficient method for passing messages in interconnection networks. Analytical modelling is a cost-effective tool and plays an important role in achieving a clear understanding of the network performance. However, most of the existing models for PCS are unable to capture the realistic nature of message behaviours generated by real-world applications, which have a significant impact on the design and performance of communication networks. This paper presents a new analytical model for PCS in interconnection networks in the presence of bursty and correlated message arrivals coupled with hot-spot destinations, which can capture the bursty message arrival process and non-uniform distribution of message destinations. Such a traffic pattern has been found in many practical communication environments. The accuracy of the proposed analytical model is validated through extensive simulation experiments. The model is then applied to investigate the effects of the bursty message arrivals and hot-spot destinations on the performance of interconnection networks with PCS.     

A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles

In mobile ad hoc and sensor networks, greedy-face-greedy (GFG) geographic routing protocols have been a topic of active research in recent years. Most of the GFG geographic routing protocols make an ideal assumption that nodes in the network construct a unit-disk graph, UDG, and extract a planar subgraph from the UDG for face routing. However, the assumption of UDG may be violated in realistic environments, which may cause the current GFG geographic routing protocols to fail. In this paper, we propose a Pre-Processed Cross Link Detection Protocol, PPCLDP, which extracts an almost planar subgraph from a realistic network graph, instead of a UDG, for face routing and makes the GFG geographic routing work correctly in realistic environments with obstacles. The proposed PPCLDP improves the previous work of Cross Link Detection Protocol, CLDP, with far less communication cost and better convergence time. Our simulation results show that the average communication cost and the average convergence time of PPCLDP are, respectively, 65% and 45% less than those of CLDP. This makes PPCLDP more desirable for mobile ad hoc and sensor networks.     

State estimation for fuzzy cellular neural networks with time delay in the leakage term, discrete and unbounded distributed delays

This paper deals with the problem of state estimation for fuzzy cellular neural networks (FCNNs) with time delay in the leakage term, discrete and unbounded distributed delays. In this paper, leakage delay in the leakage term is used to unstable the neuron states. It is challenging to develop a delay dependent condition to estimate the unstable neuron states through available output measurements such that the error-state system is globally asymptotically stable. By constructing the Lyapunov-Krasovskii functional which contains a triple-integral term, an improved delay-dependent stability criterion is derived in terms of linear matrix inequalities (LMIs). However, by using the free-weighting matrices method, a simple and efficient criterion is derived in terms of LMIs for estimation. The restriction such as the time-varying delay which was required to be differentiable or even its time-derivative which was assumed to be smaller than one, are removed. Instead, the time-varying delay is only assumed to be bounded. Finally, numerical examples and its simulations are given to demonstrate the effectiveness of the derived results.