English
Related papers

Related papers: Wireless Network Simplification: The Performance o…

200 papers

This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, propagation is modeled by…

Information Theory · Computer Science 2007-08-01 Enrique J. Duarte-Melo , Awlok Josan , Mingyan Liu , David L. Neuhoff , Sandeep Pradhan

Deep learning-based approaches have been developed to solve challenging problems in wireless communications, leading to promising results. Early attempts adopted neural network architectures inherited from applications such as computer…

Information Theory · Computer Science 2022-11-07 Yifei Shen , Jun Zhang , S. H. Song , Khaled B. Letaief

In this paper, we consider the problem of finding the maximum routing throughput between any pair of nodes in an arbitrary multirate wireless mesh network (WMN) using multiple paths. Multipath routing is an efficient technique to maximize…

Networking and Internet Architecture · Computer Science 2016-11-17 Jalaluddin Qureshi , Chuan Heng Foh , Jianfei Cai

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

Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…

Information Theory · Computer Science 2016-11-15 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor

Segment Routing is a recent network technology that helps optimizing network throughput by providing finer control over the routing paths. Instead of routing directly from a source to a target, packets are routed via intermediate waypoints.…

Computational Complexity · Computer Science 2025-01-08 Cristina Bazgan , Morgan Chopin , André Nichterlein , Camille Richer

This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Optimal relay subset selection with the objective of maximizing…

Information Theory · Computer Science 2008-05-23 Caleb K. Lo , Sriram Vishwanath , Robert W. Heath

This paper investigates the benefits of cooperation and proposes a relay activation strategy for a large wireless network with multiple transmitters. In this framework, some nodes cooperate with a nearby node that acts as a relay, using the…

Information Theory · Computer Science 2016-11-17 Andrés Altieri , Leonardo Rey Vega , Pablo Piantanida , Cecilia Galarza

Oblivious routing has a long history in both the theory and practice of networking. In this work we initiate the formal study of oblivious routing in the context of reconfigurable networks, a new architecture that has recently come to the…

Data Structures and Algorithms · Computer Science 2021-11-18 Daniel Amir , Tegan Wilson , Vishal Shrivastav , Hakim Weatherspoon , Robert Kleinberg , Rachit Agarwal

We provide a geometric solution to the problem of optimal relay positioning to maximize the multicast rate for low-SNR networks. The networks we consider, consist of a single source, multiple receivers and the only intermediate and…

Information Theory · Computer Science 2011-06-02 Mohit Thakur , Nadia Fawaz , Muriel Médard

One key challenge in designing resilient large-scale wireless ad hoc networks is to understand how random node failures affect fundamental network performance. In this work, we show that both network capacity and delay scale as…

Information Theory · Computer Science 2026-05-14 Wei Li , Min Sheng , Junyu Liu , Jiandong Li

This paper considers a wireless powered communication network (WPCN) with group cooperation, where two communication groups cooperate with each other via wireless power transfer and time sharing to fulfill their expected information…

Information Theory · Computer Science 2017-03-28 Ke Xiong , Chen Chen , Gang Qu , Pingyi Fan , Khaled Ben Letaief

We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual information from every packet transmission. This enables a…

Optimization and Control · Mathematics 2011-10-18 Rahul Urgaonkar , Michael J. Neely

We investigate the role of cooperation in wireless networks subject to a spatial degrees of freedom limitation. To address the worst case scenario, we consider a free-space line-of-sight type environment with no scattering and no fading. We…

Information Theory · Computer Science 2016-11-17 Ayfer Ozgur , Olivier Leveque , David Tse

Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…

Performance · Computer Science 2024-01-10 Wenkai Dai , Michael Dinitz , Klaus-Tycho Foerster , Long Luo , Stefan Schmid

Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited…

Systems and Control · Computer Science 2012-05-02 Giacomo Como , Ketan Savla , Daron Acemoglu , Munther A. Dahleh , Emilio Frazzoli

Covert communication aims to shield the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, for the first time we examine the possibility and achievable performance of covert…

Information Theory · Computer Science 2017-04-18 Jinsong Hu , Shihao Yan , Xiangyun Zhou , Feng Shu , Jiangzhou Wang

Robust and efficient design of networks on a realistic geographical space is one of the important issues for the realization of dependable communication systems. In this paper, based on a percolation theory and a geometric graph property,…

Data Analysis, Statistics and Probability · Physics 2011-11-04 Yukio Hayashi

With the tremendous increase of the Internet traffic, achieving the best performance with limited resources is becoming an extremely urgent problem. In order to address this concern, in this paper, we build an optimization problem which…

Physics and Society · Physics 2017-02-23 Li Rui , Xia Yongxiang , Tse K Chi

Interference is a major issue that limits the performance in wireless networks, and cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited…

Information Theory · Computer Science 2009-08-20 I-Hsiang Wang , David N. C. Tse