Spreading processes represent a very efficient tool to investigate the structural properties of networks and the relative importance of their constituents, and have been widely used to this aim in static networks. Here we consider simple disease spreading processes on empirical time-varying networks of contacts between individuals, and compare the effect of several immunization strategies on th...

It has already been confirmed that the traffic in high-speed terrestrial network presents self-similarity, but there is little research on self-similarity of traffic in satellite network. Considering time-varying network topology and link status, this paper analyzes the aggregation and propagation of self-similar traffic between nodes in satellite network. Furthermore, a sort of special network...

We consider a wireless network consisting of multiple transmitters with multicast traffic destined for a set of receivers. We are interested in the problem of joint scheduling and rate control under two performance objectives; the objective of maximizing the total sum throughput of the network and of being proportionally fair with respect to the received rate at each receiver. We first consider...

Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...

To ensure that social networks (e.g. opinion consensus, cooperative estimation, distributed learning and adaptation etc.) proliferate and efficiently operate, the participating agents need to collaborate with each other by repeatedly sharing information. However, sharing information is often costly for the agents while resulting in no direct immediate benefit for them. Hence, lacking incentives...

There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques that are the cornerstones of static network flows. The aim of this paper is to advance the state of the art for dynamic network flows by developing the cont...

{ With the fast growing uses of GPS-equipments, mobile users can more easily determine where they are located. These physical location information may play an important role in a wireless ad hoc network formed by a collection of wireless mobile hosts, in the absence of any xed infrastructure. Performance overhead considerations are more important for ad hoc network environments because of the t...

Relational data—like graphs, networks, and matrices—is often dynamic, where the relational structure evolves over time. A fundamental problem in the analysis of time-varying network data is to extract a summary of the common structure and the dynamics of the underlying relations between the entities. Here we build on the intuition that changes in the network structure are driven by dynamics at ...