Scheduled System Maintenance

On Friday, September 21, IEEE Xplore will undergo scheduled maintenance. Users may experience intermittent access from 2:30–4:30 pm ET (6:30–8:30 UTC). The site may be unavailable for approximately 60 minutes during this period.
We apologize for any inconvenience.

# IEEE Transactions on Control of Network Systems

## Issue 3 • Sept. 2018

The purchase and pricing options for this item are unavailable. Select items are only available as part of a subscription package. You may try again later or contact us for more information.

## Filter Results

Displaying Results 1 - 25 of 62

Publication Year: 2018, Page(s):C1 - 821
| PDF (547 KB)
• ### IEEE Transactions on Control of Network Systems

Publication Year: 2018, Page(s): C2
| PDF (205 KB)
• ### Translational and Rotational Invariance in Networked Dynamical Systems

Publication Year: 2018, Page(s):822 - 832
| | PDF (800 KB) | HTML

In this paper, we study the translational and rotational ($SE(N)$) invariance properties of locally interacting multiagent systems. We focus on a class of networked dynamical systems, in which the agents have local pairwise interactions, and the overall effect of the interaction on each agent is the sum of the interactions with... View full abstract»

• ### Pricing for the Optimal Coordination of Opportunistic Agents

Publication Year: 2018, Page(s):833 - 845
| | PDF (826 KB) | HTML

We consider a system where a load aggregator (LA) serves a large number of small-sized, economically-driven consumers with deferrable demand, as envisioned in the smart electricity grid and data networks. In these systems, consumers can behave opportunistically by deferring their demand in response to the prices, to obtain economic gains. However, if not controlled properly, such opportunistic beh... View full abstract»

• ### Detection Against Linear Deception Attacks on Multi-Sensor Remote State Estimation

Publication Year: 2018, Page(s):846 - 856
Cited by:  Papers (5)
| | PDF (1113 KB) | HTML

In this paper, a security problem in cyberphysical systems (CPS) is studied. A remote state estimation process using multiple sensors is considered. The measurement innovation packets from each sensor, which may be modified by a malicious attacker, are sent to a remote fusion center through wireless communication channels. To avoid being detected by typical bad data detectors at the remote estimat... View full abstract»

• ### Controllability of Dynamic-Edge Multi-Agent Systems

Publication Year: 2018, Page(s):857 - 867
Cited by:  Papers (1)
| | PDF (599 KB) | HTML

This paper investigates the controllability of first-order dynamic-edge multi-agent (DEMA) systems that have dynamic systems attached on not only nodes but also edges. New results include a strong relationship between the controllability of homogeneous-edge DEMA systems and that of induced multi-agent systems (MASs) and a necessary and sufficient condition for the controllability of the general he... View full abstract»

• ### Distributed Enforcement of Phase-Cohesiveness for Frequency Control of Islanded Inverter-Based Microgrids

Publication Year: 2018, Page(s):868 - 878
Cited by:  Papers (3)
| | PDF (564 KB) | HTML

In this paper, we propose a frequency controller for lossless microgrids which achieves a desired active power load sharing while regulating system frequency to some nominal value. The control scheme is based on the slow readjustment of the active power reference of each inverter, i.e., each inverter aims to track a slowly-varying reference that is set sufficiently close to its actual active power... View full abstract»

• ### Finite-Time Distributed Averaging Over Gossip-Constrained Ring Networks

Publication Year: 2018, Page(s):879 - 887
| | PDF (531 KB) | HTML

We consider a multi-agent system where each agent has its own estimate of a given quantity and the goal is to reach consensus on the average. To this purpose, we propose a distributed consensus algorithm that guarantees convergence to the average in a finite number of communication rounds. The algorithm is tailored to ring networks subject to a gossip constraint. If the number of agents View full abstract»

• ### Networked State Estimation With Delayed and Irregularly Spaced Time-Stamped Observations

Publication Year: 2018, Page(s):888 - 900
Cited by:  Papers (1)
| | PDF (1259 KB) | HTML

