English
Related papers

Related papers: On a game theoretic approach to capacity maximizat…

200 papers

An overview of game-theoretic approaches to energy-efficient resource allocation in wireless networks is presented. Focusing on multiple-access networks, it is demonstrated that game theory can be used as an effective tool to study resource…

Information Theory · Computer Science 2016-11-18 Farhad Meshkati , H. Vincent Poor , Stuart C. Schwartz

The capacity of wireless networks is a classic and important topic of study. Informally, the capacity of a network is simply the total amount of information which it can transfer. In the context of models of wireless radio networks, this…

Computer Science and Game Theory · Computer Science 2019-09-16 Michael Dinitz , Naomi Ephraim

We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise…

Networking and Internet Architecture · Computer Science 2012-05-08 Thomas Kesselheim

The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a sender-receiver pair located in a…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnús Már Halldórsson , Pradipta Mitra

This paper presents a game theoretic solution for joint channel allocation and power control in cognitive radio networks analyzed under the physical interference model. The objective is to find a distributed solution that maximizes the…

Networking and Internet Architecture · Computer Science 2025-01-29 J. R. Gallego , M. Canales , J. Ortin

We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \emph{schedule}) the links into the minimum number of slots, each satisfying…

Data Structures and Algorithms · Computer Science 2014-05-02 Magnus M. Halldorsson , Pradipta Mitra

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…

Networking and Internet Architecture · Computer Science 2012-10-17 Magnus M. Halldorsson , Pradipta Mitra

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

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 2017-05-30 Magnus M. Halldorsson , Tigran Tonoyan

We consider capacity maximization in wireless networks under adversarial interference conditions. There are n links, each consisting of a sender and a receiver, which repeatedly try to perform a successful transmission. In each time step,…

Data Structures and Algorithms · Computer Science 2013-07-24 Johannes Dams , Martin Hoefer , Thomas Kesselheim

The problem of distributed rate maximization in multi-channel ALOHA networks is considered. First, we study the problem of constrained distributed rate maximization, where user rates are subject to total transmission probability…

Networking and Internet Architecture · Computer Science 2015-05-25 Kobi Cohen , Amir Leshem

We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new…

Data Structures and Algorithms · Computer Science 2012-01-20 Magnus M. Halldorsson , Pradipta Mitra

We consider wireless networks that can be modeled by multiple access channels in which all the terminals are equipped with multiple antennas. The propagation model used to account for the effects of transmit and receive antenna correlations…

Information Theory · Computer Science 2010-11-24 E. V. Belmega , S. Lasaulce , M. Debbah , M. Jungers , J. Dumont

We consider the distributed uplink resource allocation problem in a multi-carrier wireless network with multiple access points (APs). Each mobile user can optimize its own transmission rate by selecting a suitable AP and by controlling its…

Information Theory · Computer Science 2016-08-24 Mingyi Hong , Alfredo Garcia , Jorge Barrera , Stephen G. Wilson

We propose an algorithm which produces a randomized strategy reaching optimal data propagation in wireless sensor networks (WSN).In [6] and [8], an energy balanced solution is sought using an approximation algorithm. Our algorithm improves…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Pierre Leone , Olivier Powell , Jose Rolim

Given $n$ wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent links can be scheduled in fewest possible time slots,…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnus M. Halldorsson , Pradipta Mitra

The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless communication. We argue that the problem is best formulated in…

Networking and Internet Architecture · Computer Science 2007-05-23 Zygmunt Haas , Joseph Y. Halpern , Li Li , Stephen B. Wicker

Given a set of wireless links, a fundamental problem is to find the largest subset that can transmit simultaneously, within the SINR model of interference. Significant progress on this problem has been made in recent years. In this note, we…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnus M. Halldorsson , Pradipta Mitra

This work develops power control algorithms for energy efficiency (EE) maximization (measured in bit/Joule) in wireless networks. Unlike previous related works, minimum-rate constraints are imposed and the signal-to-interference-plus-noise…

Information Theory · Computer Science 2016-04-20 Alessio Zappone , Luca Sanguinetti , Giacomo Bacci , Eduard Jorswieck , Mérouane Debbah

This paper addresses the mobile assignment problem in a multi-cell broadcast transmission seeking minimal total power consumption by considering both transmission and operational powers. While the large scale nature of the problem entails…

Networking and Internet Architecture · Computer Science 2014-08-05 Cengis Hasan , Jean-Marie Gorce , Eitan Altman
‹ Prev 1 2 3 10 Next ›