English
Related papers

Related papers: Resolving the Connectivity-Throughput Trade-Off in…

200 papers

In this paper we explore the problem of achieving efficient packet transmission over unreliable links with worst case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve stability of the…

Networking and Internet Architecture · Computer Science 2013-06-10 Antonio Fernández Anta , Chryssis Georgiou , Dariusz R. Kowalski , Joerg Widmer , Elli Zavou

Routing in Software-Defined Wireless sensor networks (SD-WSNs) can be either single or multi-hop, whereas the network is either static or dynamic. In static SD-WSN, the selection of the optimum route from source to destination is…

Networking and Internet Architecture · Computer Science 2021-03-19 Anuradha Banerjee , Abu Sufian , Ali Safaa Sadiq , Seyedali Mirjalili

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals…

Information Theory · Computer Science 2012-04-24 Samar Agnihotri , Sidharth Jaggi , Minghua Chen

This paper investigates the trade-off between throughput and peak age of information (PAoI) outage probability in a multi-sensor information collection system. Each sensor monitors a physical process, periodically samples its status, and…

Networking and Internet Architecture · Computer Science 2025-01-24 Tai-Chun Yeh , Yu-Pin Hsu

WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…

Information Theory · Computer Science 2009-11-03 Georg Böcherer , Alexandre de Baynast

Future 5G cellular networks supporting ultra-reliable, low-latency communications (URLLC) could employ random access communication to reduce the overhead compared to scheduled access techniques used in 4G networks. We consider a wireless…

Information Theory · Computer Science 2018-06-06 Derya Malak , Howard Huang , Jeffrey G. Andrews

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 existence of considerable amount of redundancy in the Internet traffic at the packet level has stimulated the deployment of packet-level redundancy elimination techniques within the network by enabling network nodes to memorize data…

Networking and Internet Architecture · Computer Science 2014-11-25 Ahmad Beirami , Mohsen Sardari , Faramarz Fekri

Unmanned Aerial Vehicles (UAVs) hold great potential to support a wide range of applications due to the high maneuverability and flexibility. Compared with single UAV, UAV swarm carries out tasks efficiently in harsh environment, where the…

Information Theory · Computer Science 2023-06-12 Zhiqing Wei , Ziyu Wang , Zeyang Meng , Ning Zhang , Huici Wu , Zhiyong Feng

Distributed Opportunistic Scheduling (DOS) techniques have been recently proposed to improve the throughput performance of wireless networks. With DOS, each station contends for the channel with a certain access probability. If a contention…

Networking and Internet Architecture · Computer Science 2014-12-16 Andres Garcia-Saavedra , Albert Banchs , Pablo Serrano , Joerg Widmer

The limited spectrum resources and dramatic growth of high data rate communications have motivated opportunistic spectrum access using the promising concept of cognitive radio networks. Although this concept has emerged primarily to enhance…

Networking and Internet Architecture · Computer Science 2013-12-03 Hossein Shokri-Ghadikolaei , Ioannis Glaropoulos , Viktoria Fodor , Carlo Fischione , Konstantinos Dimou

Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and latency…

Networking and Internet Architecture · Computer Science 2016-11-17 Bita Azimdoost , Cedric Westphal , Hamid R. Sadjadpour

With increasingly ambitious initiatives such as GENI and FIND that seek to design the future Internet, it becomes imperative to define the characteristics of robust topologies, and build future networks optimized for robustness. This paper…

Networking and Internet Architecture · Computer Science 2009-09-25 Ali Sydney , Caterina Scoglio , Mina Youssef , Phillip Schumm

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 2015-11-26 Gauri Joshi , Yuval Kochman , Gregory Wornell

We consider the effects of network topology on the optimality of packet routing quantified by $\gamma_c$, the rate of packet insertion beyond which congestion and queue growth occurs. The key result of this paper is to show that for any…

Networking and Internet Architecture · Computer Science 2016-08-16 Sameet Sreenivasan , Reuven Cohen , Eduardo López , Zoltán Toroczkai , H. Eugene Stanley

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

In this paper, we consider contention resolution on a multiple-access communication channel. In this problem, a set of nodes arrive over time, each with a message it intends to send. In each time slot, each node may attempt to broadcast its…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-22 Haimin Chen , Yonggang Jiang , Chaodong Zheng

Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Tobias Koch , Johan Östman , Yury Polyanskiy , Wei Yang

This paper analyzes the throughput of an unlicensed wireless network where messages decoded in outage may be retransmitted. We assume that some wireless devices such as sensors are the unlicensed users, which communicate in the licensed…

Information Theory · Computer Science 2018-03-07 Iran Ramezanipour , Pedro H. J. Nardelli , Hirley Alves , Ari Pouttu

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered wireless relay network with directed links is considered. A relay node performing analog network coding scales and forwards the…

Information Theory · Computer Science 2012-05-22 Samar Agnihotri , Sidharth Jaggi , Minghua Chen