Related papers: Directed Percolation in Wireless Networks with Int…
In this work we address the question how important is the knowledge of geometric location and network density to the efficiency of (distributed) wireless communication in ad hoc networks. We study fundamental communication task of broadcast…
In this paper we evaluate distributed node coloring algorithms for wireless networks using the network simulator Sinalgo [by DCG@ETHZ]. All considered algorithms operate in the realistic signal-to-interference-and-noise-ratio (SINR) model…
We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordinate system in the plane, further they do not know their…
Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its…
A statistical characterization of the fundamental performance bounds of an intelligent reflective surface (IRS) intended for aiding wireless communications is presented. To this end, the outage probability, average symbol error probability,…
Efficient spectrum use in wireless sensor networks through spatial reuse requires effective models of packet reception at the physical layer in the presence of interference. Despite recent progress in analytic and simulations research into…
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the…
The SINR model for wireless networks has been extensively studied recently. It tries to model whether a particular transmitter is heard at a specific location, with $n$ transmitting simultaneously. The SINR diagram consists of $n$ regions…
We study a fundamental measure for wireless interference in the SINR model known as (weighted) inductive independence. This measure characterizes the effectiveness of using oblivious power --- when the power used by a transmitter only…
New schemes to recover signals defined in the nodes of a graph are proposed. Our focus is on reconstructing bandlimited graph signals, which are signals that admit a sparse representation in a frequency domain related to the structure of…
Percolation in complex networks is viewed as both: a process that mimics network degradation and a tool that reveals peculiarities of the underlying network structure. During the course of percolation, networks undergo non-trivial…
This paper focuses on the link scheduling problem in networks where signal delays between nodes are multiples of a time interval. To model such networks, a directed hypergraph is employed, along with an integer matrix that specifies the…
The percolation phase transition in complex network systems attracts much attention and has numerous applications in various research fields. Finite size effects smooth the transition and make it difficult to predict the critical point of…
We consider an intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) in which a multi antenna power beacon (PB) sends a dedicated energy signal to a wireless powered source. The source first harvests…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules.…
A fundamental aspect in performance engineering of wireless networks is optimizing the set of links that can be concurrently activated to meet given signal-to-interference-and-noise ratio (SINR) thresholds. The solution of this…
We investigate the secure connectivity of wireless sensor networks under a heterogeneous random key predistribution scheme and a heterogeneous channel model. In particular, we study a random graph formed by the intersection of an…
We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set…
Distributed power allocation is important for interference-limited wireless networks with dense transceiver pairs. In this paper, we aim to design low signaling overhead distributed power allocation schemes by using graph neural networks…