Related papers: Multi-Broadcasting under the SINR Model
Future communication systems employing massive multiple input multiple output will not have the ability to use channel state information at the mobile user terminals. Instead, it will be necessary for such devices to evaluate the downlink…
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some…
The meta distribution of the signal-to-interference-plus-noise ratio (SINR) provides fine-grained information about each link's performance in a wireless system and the reliability of the whole network. While the UAV-enabled network has…
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 consider a problem of robotic router placement and mobility control with the objective of formation and maintenance of an optimal communication network between a set of transmitter-receiver pairs. In this scenario, the communication path…
Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting,…
In a wireless system with a large number of distributed nodes, the quality of communication can be greatly improved by pooling the nodes to perform joint transmission/reception. In this paper, we consider the problem of optimally selecting…
This paper considers several linear beamformer design paradigms for multiuser time-invariant multiple-input multiple-output interference channels. Notably, interference alignment and sum-rate based algorithms such as the maximum…
We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all these rumors in the designated target node. The ad-hoc…
We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\Theta(n)$ such that, the…
The deployment of unmanned aerial vehicle (UAV) for surveillance and monitoring gives rise to the confidential information leakage challenge in both civilian and military environments. The security and covert communication problems for a…
Multicasting is a fundamental networking primitive utilized by numerous applications. This also holds true for cognitive radio networks (CRNs) which have been proposed as a solution to the problems that emanate from the static non-adaptive…
In this paper, we consider a network of processors aiming at cooperatively solving mixed-integer convex programs subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
We consider distributed channel access in multi-hop cognitive radio networks. Previous works on opportunistic channel access using multi-armed bandits (MAB) mainly focus on single-hop networks that assume complete conflicts among all…
We study gossip algorithms for the fundamental rumor spreading problem, where the goal is to disseminate a rumor from a given source node to all nodes in an arbitrary (and unknown) graph. Gossip algorithms allow each node to call only one…
The congested clique is a synchronous, message-passing model of distributed computing in which each computational unit (node) in each round can send message of O(log n) bits to each other node of the network, where n is the number of nodes.…
We study how to spread $k$ tokens of information to every node on an $n$-node dynamic network, the edges of which are changing at each round. This basic {\em gossip problem} can be completed in $O(n + k)$ rounds in any static network, and…
We show NP-hardness of the minimum latency scheduling (MLS) problem under the physical model of wireless networking. In this model a transmission is received successfully if the Signal to Interference-plus-Noise Ratio (SINR), is above a…
This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…
Infrastructure-less Multi-hop Wireless Networks are the backbone for mission critical communications such as in disaster and battlefield scenarios. However, interference signals in the wireless channel cause losses to transmission in…