English
Related papers

Related papers: Wireless Erasure Networks with Feedback

200 papers

Wirelessly powered communications will entail short packets due to naturally small payloads, low-latency requirements and/or insufficient energy resources to support longer transmissions. In this paper, a wirelessly powered communication…

Information Theory · Computer Science 2016-11-03 Talha Ahmed Khan , Robert W. Heath , Petar Popovski

This work considers a system with two energy harvesting (EH) nodes transmitting to a common destination over a random access channel. The amount of harvested energy is assumed to be random and independent over time, but correlated among the…

Performance · Computer Science 2019-02-14 Mehdi Salehi Heydar Abad , Deniz Gunduz , Ozgur Ercetin

This paper analyzes the communication between two energy harvesting wireless sensor nodes. The nodes use automatic repeat request and forward error correction mechanism for the error control. The random nature of available energy and…

Information Theory · Computer Science 2017-10-26 Animesh Yadav , Mathew Goonewardena , Wessam Ajib , Octavia A. Dobre , Halima Elbiaze

Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves…

Networking and Internet Architecture · Computer Science 2020-08-05 Thomas Stahlbuhk , Brooke Shrader , Eytan Modiano

In this paper, we propose to exploit the limited cache packets as side information to cancel incoming interference at the receiver side. We consider a stochastic network where the random locations of base stations and users are modeled…

Information Theory · Computer Science 2016-11-15 Chenchen Yang , Yao Yao , Bin Xia , Kaibin Huang , Weiliang Xie , Yong Zhao

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

This paper investigates low-latency streaming codes for a three-node relay network. The source transmits a sequence of messages (streaming messages) to the destination through the relay between them, where the first-hop channel from the…

Information Theory · Computer Science 2022-03-14 Silas L. Fong , Ashish Khisti , Baochun Li , Wai-Tian Tan , Xiaoqing Zhu , John Apostolopoulos

The freshness of real-time status processing of time-sensitive information is crucial for several applications, including healthcare monitoring and autonomous vehicles. This freshness is considered in this paper for the system where…

Networking and Internet Architecture · Computer Science 2022-10-04 Chanikarn Nikunram , Wasin Meesena , Stephen John Turner , Sucha Supittayapornpong

The linear deterministic model has been used recently to get a first order understanding of many wireless communication network problems. In many of these cases, it has been pointed out that the capacity regions of the network and its…

Information Theory · Computer Science 2009-07-10 Adnan Raja , Vinod M. Prabhakaran , Pramod Viswanath

We consider a data aggregating wireless network where all nodes have data to send to a single destination node, the sink. We consider a linear placement of nodes with the sink at one end. The nodes communicate directly to the sink (single…

Networking and Internet Architecture · Computer Science 2013-02-14 Easwar Vivek Mangipudi , Venkatesh Ramaiyan , Srikrishna Bhashyam

The communication channels used to convey information between the components of wireless networked control systems (WNCSs) are subject to packet losses due to time-varying fading and interference. We consider a wireless networked control…

Optimization and Control · Mathematics 2021-03-23 Anastasia Impicciatore , Yuriy Zacchia Lun , Pierdomenico Pepe , Alessandro D'Innocenzo

We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers' requests. We mostly focus on packet-erasure broadcast networks with two…

Information Theory · Computer Science 2016-05-10 Shirin Saeedi Bidokhti , Michèle Wigger , Roy Timo

We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the…

Information Theory · Computer Science 2016-05-09 Peida Tian , Sidharth Jaggi , Mayank Bakshi , Oliver Kosut

We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio…

Information Theory · Computer Science 2011-08-19 Jasper Goseling , Ruytaroh Matsumoto , Tomohiko Uyematsu , Jos H. Weber

We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…

Information Theory · Computer Science 2009-03-26 Daniel E. Lucani , Muriel Médard , Milica Stojanovic

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…

Information Theory · Computer Science 2015-06-25 Michael Heindlmaier , Shirin Saeedi Bidokhti

Wireless power transfer (WPT) is a viable source of energy for wirelessly powered communication networks (WPCNs). In this paper, we first consider WPT from an energy access point (E-AP) to multiple energy receivers (E-Rs) to obtain the…

Information Theory · Computer Science 2019-09-18 Roohollah Rezaei , Naeimeh Omidvar , Mohammad Movahednasab , Mohammad Reza Pakravan , Sumei Sun , Yong Liang Guan

Batched network coding is a low-complexity network coding solution to feedbackless multi-hop wireless packet network transmission with packet loss. The data to be transmitted is encoded into batches where each of which consists of a few…

Information Theory · Computer Science 2022-05-10 Jie Wang , Zhiyuan Jia , Hoover H. F. Yin , Shenghao Yang

Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and networks where not only the source but also a single relay node…

Information Theory · Computer Science 2016-11-15 Tobias Lutz , Christoph Hausl , Ralf Kötter

A restricted two-way communication problem in a small fully-connected network is investigated. The network consists of three nodes, all having access to a common channel with half-duplex constraint. Two nodes want to establish a dialog…

Information Theory · Computer Science 2014-09-05 Manuel Stein
‹ Prev 1 4 5 6 7 8 10 Next ›