相关论文: Not Always Sparse: Flooding Time in Partially Conn…

In this paper, our recently proposed mobile-conductance based analytical framework is extended to the sparse settings, thus offering a unified tool for analyzing information spreading in mobile networks. A penalty factor is identified for…

Throughput and energy efficiency in fading channels are studied in the presence of randomly arriving data and statistical queueing constraints. In particular, Markovian arrival models including discrete-time Markov, Markov fluid, and…

In this work we introduce Dynamic Random Geometric Graphs as a basic rough model for mobile wireless sensor networks, where communication distances are set to the known threshold for connectivity of static random geometric graphs. We…

This paper proposes efficient multiple-access schemes for large wireless networks based on the transmitters' buffer state information and their transceivers' duplex transmission capability. First, we investigate the case of half-duplex…

Previous work on ad hoc network capacity has focused primarily on source-destination throughput requirements for different models and transmission scenarios, with an emphasis on delay tolerant applications. In such problems, network…

Sheared incompressible flows are usually considered non-dispersive media. As a consequence, the frequency evolution in transients has received much less attention than the wave energy density or growth factor. By carrying out a large number…

While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvious counterpart in time-varying ones. In this paper, we…

The study of temporal networks in discrete time has yielded numerous insights into time-dependent networked systems in a wide variety of applications. For many complex systems, however, it is useful to develop continuous-time models of…

In practice, wireless networks are deployed over finite domains, the level of mobility is different at different locations, and user mobility is correlated over time. All these features have an impact on the temporal properties of…

We consider a hybrid spatial communication system in which mobile nodes can connect to static sinks in a bounded number of intermediate relaying hops. We describe the distribution of the connection intervals of a typical mobile node, i.e.,…

Coastal flooding poses increasing threats to communities worldwide, necessitating accurate and hyper-local inundation forecasting for effective emergency response. However, real-world deployment of forecasting systems is often constrained…

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example…

In dynamic graphs, edges may be added or deleted in each synchronous round. Various connectivity models exist based on constraints on these changes. One well-known model is the $T$-Interval Connectivity model, where the graph remains…

As a representative of a complex technological system, so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a…

Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…

Most work on wireless network throughput ignores the temporal correlation inherent to wireless channels because it degrades tractability. To better model and quantify the temporal variations of wireless network throughput, this paper…

Many processes of spreading and diffusion take place on temporal networks, and their outcomes are influenced by correlations in the times of contact. These correlations have a particularly strong influence on processes where the spreading…

We establish mean-field limits for large-scale random-access networks with buffer dynamics and arbitrary interference graphs. While saturated-buffer scenarios have been widely investigated and yield useful throughput estimates for…

We study in this paper, the first passage percolation on a random graph model, the configuration model. We first introduce, the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two…

We study the information spreading yielded by the \emph{(Parsimonious) $1$-Flooding Protocol} in geometric Mobile Ad-Hoc Networks. We consider $n$ agents on a convex plane region of diameter $D$ performing independent random walks with move…