English
Related papers

Related papers: On Capacity and Delay of Wireless Networks with No…

200 papers

We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore…

Information Theory · Computer Science 2009-10-22 Theodoros K. Dikaliotis , Alexandros G. Dimakis , Tracey Ho , Michelle Effros

In this paper, we analyze the delay performance of an ad-hoc dynamic network where random network coding and broadcast are used in combination to distribute the messages. The analysis is comprehensive for that we consider M-to-N broadcast…

Networking and Internet Architecture · Computer Science 2025-03-06 Zhaohong Lu , Haibo Zeng

Stochastic network calculus provides an elegant way to characterize traffic and service processes. However, little effort has been made on applying it to multi-access communication systems such as 802.11. In this paper, we take the first…

Performance · Computer Science 2010-04-20 Yue Wang

We investigate individual packet delay in a model of data networks with table-free, partial table and full table routing. We present analytical estimation for the average packet delay in a network with small partial routing table.…

Networking and Internet Architecture · Computer Science 2023-12-18 Henryk Fuks , Anna T. Lawniczak , Stanislav Volkov

In an unreliable single-hop broadcast network setting, we investigate the throughput and decoding-delay performance of random linear network coding as a function of the coding window size and the network size. Our model consists of a source…

Information Theory · Computer Science 2015-03-17 B. T. Swapna , Atilla Eryilmaz , Ness B. Shroff

We study the effects of nonzero time delays in stochastic synchronization problems with linear couplings in an arbitrary network. Using the known exact threshold value from the theory of differential equations with delays, we provide the…

Statistical Mechanics · Physics 2015-03-17 D. Hunt , G. Korniss , B. K. Szymanski

We study three capacity problems in the mobile telephone model, a network abstraction that models the peer-to-peer communication capabilities implemented in most commodity smartphone operating systems. The capacity of a network expresses…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-09 Michael Dinitz , Magnús M. Halldórsson , Calvin Newport , Alex Weaver

A crucial challenge in network theory is the study of the robustness of a network after facing a sequence of failures. In this work, we propose a dynamical definition of network's robustness based on Information Theory, that considers…

Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over…

Information Theory · Computer Science 2016-11-15 Joao Barros , Rui A. Costa , Daniele Munaretto , Joerg Widmer

Wireless mesh networks play a critical role in enabling key networking scenarios in beyond-5G (B5G) and 6G networks, including integrated access and backhaul (IAB), multi-hop sidelinks, and V2X. However, it still poses a challenge to…

Information Theory · Computer Science 2023-11-01 Lei Lei , Aimin Tang , Xudong Wang

Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this…

Information Theory · Computer Science 2015-03-19 Daniel Zahavi , Ron Dabora

A framework is developed for analyzing capacity gains from user cooperation in slow fading wireless networks when the number of nodes (network size) is large. The framework is illustrated for the case of a simple multipath-rich Rayleigh…

Information Theory · Computer Science 2009-09-29 Ashish Khisti , Uri Erez , Gregory Wornell

We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…

Networking and Internet Architecture · Computer Science 2013-10-24 Stavros Toumpis

This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary…

Information Theory · Computer Science 2019-02-04 Rahul Devassy , Giuseppe Durisi , Guido Carlo Ferrante , Osvaldo Simeone , Elif Uysal

Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of…

Information Theory · Computer Science 2008-11-11 Salah A. Aly , Vishal Kapoor , Jie Meng , Andreas Klappenecker

This paper investigates the throughput capacity of a flow crossing a multi-hop wireless network, whose geometry is characterized by general randomness laws including Uniform, Poisson, Heavy-Tailed distributions for both the nodes' densities…

Performance · Computer Science 2013-07-30 Florin Ciucu , Jens Schmitt

Joint network-channel codes (JNCC) can improve the performance of communication in wireless networks, by combining, at the physical layer, the channel codes and the network code as an overall error-correcting code. JNCC is increasingly…

Information Theory · Computer Science 2012-02-15 Dieter Duyck , Michael Heindlmaier , Daniele Capirone , Marc Moeneclaey

Network coding is a novel solution that significantly improve the throughput and energy consumed of wireless networks by mixing traffic flows through algebraic operations. In conventional network coding scheme, a packet has to wait for…

Information Theory · Computer Science 2014-01-27 Hongyi Zeng , Wei Chen

A network's transmission capacity is the maximal rate of traffic inflow that the network can handle without causing congestion. Here we study how to enhance this quantity by redistributing the capability of individual nodes while preserving…

Networking and Internet Architecture · Computer Science 2009-10-14 Guoqing Zhang , Shi Zhou , Di Wang , Gang Yan , Guoqiang Zhang

Studying the capacity of wireless multi-hop networks is an important problem and extensive research has been done in the area. In this letter, we sift through various capacity-impacting parameters and show that the capacity of both static…

Networking and Internet Architecture · Computer Science 2012-07-06 Guoqiang Mao