English
Related papers

Related papers: Network Coding Capacity of Random Wireless Network…

200 papers

Previous work on network coding capacity for random wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a more realistic model, where wireless…

Information Theory · Computer Science 2008-11-11 Zhenning Kong , Salah A. Aly , Emina Soljanin , Edmund M. Yeh , Andreas Klappenecker

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

Real-time applications require latencies on the order of a millisecond with very high reliabilities, paralleling the requirements for high-performance industrial control. Current wireless technologies like WiFi, Bluetooth, LTE, etc. are…

Information Theory · Computer Science 2018-03-15 Vasuki Narasimha Swamy , Paul Rigge , Gireeja Ranade , Anant Sahai , Borivoje Nikolic

This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the…

Networking and Internet Architecture · Computer Science 2015-03-17 Petteri Mannersalo , Georgios S. Paschos , Lazaros Gkatzikis

We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work…

Information Theory · Computer Science 2007-11-27 Andrea Montanari , Ruediger Urbanke

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

Wireless Sensor Networks have some well known features such as low battery consumption, changing topology awareness, open environment, non reliable radio links, etc.In this paper, we investigate the benefits of Network Coding Wireless…

Networking and Internet Architecture · Computer Science 2014-12-09 Pierre Brunisholz , Marine Minier , Fabrice Valois

The rate optimization for wireless networks with low SNR is investigated. While the capacity in the limit of disappearing SNR is known to be linear for fading and non-fading channels, we study the problem of operating in low SNR wireless…

Information Theory · Computer Science 2010-08-03 Mohit Thakur , Muriel Médard

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes performing network coding can decode the messages from sources…

Information Theory · Computer Science 2007-07-13 Sichao Yang , Ralf Koetter

One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire…

Information Theory · Computer Science 2017-04-18 Alireza Vahid , Vaneet Aggarwal , A. Salman Avestimehr , Ashutosh Sabharwal

It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general…

Information Theory · Computer Science 2012-10-09 Yuan Li

Reliably transmitting messages despite information loss due to a noisy channel is a core problem of information theory. One of the most important aspects of real world communication, e.g. via wifi, is that it may happen at varying levels of…

Machine Learning · Computer Science 2020-04-02 Karen Ullrich , Fabio Viola , Danilo Jimenez Rezende

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…

Information Theory · Computer Science 2022-05-31 Allison Beemer , Altan Berdan Kilic , Alberto Ravagnani

In this paper, we investigate the impact of network coding at the relay node on the stable throughput rate in multicasting cooperative wireless networks. The proposed protocol adopts Network-level cooperation in contrast to the traditional…

Information Theory · Computer Science 2010-09-01 Anthony Fanous , Anthony Ephremides

We address the problem of optimizing the throughput of network coded traffic in mobile networks operating in challenging environments where connectivity is intermittent and locally available memory space is limited. Random linear network…

Information Theory · Computer Science 2011-04-19 Gabriel Popa

When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted…

Information Theory · Computer Science 2011-03-01 Bobak Nazer , Michael Gastpar

It has been recently brought into spotlight that through the exploitation of network coding concepts at physical-layer, the interference property of the wireless media can be proven to be a blessing in disguise. Nonetheless, most of the…

Networking and Internet Architecture · Computer Science 2010-09-21 M. Amin Rahimian , Ali Ayremlou , Farokh Marvasti
‹ Prev 1 2 3 10 Next ›