English
Related papers

Related papers: Wireless Network Information Flow: A Deterministic…

200 papers

In this paper, we present a detailed framework to analyze the evolution of the random topology of a time-varying wireless network via the information theoretic notion of entropy rate. We consider a propagation channel varying over time with…

Information Theory · Computer Science 2018-11-08 Arta Cika , Mihai-Alin Badiu , Justin P. Coon , Shahriar Etemadi Tajbakhsh

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

The present paper focuses on the problem of broadcasting information in the most efficient manner in a large two-dimensional ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed,…

Information Theory · Computer Science 2016-11-18 Serj Haddad , Olivier Leveque

We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…

Information Theory · Computer Science 2017-09-25 Sandra Bender , Meik Dörpinghaus , Gerhard Fettweis

Unpredictable nature of fading channels and difficulty in tracking channel state information pose major challenge in wireless energy harvesting communication system design. In this work, we address relay selection problem for wireless…

Networking and Internet Architecture · Computer Science 2020-02-27 M. Majid Butt , Galymzhan Nauryzbayev , Nicola Marchetti

In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on…

Networking and Internet Architecture · Computer Science 2016-03-29 Manolis Ploumidis , Nikolaos Pappas , Apostolos Traganitis

This paper investigates two strategies to reduce the communication delay in future wireless networks: traffic dispersion and network densification. A hybrid scheme that combines these two strategies is also considered. The probabilistic…

Networking and Internet Architecture · Computer Science 2018-03-15 Guang Yang , Ming Xiao , H. Vincent Poor

We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain by using only…

Information Theory · Computer Science 2012-11-16 Caner Nazaroglu , Ayfer Ozgur , Christina Fragouli

We consider a wireless network composed of three nodes and limited by the half-duplex and total power constraints. This formulation encompasses many of the special cases studied in the literature and allows for capturing the common features…

Information Theory · Computer Science 2007-07-13 Lifeng Lai , Ke Liu , Hesham El Gamal

We consider the Gaussian "diamond" or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical…

Information Theory · Computer Science 2016-11-18 Urs Niesen , Suhas Diggavi

With the fast development of wireless technologies, wireless applications have invaded various areas in people's lives with a wide range of capabilities. Guaranteeing Quality-of-Service (QoS) is the key to the success of those applications.…

Networking and Internet Architecture · Computer Science 2016-06-20 Xu Zheng , Zhipeng Cai , Jianzhong Li , Hong Gao

We examine the extent to which Gaussian relay networks can be approximated by deterministic networks, and present two results, one negative and one positive. The gap between the capacities of a Gaussian relay network and a corresponding…

Information Theory · Computer Science 2009-08-10 M. Anand , P. R. Kumar

This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay…

Information Theory · Computer Science 2011-10-25 Lei Zhou , Wei Yu

Simultaneous transmission of information and power over a point-to-point flat-fading complex Additive White Gaussian Noise (AWGN) channel is studied. In contrast with the literature that relies on an inaccurate linear model of the energy…

Information Theory · Computer Science 2017-06-01 Morteza Varasteh , Borzoo Rassouli , Bruno Clerckx

It has recently been recognized that the wireless networks represent a fertile ground for devising communication modes based on network coding. A particularly suitable application of the network coding arises for the two--way relay…

Information Theory · Computer Science 2007-07-13 Petar Popovski , Hiroyuki Yomo

It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission…

Information Theory · Computer Science 2016-11-17 Caleb K. Lo , Robert W. Heath, , Sriram Vishwanath

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

We formulate an optimization problem for maximizing the data rate of a common message transmitted from nodes within an airborne network broadcast to a central station receiver while maintaining a set of intra-network rate demands. Assuming…

Optimization and Control · Mathematics 2017-06-08 Theodoros Tsiligkaridis

Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel…

Information Theory · Computer Science 2016-11-17 Dong Zheng , Man-On Pun , Weiyan Ge , Junshan Zhang , H. Vincent Poor

We consider a slotted wireless network in an infrastructure setup with a base station (or an access point) and N users. The wireless channel gain between the base station and the users is assumed to be i.i.d., and the base station seeks to…

Information Theory · Computer Science 2013-08-01 Venkatesh Ramaiyan