English
Related papers

Related papers: On the Feasibility of Wireless Interconnects for H…

200 papers

In large wireless networks, acquiring full network state information is typically infeasible. Hence, nodes need to flow the information and manage the interference based on partial information about the network. In this paper, we consider…

Information Theory · Computer Science 2015-03-17 Alireza Vahid , Vaneet Aggarwal , Amir Salman Avestimehr , Ashutosh Sabharwal

This paper studies the scalability of a wireless backhaul network modeled as a random extended network with multi-antenna base stations (BSs), where the number of antennas per BS is allowed to scale as a function of the network size. The…

Information Theory · Computer Science 2014-06-12 Harpreet S. Dhillon , Giuseppe Caire

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Information Theory · Computer Science 2013-02-08 Yuxin Chen , Jeffrey G. Andrews

Control of wireless multihop networks, while simultaneously meeting end-to-end mean delay requirements of different flows is a challenging problem. Additionally, distributed computation of control parameters adds to the complexity. Using…

Networking and Internet Architecture · Computer Science 2017-11-06 Ashok Krishnan K. S. , Vinod Sharma

Wireless edge networks in smart industrial environments increasingly operate using advanced sensors and autonomous machines interacting with each other and generating huge amounts of data. Those huge amounts of data are bound to make data…

Networking and Internet Architecture · Computer Science 2025-03-03 Theofanis P. Raptis , Andrea Passarella , Marco Conti

We consider network utility maximization problems over heterogeneous cellular networks (HetNets) that permit dual connectivity. Dual connectivity (DC) is a feature that targets emerging practical HetNet deployments that will comprise of…

Networking and Internet Architecture · Computer Science 2017-09-27 Narayan Prasad , Sampath Rangarajan

Hyperdimensional computing (HDC) is an emerging computing paradigm that represents, manipulates, and communicates data using very long random vectors (aka hypervectors). Among different hardware platforms capable of executing HDC…

Hardware Architecture · Computer Science 2022-05-24 Robert Guirado , Abbas Rahimi , Geethan Karunaratne , Eduard Alarcón , Abu Sebastian , Sergi Abadal

We consider multi-hop wireless networks serving multiple flows in which only packets that meet hard end-to-end deadline constraints are useful, i.e., if a packet is not delivered to its destination node by its deadline, it is dropped from…

Networking and Internet Architecture · Computer Science 2021-04-27 Rahul Singh , P. R. Kumar

Fast rate adaptation has been established as an effective way to improve the PHY-layer raw date rate of wireless networks. However, within the current IEEE 802.11 legacy, MAC-layer throughput is dominated by users with the lowest data…

Networking and Internet Architecture · Computer Science 2007-12-17 Da Rui Chen , Ying Jun , Zhang

Fast data synchronization in wireless ad hoc networks is a challenging and critical problem. It is fundamental for efficient information fusion, control and decision in distributed systems. Previously, distributed data synchronization was…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Die Hu , Xuejun Zhu , Min Gong , Shaoshi Yang

Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown to improve the energy efficiency and prolong the life of the…

Networking and Internet Architecture · Computer Science 2010-09-10 Khalid Nawaz , Alejandro P. Buchmann

The discrepancy between the upper bound on throughput in wireless networks and the throughput scaling in random networks which is also known as the connectivity-throughput trade-off is analyzed. In a random network with $\lambda$ nodes per…

Information Theory · Computer Science 2010-08-23 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general…

Information Theory · Computer Science 2016-11-17 Steven Weber , Jeffrey G. Andrews , Nihar Jindal

Cache-aided wireless device-to-device (D2D) networks have demonstrated promising performance improvement for video distribution compared to conventional distribution methods. Understanding the fundamental scaling behavior of such networks…

Information Theory · Computer Science 2020-10-12 Ming-Chun Lee , Mingyue Ji , Andreas F. Molisch

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

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

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 study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies which rely on the use of centralized scheduling algorithm and/or centralized routing algorithm to achieve the optimal…

Networking and Internet Architecture · Computer Science 2016-11-17 Tao Yang , Guoqiang Mao , Wei Zhang , Xiaofeng Tao

The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails…

Networking and Internet Architecture · Computer Science 2019-05-15 Shahbaz Rezaei , Mohammed Gharib , Ali Movaghar

We analyze the achievable rate in interference-free wireless networks with physical layer fading channels and orthogonal multiple access. As a starting point, the point-to-point channel is considered. We find the optimal physical and…

Information Theory · Computer Science 2016-11-18 Tao Cui , Tracey Ho , Joerg Kliewer