English
Related papers

Related papers: Probabilistic Analysis of Power Assignments

200 papers

Full exploitation of the bandwidth resources of Wireless Networks is challenging because of the sharing of the radio medium among neighboring nodes. Practical algorithms and distributed schemes that tries to optimising the use of the…

Networking and Internet Architecture · Computer Science 2009-04-09 Raffaele Bruno , Vania Conan , Stephane Rousseau

Designing energy-efficient all-to-all multicasting protocols is of of great importance for multi-hop wireless networks such as wireless sensor networks and wireless ad hoc networks. In an all-to-all multicast session, there exists a set of…

Networking and Internet Architecture · Computer Science 2012-02-13 Kai Han , Yang Liu , Jun Luo

Utility-based power allocation in wireless ad-hoc networks is inherently nonconvex because of the global coupling induced by the co-channel interference. To tackle this challenge, we first show that the globally optimal point lies on the…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Lei Yang , Yalin E. Sagduyu , Junshan Zhang , Jason H. Li

In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear wireless network) for broadcasting data from one specific node to all the nodes in the network with minimum energy. Our goal is…

Networking and Internet Architecture · Computer Science 2012-04-19 Mohammad R. Ataei , Amir H. Banihashemi , Thomas Kunz

This paper considers a general stochastic resource allocation problem that arises widely in wireless networks, cognitive radio, networks, smart-grid communications, and cross-layer design. The problem formulation involves expectations with…

Optimization and Control · Mathematics 2017-12-12 Amrit Singh Bedi , Ketan Rajawat

We introduce a new structure for a set of points in the plane and an angle $\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \alpha \le…

Computational Geometry · Computer Science 2014-02-26 Rom Aschner , Matthew J. Katz

In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power…

Data Structures and Algorithms · Computer Science 2012-05-17 Fabrizio Grandoni

We investigate in this paper the optimal power allocation in an OFDM-SDMA system when some users have minimum downlink transmission rate requirements. We first solve the unconstrained power allocation problem for which we propose a fast…

Information Theory · Computer Science 2014-11-04 Diego Perea-Vega , Andre Girard , Jean-Francois Frigon

We consider power allocation for an access-controlled transmitter with energy harvesting capability based on causal observations of the channel fading state. We assume that the system operates in a time-slotted fashion and the channel gain…

Information Theory · Computer Science 2017-08-04 Zhe Wang , Vaneet Aggarwal , Xiaodong Wang

An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a…

Information Theory · Computer Science 2009-10-10 V. Kurlin , L. Mihaylova

Bounded-angle (minimum) spanning trees were first introduced in the context of wireless networks with directional antennas. They are reminiscent of bounded-degree spanning trees, which have received significant attention. Let $P =…

Computational Geometry · Computer Science 2020-10-23 Stav Ashur , Matthew J. Katz

We study the NP-hard problem of approximating a Minimum Routing Cost Spanning Tree in the message passing model with limited bandwidth (CONGEST model). In this problem one tries to find a spanning tree of a graph $G$ over $n$ nodes that…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-06-06 Alexandra Hochuli , Stephan Holzer , Roger Wattenhofer

The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…

Data Structures and Algorithms · Computer Science 2023-08-24 Swati Gupta , Ali Khodabakhsh , Hassan Mortagy , Evdokia Nikolova

As Internet of Things (IoT) devices proliferate, sustainable methods for powering them are becoming indispensable. The wireless provision of power enables battery-free operation and is crucial for complying with weight and size…

Information Theory · Computer Science 2024-06-04 Kenneth M. Mayer , Laura Cottatellucci , Robert Schober

This paper presents a heuristic method for simplifying resource allocation in access systems, leveraging the concept of comparative advantage to reduce computational complexity while maintaining near-optimal performance. Using…

Signal Processing · Electrical Eng. & Systems 2025-08-05 Lin Cheng , Bernardo A. Huberman

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

This paper addresses the optimal design of wireless networks through the site and power assignment problem. Given a set of candidate transmitters, this problem involves choosing optimal transmitter locations and powers to provide service…

Discrete Mathematics · Computer Science 2023-11-28 Pasquale Avella , Alice Calamita , Laura Palagi

In this paper, we consider a full duplex wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point. An optimization framework is proposed…

Information Theory · Computer Science 2019-10-30 Muhammad Shahid Iqbal , Yalcin Sadi , Sinem Coleri

We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless networks where a transmission is successful only if the…

Data Structures and Algorithms · Computer Science 2010-11-23 Eyjólfur Ingi Ásgeirsson , Pradipta Mitra

In this letter, we study the performance of a wireless power transfer system under energy harvesting distribution uncertainty. The uncertainty captures practical nonidealities of the rectification process and is modelled as the maximum…

Information Theory · Computer Science 2020-06-02 Ioannis Krikidis