By Topic

# IEEE Transactions on Control of Network Systems

## Filter Results

Displaying Results 1 - 15 of 15

Publication Year: 2014, Page(s): C1
| PDF (444 KB)
• ### IEEE Transactions on Control of Network Systems publication information

Publication Year: 2014, Page(s): C2
| PDF (144 KB)
• ### The Inaugural Issue of the IEEE Transactions on Control of Network Systems

Publication Year: 2014, Page(s):1 - 3
| PDF (180 KB) | HTML
• ### Compositional Transient Stability Analysis of Multimachine Power Networks

Publication Year: 2014, Page(s):4 - 14
Cited by:  Papers (16)
| | PDF (1833 KB) | HTML

During the normal operation of a power system, all the voltages and currents are sinusoids with a frequency of 60 Hz in America and parts of Asia or of 50 Hz in the rest of the world. Forcing all the currents and voltages to be sinusoids with the right frequency is one of the most important problems in power systems. This problem is known as the transient stability problem in the power systems lit... View full abstract»

• ### Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence

Publication Year: 2014, Page(s):15 - 27
Cited by:  Papers (98)  |  Patents (1)
| | PDF (2490 KB) | HTML

This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relationships among them. Part II presents sufficient conditions under which the convex relaxations are exact. View full abstract»

• ### Optimal Control of Scalar Conservation Laws Using Linear/Quadratic Programming: Application to Transportation Networks

Publication Year: 2014, Page(s):28 - 39
Cited by:  Papers (3)
| | PDF (1775 KB) | HTML

This article presents a new optimal control framework for transportation networks in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi (H-J) equation and the commonly used triangular fundamental diagram, we pose the problem of controlling the state of the system on a network link, in a finite horizon, as a Linear Program... View full abstract»

• ### Controllability Metrics, Limitations and Algorithms for Complex Networks

Publication Year: 2014, Page(s):40 - 52
Cited by:  Papers (66)
| | PDF (1912 KB) | HTML

This paper studies the problem of controlling complex networks, i.e., the joint problem of selecting a set of control nodes and of designing a control input to steer a network to a target state. For this problem, 1) we propose a metric to quantify the difficulty of the control problem as a function of the required control energy, 2) we derive bounds based on the system dynamics (network topology a... View full abstract»

• ### Distributed Control with Low-Rank Coordination

Publication Year: 2014, Page(s):53 - 63
Cited by:  Papers (9)
| | PDF (1653 KB) | HTML Media

A common approach to distributed control design is to impose sparsity constraints on the controller structure. Such constraints, however, may greatly complicate the control design procedure. This paper puts forward an alternative structure, which is not sparse yet might nevertheless be well suited for distributed control purposes. The structure appears as the optimal solution to a class of coordin... View full abstract»

• ### An $O(1/k)$ Gradient Method for Network Resource Allocation Problems

Publication Year: 2014, Page(s):64 - 73
Cited by:  Papers (23)
| | PDF (1601 KB) | HTML

We present a fast distributed gradient method for a convex optimization problem with linear inequalities, with a particular focus on the network utility maximization (NUM) problem. Most existing works in the literature use (sub)gradient methods for solving the dual of this problem which can be implemented in a distributed manner. However, these (sub)gradient methods suffer from an O(1/"... View full abstract»

• ### Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies

Publication Year: 2014, Page(s):74 - 85
| | PDF (2635 KB) | HTML

In this paper, we consider the problem of constructing minimal cycle-breaking connectivity preserving sets of turns for graphs that model communication networks, as a method to prevent deadlocks. Cycle-breaking provides for deadlock-free wormhole routing constrained by turns prohibited at some nodes. We present lower and upper bounds for minimal cardinalities of cycle-breaking connectivity preserv... View full abstract»

• ### Optimal Routing and Energy Allocation for Lifetime Maximization of Wireless Sensor Networks With Nonideal Batteries

Publication Year: 2014, Page(s):86 - 98
Cited by:  Papers (5)
| | PDF (3106 KB) | HTML

An optimal control approach is used to solve the problem of routing in sensor networks where the goal is to maximize the network's lifetime. In our analysis, the energy sources (batteries) at nodes are not assumed to be “ideal” but rather behaving according to a dynamic energy consumption model, which captures the nonlinear behavior of actual batteries. We show that in a fixed topolo... View full abstract»

• ### Optimal Resource Allocation for Network Protection Against Spreading Processes

Publication Year: 2014, Page(s):99 - 108
Cited by:  Papers (33)
| | PDF (1930 KB) | HTML

We study the problem of containing spreading processes in arbitrary directed networks by distributing protection resources throughout the nodes of the network. We consider that two types of protection resources are available: 1) preventive resources able to defend nodes against the spreading (such as vaccines in a viral infection process) and 2) corrective resources able to neutralize the spreadin... View full abstract»

• ### Message Passing Optimization of Harmonic Influence Centrality

Publication Year: 2014, Page(s):109 - 120
Cited by:  Papers (6)
| | PDF (2323 KB) | HTML

This paper proposes a new measure of node centrality in social networks, the Harmonic Influence Centrality (HIC), which emerges naturally in the study of social influence over networks. Using an intuitive analogy between social and electrical networks, we introduce a distributed message passing algorithm to compute the HIC of each node. Although its design is based on theoretical results which ass... View full abstract»

• ### Collective Decision-Making in Ideal Networks: The Speed-Accuracy Tradeoff

Publication Year: 2014, Page(s):121 - 132
Cited by:  Papers (14)
| | PDF (2089 KB) | HTML

We study collective decision-making in a model of human groups, with network interactions, performing two alternative choice tasks. We focus on the speed-accuracy tradeoff, i.e., the tradeoff between a quick decision and a reliable decision, for individuals in the network. We model the evidence aggregation process across the network using a coupled drift-diffusion model (DDM) and consider the free... View full abstract»

• ### IEEE Transactions on Control of Network Systems information for authors

Publication Year: 2014, Page(s):133 - 134
| PDF (139 KB)

## 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