English
Related papers

Related papers: Wireless Network Information Flow: A Deterministic…

200 papers

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

In this paper we consider wireless energy transfer for a point-to-point link. The energy transmitter sees a finite number of independent channel realizations, and, armed with (causal) knowledge of the channels, must decide how much energy…

Signal Processing · Electrical Eng. & Systems 2019-02-08 Amanthi Thudugalage , Saman Atapattu , Jamie Evans

The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…

Information Theory · Computer Science 2009-12-08 Amichai Sanderovich , Michael Peleg , Shlomo Shamai

In this paper, we present a consensus-based framework for decentralized estimation of deterministic parameters in wireless sensor networks (WSNs). In particular, we propose an optimization algorithm to design (possibly complex) sensor gains…

Systems and Control · Computer Science 2018-10-15 Shahin Khobahi , Mojtaba Soltanalian

We consider the distributed channel access problem for a system consisting of multiple control subsystems that close their loop over a shared wireless network. We propose a distributed method for providing deterministic channel access…

Systems and Control · Electrical Eng. & Systems 2024-10-28 Tahmoores Farjam , Henk Wymeersch , Themistoklis Charalambous

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a…

Networking and Internet Architecture · Computer Science 2012-06-14 Bo Ji , Changhee Joo , Ness B. Shroff

The rapid growth of the so-called Internet of Things is expected to significantly expand and support the deployment of resource-limited devices. Therefore, intelligent scheduling protocols and technologies such as wireless power transfer,…

Information Theory · Computer Science 2021-05-06 Maria Dimitropoulou , Constantinos Psomas , Ioannis Krikidis

Relaying techniques for millimeter-wave wireless networks represent a powerful solution for improving the transmission performance. In this work, we quantify the benefits in terms of delay and throughput for a random-access multi-user…

Networking and Internet Architecture · Computer Science 2019-03-08 Cristian Tatino , Nikolaos Pappas , Ilaria Malanchini , Lutz Ewe , Di Yuan

The ideas of wireless network coding at the physical layer promise high throughput gains in wireless systems with relays and multi-way traffic flows. This gain can be ascribed to two principles: (1) joint transmission of multiple…

Information Theory · Computer Science 2010-11-30 Chan Dai Truyen Thai , Petar Popovski , Megumi Kaneko , Elisabeth de Carvalho

We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless networks where a transmission is successful only if the…

Data Structures and Algorithms · Computer Science 2010-11-23 Eyjólfur Ingi Ásgeirsson , Pradipta Mitra

We define a class of multi--hop erasure networks that approximates a wireless multi--hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow…

Information Theory · Computer Science 2015-03-19 Premkumar Karumbu , Xiaomin Chen , Douglas J. Leith

We consider a three-node decode-and-forward (DF) half-duplex relaying system, where the source first harvests RF energy from the relay, and then uses this energy to transmit information to the destination via the relay. We assume that the…

Information Theory · Computer Science 2016-01-19 Zoran Hadzi-Velkov , Nikola Zlatanov , Trung Q. Duong , Robert Schober

In this paper, the application of wireless information and power transfer to cooperative networks is investigated, where the relays in the network are randomly located and based on the decode-forward strategy. For the scenario with one…

Information Theory · Computer Science 2014-03-26 Z. Ding , I. Krikidis , B. Sharif , H. V. Poor

We propose novel resource allocation algorithms that have the objective of finding a good tradeoff between resource reuse and interference avoidance in wireless networks. To this end, we first study properties of functions that relate the…

Signal Processing · Electrical Eng. & Systems 2018-01-19 Qi Liao , R. L. G. Cavalcante

We consider a two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with a common multiple-antenna relay, and a shared digital (noiseless) link between the relay and the two destinations. For this channel, this paper…

Information Theory · Computer Science 2015-03-17 Peyman Razaghi , Giuseppe Caire

This paper studies a novel mobile relaying technique, where relays of high mobility are employed to assist the communications from source to destination. By exploiting the predictable channel variations introduced by relay mobility, we…

Information Theory · Computer Science 2016-01-26 Yong Zeng , Rui Zhang , Teng Joon Lim

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

In this paper, we consider full-duplex and half-duplex Gaussian relay channels where the noises at the relay and destination are arbitrarily correlated. We first derive the capacity upper bound and the achievable rates with three existing…

Information Theory · Computer Science 2016-11-17 Lili Zhang , Jinhua Jiang , Andrea J. Goldsmith , Shuguang Cui

Accurate and real-time radio map (RM) generation is crucial for next-generation wireless systems, yet diffusion-based approaches often suffer from large model sizes, slow iterative denoising, and high inference latency, which hinder…

Computer Vision and Pattern Recognition · Computer Science 2025-10-13 Haozhe Jia , Wenshuo Chen , Xiucheng Wang , Nan Cheng , Hongbo Zhang , Kuimou Yu , Songning Lai , Nanjian Jia , Bowen Tian , Hongru Xiao , Yutao Yue