English
Related papers

Related papers: General Capacity for Deterministic Dissemination i…

200 papers

We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic results in this model rely on various additional features or…

Data Structures and Algorithms · Computer Science 2018-01-15 Tomasz Jurdzinski , Dariusz R. Kowalski , Michal Rozanski , Grzegorz Stachowiak

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

In the last few years the so--called "linear deterministic" model of relay channels has gained popularity as a means of studying the flow of information over wireless communication networks, and this approach generalizes the model of…

Information Theory · Computer Science 2009-04-17 S. M. Sadegh Tabatabaei Yazdi , Serap A. Savari

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

In this paper, we characterize the information-theoretic capacity scaling of wireless ad hoc networks with $n$ randomly distributed nodes. By using an exact channel model from Maxwell's equations, we successfully resolve the conflict in the…

Information Theory · Computer Science 2011-10-19 Si-Hyeon Lee , Sae-Young Chung

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-19 Tomasz Jurdzinski , Dariusz R. Kowalski , Grzegorz Stachowiak

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

We present a new outer bound for the sum capacity of general multi-unicast deterministic networks. Intuitively, this bound can be understood as applying the cut-set bound to concatenated copies of the original network with a special…

Information Theory · Computer Science 2014-04-22 Ilan Shomorony , A. Salman Avestimehr

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number…

Information Theory · Computer Science 2008-03-11 Satish Babu Korada , Nicolas Macris

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

We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact…

Information Theory · Computer Science 2007-10-23 A. S. Avestimehr , S. N. Diggavi , D. N. C. Tse

This paper investigates the throughput capacity of a flow crossing a multi-hop wireless network, whose geometry is characterized by general randomness laws including Uniform, Poisson, Heavy-Tailed distributions for both the nodes' densities…

Performance · Computer Science 2013-07-30 Florin Ciucu , Jens Schmitt

Diffusion models are vastly used in generative AI, leveraging their capability to capture complex data distributions. However, their potential remains largely unexplored in the field of resource allocation in wireless networks. This paper…

Systems and Control · Electrical Eng. & Systems 2024-07-23 Amirhassan Babazadeh Darabi , Sinem Coleri

Studying the capacity of wireless multi-hop networks is an important problem and extensive research has been done in the area. In this letter, we sift through various capacity-impacting parameters and show that the capacity of both static…

Networking and Internet Architecture · Computer Science 2012-07-06 Guoqiang Mao

This paper investigates two strategies to reduce the communication delay in future wireless networks: traffic dispersion and network densification. A hybrid scheme that combines these two strategies is also considered. The probabilistic…

Networking and Internet Architecture · Computer Science 2018-03-15 Guang Yang , Ming Xiao , H. Vincent Poor

We consider distributed average consensus in a wireless network with partial communication to reduce the number of transmissions in every iteration/round. Considering the broadcast nature of wireless channels, we propose a probabilistic…

Multiagent Systems · Computer Science 2023-01-30 Daniel Pérez Herrera , Zheng Chen , Erik G. Larsson

This paper proposes a supervised training algorithm for learning stochastic resource allocation policies with generative diffusion models (GDMs). We formulate the allocation problem as the maximization of an ergodic utility function subject…

Machine Learning · Computer Science 2025-09-23 Yigit Berkay Uslu , Samar Hadou , Shirin Saeedi Bidokhti , Alejandro Ribeiro

This article introduces a metric for performance evaluation of medium access schemes in wireless ad hoc networks known as local capacity. Although deriving the end-to-end capacity of wireless ad hoc networks is a difficult problem, the…

Information Theory · Computer Science 2012-02-22 Salman Malik , Philippe Jacquet

In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…

Information Theory · Computer Science 2012-01-24 Sunil Srinivasa , Martin Haenggi

We consider a wireless device-to-device (D2D) network where $n$ nodes are uniformly distributed at random over the network area. We let each node with storage capacity $M$ cache files from a library of size $m \geq M$. Each node in the…

Information Theory · Computer Science 2016-11-17 Sang-Woon Jeon , Song-Nam Hong , Mingyue Ji , Giuseppe Caire , Andreas F. Molisch
‹ Prev 1 2 3 10 Next ›