We analyze the performance of a networked multisensor continuous-discrete Kalman filter in the presence of random observation delay and irregular sampling. The primary cause for irregular intersample intervals is the occasional loss of information packets. Additional causes include lack of synchrony between sensors, difference in their sampling rates, and the superposition of multiple sampling pat... View full abstract»

• ### Network-Based Analysis of Small-Disturbance Angle Stability of Power Systems

Publication Year: 2018, Page(s):901 - 912
Cited by:  Papers (5)
| | PDF (545 KB) | HTML

This paper investigates small-disturbance angle stability of power systems with emphasis on the role of power network topology, which sheds new light on the instability mechanism. We introduce the concepts of active power flow graph and critical lines. It is shown that the inertia of the Laplacian matrix of this graph provides information on the stability and type of an equilibrium point. Then, th... View full abstract»

• ### Independent Log-Linear Learning in Potential Games With Continuous Actions

Publication Year: 2018, Page(s):913 - 923
| | PDF (520 KB) | HTML

Game theoretic learning in multiagent systems is a rapidly developing area of research. It gained popularity since the wide range of optimization problems in multiagent systems can be reformulated in terms of potential games, where the set of potential function maximizers represents the set of optimal states. The crucial point of such approach is the design of local decision rules that leads the s... View full abstract»

• ### Centrality Measures in Linear Consensus Networks With Structured Network Uncertainties

Publication Year: 2018, Page(s):924 - 934
Cited by:  Papers (7)
| | PDF (1237 KB) | HTML

We propose new insights into the network centrality based not only on the network graph, but also on a more structured model of network uncertainties. The focus of this paper is on the class of uncertain linear consensus networks in continuous time, where the network uncertainty is modeled by structured additive Gaussian white noise input on the update dynamics of each agent. The performance of th... View full abstract»

• ### A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach

Publication Year: 2018, Page(s):935 - 945
Cited by:  Papers (3)
| | PDF (656 KB) | HTML

The alternating direction method of multipliers (ADMM) has been popular for solving many signal processing problems, convex or nonconvex. In this paper, we study an asynchronous implementation of ADMM for solving a nonconvex nonsmooth optimization problem, whose objective is the sum of a number of component functions. The proposed algorithm allows the problem to be solved in a distributed, asynchr... View full abstract»

• ### Stable Wireless Network Control Under Service Constraints

Publication Year: 2018, Page(s):946 - 956
Cited by:  Papers (1)
| | PDF (1050 KB) | HTML

We consider the design of wireless queueing network control policies with particular focus on combining stability with additional application-dependent requirements. Thereby, we consequently pursue a cost function based approach that provides the flexibility to incorporate constraints and requirements of particular services or applications. As typical examples of such requirements, we consider the... View full abstract»

• ### Distributed Stopping for Average Consensus in Digraphs

Publication Year: 2018, Page(s):957 - 967
| | PDF (1041 KB) | HTML

We consider how iterative strategies for asymptotic average consensus in directed graphs (digraphs) can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate the execution of the iteration whenapproximateaverage consensus has been reached. The nodes are said to have reached approximate average consensus when each o... View full abstract»

• ### Scaling the Kalman Filter for Large-Scale Traffic Estimation

Publication Year: 2018, Page(s):968 - 980
| | PDF (457 KB) | HTML

This work introduces a scalable filtering algorithm for multiagent traffic estimation. Large-scale networks are spatially partitioned into overlapping road sections. The traffic dynamics of each section is given by theswitching mode modelusing a conservation principle, and the traffic state in each section is estimated by a local agent. In the proposed filter, a consensus term is ... View full abstract»

• ### A Jamming-Resilient Algorithm for Self-Triggered Network Coordination

Publication Year: 2018, Page(s):981 - 990
Cited by:  Papers (2)
| | PDF (1247 KB) | HTML

The issue of cyber-security has become ever more prevalent in the analysis and design of cyber-physical systems. In this paper, we investigate self-triggered consensus networks in the presence of communication failures caused by denial-of-service (DoS) attacks. A general framework is considered in which the network links can fail independent of each other. By introducing a notion of persistency-of... View full abstract»

• ### Likelihood Ratio-Based Scheduler for Secure Detection in Cyber Physical Systems

