English
Related papers

Related papers: Coding Improves the Throughput-Delay Trade-off in …

200 papers

Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a CAF scheme, a relay is designed to decode a linear combination composed of transmitted messages from other terminals…

Information Theory · Computer Science 2018-07-05 Satoshi Takabe , Tadashi Wadayama , Masahito Hayashi

In this paper, we study the performance of an amplify-and-forward (AF) based analog network coding (ANC) relay scheme in a multi-hop wireless network under individual power constraints. In the first part, a unicast scenario is considered.…

Information Theory · Computer Science 2012-03-23 Binyue Liu , Ning Cai

In this paper, we adopt a cross layer design approach for analyzing the throughput-delay tradeoff of the multicast channel in a single cell system. To illustrate the main ideas, we start with the single group case, i.e., pure multicast,…

Information Theory · Computer Science 2007-07-13 Praveen Kumar Gopala , Hesham El Gamal

We consider a communication system with multi-access fading channel. Each user in the system requires certain rate guarantee. Our main contribution is to devise a scheduling scheme called "Opportunistic Super-position Coding" that satisfies…

Information Theory · Computer Science 2009-11-24 Prasanna Chaporkar , Kimmo Kansanen , Ralf R. Müller

Achieving optimal transmission throughput in data networks in a multi-hop wireless networks is fundamental but hard problem. The situation is aggravated when nodes are mobile. Further, multi-rate system make the analysis of throughput more…

Networking and Internet Architecture · Computer Science 2010-09-24 Tapas Kumar Patra , Joy Kuri

The throughput benefits of random linear network codes have been studied extensively for wirelined and wireless erasure networks. It is often assumed that all nodes within a network perform coding operations. In energy-constrained systems,…

Networking and Internet Architecture · Computer Science 2012-06-05 Xiaomeng Shi , Muriel Medard , Daniel E. Lucani

In this paper, we consider CSMA policies for scheduling of multihop wireless networks with one-hop traffic. The main contribution of this paper is to propose Unlocking CSMA (U-CSMA) policy that enables to obtain high throughput with low…

Information Theory · Computer Science 2010-09-30 Mahdi Lotfinezhad , Peter Marbach

We are interested in unicast traffic over wireless networks that employ constructive inter-session network coding, including single-hop and multi-hop schemes. In this setting, TCP flows do not fully exploit the network coding opportunities…

Networking and Internet Architecture · Computer Science 2010-10-05 Hulya Seferoglu , Athina Markopoulou

This paper studies the outage probability and the throughput of amplify-and-forward relay networks with wireless information and energy transfer. We use some recent results on finite block-length codes to analyze the system performance in…

Information Theory · Computer Science 2016-11-21 Mahdi Haghifam , Behrooz Makki , Masoumeh Nasiri-Kenari , Tommy Svensson , Michele Zorzi

The 5G wireless network architecture will bring dense deployments of base stations called {\em small cells} for both outdoors and indoors traffic. The feasibility of their dense deployments depends on the existence of a high data-rate…

Information Theory · Computer Science 2015-08-04 Song-Nam Hong , Ivana Maric , Dennis Hui

To achieve the available performance gains in half-duplex wireless relay networks, several cooperative schemes have been earlier proposed using either distributed space-time coding or distributed beamforming for the transmitter without and…

Information Theory · Computer Science 2015-05-13 Javier M. Paredes , Babak H. Khalaj , Alex B. Gershman

In coded bi-directional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this paper, we derive performance bounds for this problem for each of three protocols. The first…

Information Theory · Computer Science 2008-06-05 Sang Joon Kim , Patrick Mitran , Vahid Tarokh

We introduce a gossip-like protocol for covert message passing between Alice and Bob as they move in an area watched over by a warden Willie. The area hosts a multitude of Internet of (Battlefield) Things (Io\b{eta}T) objects. Alice and Bob…

Information Theory · Computer Science 2021-12-23 Pei Peng , Emina Soljanin

Unlike traditional file transfer where only total delay matters, streaming applications impose delay constraints on each packet and require them to be in order. To achieve fast in-order packet decoding, we have to compromise on the…

Information Theory · Computer Science 2014-03-04 Gauri Joshi , Yuval Kochman , Gregory Wornell

Presented in this paper is the solution to the problem that arises when the TCP/IP protocol suite is used to provide Internet connectivity through mobile terminals over emerging 802.11 wireless links. Taking into consideration the strong…

Networking and Internet Architecture · Computer Science 2011-12-12 Purvang Dalal , Nikhil Kothari , K. S. Dasgupta

In "On Coding for Reliable Communication over Packet Networks" (Lun, Medard, and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy…

Information Theory · Computer Science 2007-07-16 Desmond S. Lun , Muriel Medard , Ralf Koetter , Michelle Effros

Relay selection enhances the performance of the cooperative networks by selecting the links with higher capacity. Meanwhile link adaptation improves the spectral efficiency of wireless data-centric networks through adapting the modulation…

Information Theory · Computer Science 2010-09-02 Wei Yang , Lihua Li , Gang Wu , Haifeng Wang

Signal-time coding, which combines the traditional encoding/modulation mode in the signal domain with signal pulse phase modulation in the time domain, was proposed to improve the information flow rate in relay networks. In this paper, we…

Information Theory · Computer Science 2009-07-13 Pingyi Fan , Pei Sun , Khaled Ben Letaief

Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the distance…

Information Theory · Computer Science 2007-07-13 Sundar Subramanian , Sanjay Shakkottai

We consider the transmission of packets across a lossy end-to-end network path so as to achieve low in-order delivery delay. This can be formulated as a decision problem, namely deciding whether the next packet to send should be an…

Networking and Internet Architecture · Computer Science 2018-12-17 Pablo Garrido , Douglas Leith , Ramon Aguero