providing a high-quality service for transmission and playing real-time voice conversations (voice streaming) over wireless ad-hoc networks is no mean feat. buffering together with adjusting the playout time of the packets is a receiver-side solution to overcome this challenge. in this paper, a new adaptive playout adjustment algorithm is proposed to stream the voice conversations over wireless...

We study a multi-agent output regulation problem, where not all agents have access to the exosystem’s dynamics. We propose a distributed controller that solves the problem for linear, heterogeneous, and uncertain agent dynamics as well as time-varying directed networks. The distributed controller consists of two parts: (1) an exosystem generator that creates a local copy of the exosystem dynami...

Time-varying graphs (T-graph) consist of a time-evolving set of graph snapshots (or graphlets). A T-graph property with potential applications in both computer and social network forensics is T-reachability, which identifies the nodes reachable from a source node using the T-graph edges over time period T. In this paper, we consider the problem of estimating the T-reachable set of a source node...

in this study, a robust controller is designed for fuzzy network control systems (ncss) using the static output feedback. delay and data packet dropout affect on the stability of network control systems, and therefore, the asymptotic stability condition is established considering delay and data packet dropout. delay is time-varying while the lower and upper bounds for delay is defined, and the ...

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical...

Detecting communities using modularity maximization is an important operation in network analysis. As the size of the networks increase to petascales, it is important to design parallel algorithms to handle the large-scale data. In this paper we introduce a shared memory (OpenMP-based) implementation of the Louvain method, one of the most popular algorithms for maximizing modularity. We discuss...

In previous work [J. D. Skufca and E. Bollt, Mathematical Biosciences and Engineering, 1 (2004), pp. 347–359], empirical evidence indicated that a time-varying network could propagate sufficient information to allow synchronization of the sometimes coupled oscillators, despite an instantaneously disconnected topology. We prove here that if the network of oscillators synchronizes for the static ...