Publication Year: 2018, Page(s):991 - 1002
Cited by:  Papers (1)
| | PDF (616 KB) | HTML

This paper is concerned with a binary detection problem over a nonsecure network. To satisfy the communication constraint and against possible cyber attacks, which are modeled as jamming signals injected to the network, a likelihood ratio based (LRB) scheduler is designed in the sensor to smartly select informative sensor measurements for transmission. We show that even under a moderate transmissi... View full abstract»

• ### Compositional Abstraction for Networks of Control Systems: A Dissipativity Approach

Publication Year: 2018, Page(s):1003 - 1015
Cited by:  Papers (4)
| | PDF (662 KB) | HTML

In this paper, we propose a compositional scheme for the construction of abstractions for networks of control systems by using the interconnection matrix and joint dissipativity-type properties of subsystems and their abstractions. In the proposed framework, the abstraction, itself a control system (possibly with a lower dimension), can be used as a substitution of the original system in the contr... View full abstract»

• ### Energy-Optimal Pump Scheduling and Water Flow

Publication Year: 2018, Page(s):1016 - 1026
| | PDF (627 KB) | HTML

This paper focuses on the optimal operation of water supply networks. We model water supply networks using hydraulic constraints, and formulate a joint optimal pump scheduling and water flow problem (OWF) using the hydraulic characteristics of variable speed pumps. OWF is amixed-integer nonlinear program. This problem is nonconvex, and hence NP-hard. To compute an exact solution o... View full abstract»

• ### Diffusing Private Data Over Networks

Publication Year: 2018, Page(s):1027 - 1037
Cited by:  Papers (2)
| | PDF (1214 KB) | HTML

The emergence of social and technological networks has enabled rapid sharing of data and information. This has resulted in significant privacy concerns, where private information can be either leaked or inferred from public data. The problem is significantly harder for social networks, where we may reveal more information to our friends than to strangers. Nonetheless, our private information can s... View full abstract»

• ### I-CSMA: A Link-Scheduling Algorithm for Wireless Networks Based on Ising Model

Publication Year: 2018, Page(s):1038 - 1050
| | PDF (918 KB) | HTML

We propose a new randomized link-scheduling algorithm for wireless networks, called I-carrier sense multiply access (I-CSMA), which is based on a modified version of the Ising model in physics. The main result is that I-CSMA is shown to be throughput optimal. I-CSMA is a generalization of earlier Glauber-dynamics-based, throughput-optimal algorithms, such as Q-CSMA in which each earlier algorithm ... View full abstract»

• ### Novel Homotopy Theory for Nonlinear Networks and Systems and Its Applications to Electrical Grids

Publication Year: 2018, Page(s):1051 - 1060
| | PDF (1355 KB) | HTML

Homotopy methods have several useful applications in biology, economics, nonlinear circuit design, and electric power networks, among others. A novel homotopy theory and a convergence theorem are presented in this paper for general-purpose homotopy methods. It is shown that the derived analytical results are applicable to a class of large-scale integrated-circuit designs and protein interaction ne... View full abstract»

• ### Structure Learning in Power Distribution Networks

Publication Year: 2018, Page(s):1061 - 1074
Cited by:  Papers (3)
| | PDF (1200 KB) | HTML

Traditional power distribution networks suffer from a lack of real-time observability. This complicates development and implementation of new smart-grid technologies, such as those related to demand response, outage detection and management, and improved load monitoring. In this paper, inspired by proliferation of metering technology, we discuss topology estimation problems in structurally loopy b... View full abstract»

• ### Topology Design for Stochastically Forced Consensus Networks

Publication Year: 2018, Page(s):1075 - 1086
Cited by:  Papers (5)
| | PDF (2411 KB) | HTML

We study an optimal control problem aimed at adding a certain number of edges to an undirected network, with a known graph Laplacian, in order to optimally enhance closed-loop performance. The performance is quantified by the steady-state variance amplification of the network with additive stochastic disturbances. To promote controller sparsity, we introduce View full abstract»

## Aims & Scope

The IEEE Transactions on Control of Network Systems is committed to the timely publication of high-impact papers at the intersection of control systems and network science.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Ioannis Ch. Paschalidis
Boston University