English
Related papers

Related papers: Wireless Connectivity and Capacity

200 papers

We explore the fundamental limits of distributed balls-into-bins algorithms. We present an adaptive symmetric algorithm that achieves a bin load of two in log* n+O(1) communication rounds using O(n) messages in total. Larger bin loads can…

Computational Complexity · Computer Science 2011-03-01 Christoph Lenzen , Roger Wattenhofer

The paper investigates a version of the resource allocation problem arising in the wireless networking, namely in the OVSF code reallocation process. In this setting a complete binary tree of a given height $n$ is considered, together with…

A fundamental problem in wireless networks is the \emph{minimum spanning tree} (MST) problem: given a set $V$ of wireless nodes, compute a spanning tree $T$, so that the total cost of $T$ is minimized. In recent years, there has been a lot…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-07 Maleq Khan , V. S. Anil Kumar , Gopal Pandurangan , Guanhong Pei

The $CONGEST$ model for distributed network computing is well suited for analyzing the impact of limiting the throughput of a network on its capacity to solve tasks efficiently. For many "global" problems there exists a lower bound of…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-04-21 Dennis Olivetti

We consider a fundamental problem concerning the deployment of a wireless robotic network: to fulfill various end-to-end performance requirements, a "sufficient" number of robotic relays must be deployed to ensure that links are of…

Robotics · Computer Science 2016-11-28 Pradipta Ghosh , Bhaskar Krishnamachari

We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $\lambda$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter. Our…

Data Structures and Algorithms · Computer Science 2014-08-05 Danupon Nanongkai , Hsin-Hao Su

Given a set ${\cal V}$ of $n$ sensor node distributed on a 2-dimensional plane and a source node $s \in {\cal V}$, the {\it interference problem} deals with assigning transmission range to each $v \in {\cal V}$ such that the members in…

Networking and Internet Architecture · Computer Science 2012-07-25 Pragya Agrawal , Gautam K. Das

We study the wake-up problem in distributed networks, where an adversary awakens a subset of nodes at arbitrary times, and the goal is to wake up all other nodes as quickly as possible by sending only few messages. We prove the following…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-07-16 Peter Robinson , Ming Ming Tan

The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signal-to-interference & noise ratio (SINR) model. For a collection of simultaneously transmitting stations…

Networking and Internet Architecture · Computer Science 2008-12-10 Chen Avin , Yuval Emek , Erez Kantor , Zvi Lotker , David Peleg , Liam Roditty

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…

Information Theory · Computer Science 2015-03-19 Di Yuan , Vangelis Angelakis , Lei Chen , Eleftherios Karipidis , Erik G. Larsson

In this work, we investigate the capacity allocation problem in the energy harvesting wireless sensor networks (WSNs) with interference channel. For the fixed topologies of data and energy, we formulate the optimization problem when the…

Networking and Internet Architecture · Computer Science 2018-10-31 Dongbin Jiao , Liangjun Ke , Shengbo Liu , Felix T. S. Chan

In this paper the problem of scheduling with power control in wireless networks is studied: given a set of communication requests, one needs to assign the powers of the network nodes, and schedule the transmissions so that they can be done…

Networking and Internet Architecture · Computer Science 2015-05-20 Tigran Tonoyan

The $\hybrid$ model was recently introduced by Augustine et al. \cite{DBLP:conf/soda/AugustineHKSS20} in order to characterize from an algorithmic standpoint the capabilities of networks which combine multiple communication modes.…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-05 Ioannis Anagnostides , Themis Gouleakis

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…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-06-15 Bogdan S. Chlebus , Dariusz R. Kowalski , Shailesh Vaya

In this paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received power of a signal at a receiver against the sum of strengths…

Data Structures and Algorithms · Computer Science 2011-03-25 Erez Kantor , Zvi Lotker , Merav Parter , David Peleg

We address the problem of interference management and power control in terms of maximization of a general utility function. For the utility functions under consideration, we propose a power control algorithm based on a fixed-point…

Information Theory · Computer Science 2012-11-13 Ehsan Karamad , Raviraj Adve , Jerry Chow

We consider a topology control problem in which we are given a set of $n$ sensors in the plane and we would like to assign a communication radius to each of them. The radii assignment must generate a strongly connected network and have low…

Computational Geometry · Computer Science 2012-07-02 Matias Korman

Future smart factories are expected to deploy applications over high-performance indoor wireless channels in the millimeter-wave (mmWave) bands, which on the other hand are susceptible to high path losses and Line-of Sight (LoS) blockages.…

Networking and Internet Architecture · Computer Science 2025-11-21 Cao Vien Phung , Max Franke , Ehsan Tohidi , June Heinemann , Andre Drummond , Stefan Schmid , Slawomir Stanczak , Admela Jukan

An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and…

Networking and Internet Architecture · Computer Science 2018-06-29 Magnus M. Halldorsson , Tigran Tonoyan

In wireless networks, consisting of battery-powered devices, energy is a costly resource and most of it is spent on transmitting and receiving messages. Broadcast is a problem where a message needs to be transmitted from one node to all…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-15 Marek Klonowski , Dominik Pająk