English
Related papers

Related papers: Improved Combinatorial Algorithms for Wireless Inf…

200 papers

A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel…

Data Structures and Algorithms · Computer Science 2009-09-29 Javad Ebrahimi , Christina Fragouli

The deterministic channel model for wireless relay networks proposed by Avestimehr, Diggavi and Tse `07 has captured the broadcast and inference nature of wireless communications and has been widely used in approximating the capacity of…

Information Theory · Computer Science 2009-10-01 Cuizhu Shi , Aditya Ramamoorthy

The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT…

Information Theory · Computer Science 2011-05-09 MinJi Kim , Elona Erez , Edmund M. Yeh , Muriel Medard

In the last few years the so--called "linear deterministic" model of relay channels has gained popularity as a means of studying the flow of information over wireless communication networks, and this approach generalizes the model of…

Information Theory · Computer Science 2009-04-17 S. M. Sadegh Tabatabaei Yazdi , Serap A. Savari

We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact…

Information Theory · Computer Science 2007-10-23 A. S. Avestimehr , S. N. Diggavi , D. N. C. Tse

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 a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow achievable? We make progress on this long standing problem through a two-step approach.…

Information Theory · Computer Science 2016-11-18 Salman Avestimehr , Suhas Diggavi , David Tse

We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on…

Physics and Society · Physics 2009-11-13 Yong Yu , Bogdan Danila , John A. Marsh , Kevin E. Bassler

The deterministic wireless relay network model, introduced by Avestimehr et al., has been proposed for approximating Gaussian relay networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless…

Information Theory · Computer Science 2010-06-16 MinJi Kim , Muriel Medard

This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…

Networking and Internet Architecture · Computer Science 2012-01-20 Jung Ryu

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

This paper proposes a dynamic primal-dual type algorithm to solve the optimal scheduling problem in wireless networks subject to uncertain parameters, which are generated by stochastic network processes such as random packet arrivals,…

Information Theory · Computer Science 2010-06-15 Qiao Li , Rohit Negi

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Information Theory · Computer Science 2011-12-05 Qiao Li , Rohit Negi

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-19 Tomasz Jurdzinski , Dariusz R. Kowalski , Grzegorz Stachowiak

A classical result in undirected wireline networks is the near optimality of routing (flow) for multiple-unicast traffic (multiple sources communicating independent messages to multiple destinations): the min cut upper bound is within a…

Information Theory · Computer Science 2011-11-22 Sreeram Kannan , Pramod Viswanath

We present a unified analytical framework within which power control, rate allocation, routing, and congestion control for wireless networks can be optimized in a coherent and integrated manner. We consider a multi-commodity flow model with…

Networking and Internet Architecture · Computer Science 2007-09-18 Yufang Xi , Edmund M. Yeh

In a wireless network, the efficiency of scheduling algorithms over time-varying channels depends heavily on the accuracy of the Channel State Information (CSI), which is usually quite ``costly'' in terms of consuming network resources.…

Networking and Internet Architecture · Computer Science 2014-04-01 Wenzhuo Ouyang , Atilla Eryilmaz , Ness B. Shroff

This paper presents a set of new results directly exploring the special characteristics of the wireless channel capacity process. An appealing finding is that, for typical fading channels, their instantaneous capacity and cumulative…

Information Theory · Computer Science 2017-05-11 Fengyou Sun , Yuming Jiang

In this report we propose a MultiObjective (MO) performance evaluation framework for wireless ad hoc networks where criteria such as capacity, robustness, energy and delay are optimized concurrently. Within such a framework, we can…

Networking and Internet Architecture · Computer Science 2010-09-16 Katia Jaffres-Runser , Jean-Marie Gorce , Cristina Comaniciu

This paper proposes computationally efficient algorithms to maximize the energy efficiency in multi-carrier wireless interference networks, by a suitable allocation of the system radio resources, namely the transmit powers and subcarrier…

Networking and Internet Architecture · Computer Science 2018-03-02 Salvatore D'Oro , Alessio Zappone , Sergio Palazzo , Marco Lops
‹ Prev 1 2 3 10 Next ›