English
Related papers

Related papers: Scalable Capacity Bounding Models for Wireless Net…

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

This paper considers joint beamformer design towards maximizing the mutual information in a coherent wireless sensor network with noisy observation and multiple antennae. Leveraging the weighted minimum mean square error and block…

Information Theory · Computer Science 2015-11-12 Yang Liu , Jing Li , Xuanxuan Lu

We consider a noncoherent wireless network, where the transmitters and receivers are cognizant of the statistics of the fading coefficients, but are ignorant of their realizations. We demonstrate that if the nodes do not cooperate, if they…

Information Theory · Computer Science 2015-07-02 Grace Villacrés , Tobias Koch

The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of…

Quantum Physics · Physics 2022-07-13 Cillian Harney , Stefano Pirandola

This paper, mostly tutorial in nature, deals with the problem of characterizing the capacity of fading channels in the high signal-to-noise ratio (SNR) regime. We focus on the practically relevant noncoherent setting, where neither…

Information Theory · Computer Science 2011-05-09 Giuseppe Durisi , Helmut Bölcskei

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

Probabilistic message-passing algorithms are developed for routing transmissions in multi-wavelength optical communication networks, under node and edge-disjoint routing constraints and for various objective functions. Global routing…

Physics and Society · Physics 2022-04-25 Yi-Zhi Xu , Ho Fai Po , Chi Ho Yeung , David Saad

Wireless network capacity can be regarded as the most important performance metric for wireless communication systems. With the fast development of wireless communication technology, future wireless systems will become more and more…

Information Theory · Computer Science 2022-08-17 Han Hao , Dandan Jiang , Lu Yang , Hao Wu , Bo Bai

We propose a unified Transformer-based architecture for wireless signal processing tasks, offering a low-latency, task-adaptive alternative to conventional receiver pipelines. Unlike traditional modular designs, our model integrates channel…

Signal Processing · Electrical Eng. & Systems 2025-09-11 Yuto Kawai , Rajeev Koodli

This paper studies the possibility of upper bounding the position error of an estimate for range based positioning algorithms in wireless sensor networks. In this study, we argue that in certain situations when the measured distances…

Information Theory · Computer Science 2015-03-20 Mohammad Reza Gholami , Erik G. Ström , Henk Wymeersch , Mats Rydström

In this work, the uplink channel estimation problem is considered for a millimeter wave (mmWave) multi-input multi-output (MIMO) system. It is well known that pilot overhead and computation complexity in estimating the channel increases…

Information Theory · Computer Science 2023-02-07 Rakesh Mundlamuri , Rajeev Gangula , Christo Kurisummoottil Thomas , Florian Kaltenberger , Walid Saad

This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the…

Networking and Internet Architecture · Computer Science 2015-03-17 Petteri Mannersalo , Georgios S. Paschos , Lazaros Gkatzikis

Transmission capacity (TC) is a performance metric for wireless networks that measures the spatial intensity of successful transmissions per unit area, subject to a constraint on the permissible outage probability (where outage occurs when…

Information Theory · Computer Science 2012-01-04 Steven Weber , Jeffrey G. Andrews

To better understand the wireless network design with a large number of hops, we investigate a line network formed by general discrete memoryless channels (DMCs), which may not be identical. Our focus lies on Generalized Batched Network…

Information Theory · Computer Science 2023-12-21 Jie Wang , Shenghao Yang , Yanyan Dong , Yiheng Zhang

The rapid increase in networked systems and data transmission requires advanced data compression solutions to optimize bandwidth utilization and enhance network performance. This study introduces a novel byte-level predictive model using…

Networking and Internet Architecture · Computer Science 2025-03-26 Xuanhao Luo , Zhiyuan Peng , Zhouyu Li , Ruozhou Yu , Yuchen Liu

Future Internet-of-Things (IoT) will connect billions of small computing devices embedded in the environment and support their device-to-device (D2D) communication. Powering this massive number of embedded devices is a key challenge of…

Information Theory · Computer Science 2016-04-12 Kaifeng Han , Kaibin Huang

A wireless network's design must include the optimization of the area of coverage of its wireless transmitters - mobile and base stations in cellular networks, wireless access points in WLANs, or nodes on a transmit schedule in a wireless…

Networking and Internet Architecture · Computer Science 2016-04-01 Prateek Kapadia

Constructing a connected dominating set as the virtual backbone plays an important role in wireless networks. In this paper, we propose two novel approximate algorithms for dominating set and connected dominating set in wireless networks,…

Networking and Internet Architecture · Computer Science 2012-11-13 Congcong Chen , Jiguo Yu , Xiujuan Zhang

Throughput capacity is a critical parameter for the design and evaluation of ad-hoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an ad-hoc wireless network. Assuming a fixed per node transmission…

Information Theory · Computer Science 2007-07-13 Rohit Negi , Arjunan Rajeswaran

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh
‹ Prev 1 3 4 5 6 7 10 Next ›