Related papers: Information Freshness in Dynamic Gossip Networks
Researchers have proposed a variety of Internet topology models. However almost all of them focus on generating one graph based on one single static source graph. On the other hand, Internet topology is evolving over time continuously with…
Network properties govern the rate and extent of various spreading processes, from simple contagions to complex cascades. Recently, the analysis of spreading processes has been extended from static networks to temporal networks, where nodes…
The influence of node mobility on the convergence time of averaging gossip algorithms in networks is studied. It is shown that a small number of fully mobile nodes can yield a significant decrease in convergence time. A method is developed…
This paper estimates the freshness of the information in a wireless relay communication system that employs simultaneous wireless information and power transfer (SWIPT) operating under ultra-reliable low-latency communication (URLLC)…
Age of information (AoI) is a recently proposed metric for quantifying data freshness in real-time status monitoring systems where timeliness is of importance. In this paper, we explore the data freshness in the Hyperledger Fabric…
We consider the age of information in a multihop multicast network where there is a single source node sending time-sensitive updates to $n^L$ end nodes, and $L$ denotes the number of hops. In the first hop, the source node sends updates to…
We live in a world increasingly dominated by networks -- communications, social, information, biological etc. A central attribute of many of these networks is that they are dynamic, that is, they exhibit structural changes over time. While…
Information diffusion models typically assume a discrete timeline in which an information token spreads in the network. Since users in real-world networks vary significantly in their intensity and periods of activity, our objective in this…
In this paper, we propose a general analytical framework for information spreading in mobile networks based on a new performance metric, mobile conductance, which allows us to separate the details of mobility models from the study of mobile…
Dynamic processes in complex networks are crucial for better understanding collective behavior in human societies, biological systems, and the internet. In this paper, we first focus on the continuous Markov-based modeling of evolving…
Content dissemination networks are pervasive in todays Internet. Examples of content dissemination networks include peer-to-peer networks (P2P), content distribution networks (CDN) and information centric networks (ICN). In this paper, we…
Age of information (AoI) is a time-evolving measure of information freshness, that tracks the time since the last received fresh update was generated. Analyzing peak and average AoI, two time average metrics of AoI, for various continuous…
While age of Information (AoI) has gained importance as a metric characterizing the fresh-ness of information in information-update systems and time-critical applications, most previous studies on AoI have been theoretical. In this chapter,…
In previous work, 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…
In this paper, we present a detailed framework to analyze the evolution of the random topology of a time-varying wireless network via the information theoretic notion of entropy rate. We consider a propagation channel varying over time with…
Information diffusion in online social networks is affected by the underlying network topology, but it also has the power to change it. Online users are constantly creating new links when exposed to new information sources, and in turn…
The topology of social networks can be understood as being inherently dynamic, with edges having a distinct position in time. Most characterizations of dynamic networks discretize time by converting temporal information into a sequence of…
We show that a simple model for the propagation of a rumor on a small-world network exhibits critical behavior at a finite randomness of the underlying graph. The transition occurs between a regime where the rumor "dies" in a small…
Gossip algorithms are widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social networks. A tremendous research effort has been devoted to…
We introduce the generalized rumor spreading model and investigate some properties of this model on different complex social networks. Despite pervious rumor models that both the spreader-spreader ($SS$) and the spreader-stifler ($SR$)…