English
Related papers

Related papers: Product Multicommodity Flow in Wireless Networks

200 papers

In a multihop wireless network, wireless interference is crucial to the maximum multiflow (MMF) problem, which studies the maximum throughput between multiple pairs of sources and sinks. In this paper, we observe that network coding could…

Information Theory · Computer Science 2012-02-15 Jin-Yi Zhou , Shu-Tao Xia , Yong Jiang , Hai-Tao Zheng

We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof…

Information Theory · Computer Science 2007-07-13 Christina Peraki , Sergio D. Servetto

The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-design problem: given a…

Data Structures and Algorithms · Computer Science 2015-06-02 Samir Khuller , Balaji Raghavachari , Neal E. Young

This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…

Optimization and Control · Mathematics 2025-08-26 Pengfei Liu

Towards the development of 6G mobile networks, it is promising to integrate a large number of devices from multi-dimensional platforms, and it is crucial to have a solid understanding of the theoretical limits of large-scale networks. We…

Information Theory · Computer Science 2025-09-19 Yanxiao Liu , Shenghao Yang , Cheuk Ting Li

Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem -- the all-or-nothing multicommodity flow (ANF) problem -- in arbitrary directed graphs and in the…

Data Structures and Algorithms · Computer Science 2022-07-27 Anya Chaturvedi , Chandra Chekuri , Mengxue Liu , Andréa W. Richa , Mattias Rost , Stefan Schmid , Jamison Weber

This paper investigates the problem of Gaussian approximation for the wireless multi-access interference distribution in large spatial wireless networks. First, a principled methodology is presented to establish rates of convergence of the…

Probability · Mathematics 2015-06-04 Hazer Inaltekin

We consider multicommodity flow and cut problems in {\em polymatroidal} networks where there are submodular capacity constraints on the edges incident to a node. Polymatroidal networks were introduced by Lawler and Martel and Hassin in the…

Data Structures and Algorithms · Computer Science 2011-11-01 Chandra Chekuri , Sreeram Kannan , Adnan Raja , Pramod Viswanath

Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service (QoS) requirements can be satisfied. We…

Information Theory · Computer Science 2015-12-11 Ashwin Ganesan

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

Information Theory · Computer Science 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of $n$. In the network, we…

Information Theory · Computer Science 2010-05-10 Won-Yong Shin , Daniel E. Lucani , Muriel Medard , Milica Stojanovic , Vahid Tarokh

Different aspects of probabilistic shaping for a multi-span optical communication system are studied. First, a numerical analysis of the additive white Gaussian noise (AWGN) channel investigates the effect of using a small number of input…

Information Theory · Computer Science 2016-07-29 Tobias Fehenberger , Alex Alvarado , Georg Böcherer , Norbert Hanik

In this paper, the statistical properties of the product of independent and non-identically distributed mixture Gamma (MG) random variables (RVs) are provided first. Specifically, simple exact closed-form expressions for the probability…

Information Theory · Computer Science 2023-03-07 Hussien Al-Hmood , Rafed Sabbar Abbas , H. S. Al-Raweshidy

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 consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the…

Networking and Internet Architecture · Computer Science 2018-11-27 Ashok Krishnan K. S. , Vinod Sharma

The recently standardized millimeter wave-based 3GPP New Radio technology is expected to become an enabler for both enhanced Mobile Broadband (eMBB) and ultra-reliable low latency communication (URLLC) services specified to future 5G…

Networking and Internet Architecture · Computer Science 2019-08-26 Roman Kovalchukov , Dmitri Moltchanov , Yuliya Gaidamaka , Ekaterina Bobrikova

The millimeter wave (mmWave) band has the potential to provide high throughput among wearable devices. When mmWave wearable networks are used in crowded environments, such as on a bus or train, antenna directivity and orientation hold the…

Information Theory · Computer Science 2015-12-03 Kiran Venugopal , Matthew C. Valenti , Robert W. Heath

Interference Alignment is a new solution to over- come the problem of interference in multiuser wireless com- munication systems. Recently, the Compute-and-Forward (CF) transform has been proposed to approximate the capacity of K- user…

Information Theory · Computer Science 2014-10-09 Ehsan Ebrahimi Khaleghi , Jean-Claude Belfiore

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

This is Part I of a two-part paper series that studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. The contributions of Part I…

Networking and Internet Architecture · Computer Science 2008-02-22 Soung Chang Liew , Ying Jun Zhang
‹ Prev 1 2 3 10 Next ›