中文
相关论文

相关论文: Asymptotic Performance of Coded Slotted ALOHA with…

200 篇论文

We consider asynchronous communication over point-to-point discrete memoryless channels. The transmitter starts sending one block codeword at an instant that is uniformly distributed within a certain time period, which represents the level…

信息论 · 计算机科学 2007-08-01 Aslan Tchamkerten , Venkat Chandar , Gregory Wornell

The effect of signals on stability, throughput region, and delay in a two-user slotted ALOHA based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model…

信息论 · 计算机科学 2019-02-08 Ioannis Dimitriou , Nikolaos Pappas

This paper studies the convergence properties the well-known message-passing algorithm for convex optimisation. Under the assumption of pairwise separability and scaled diagonal dominance, asymptotic convergence is established and a simple…

最优化与控制 · 数学 2019-04-10 Zhaorong Zhang , Minyue Fu

We quantify the throughput capacity of wireless multi-hop networks with several medium access schemes. We analyze pure ALOHA scheme where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion…

网络与互联网体系结构 · 计算机科学 2011-11-10 Salman Malik , Philippe Jacquet , Cedric Adjih

We consider a slotted-ALOHA LAN with loss-averse, noncooperative greedy users. To avoid non-Pareto equilibria, particularly deadlock, we assume probabilistic loss-averse behavior. This behavior is modeled as a modulated white noise term, in…

计算机科学与博弈论 · 计算机科学 2012-02-28 George Kesidis , Youngmi Jin

Compressive sampling (CoSa) is a new methodology which demonstrates that sparse signals can be recovered from a small number of linear measurements. Greedy algorithms like CoSaMP have been designed for this recovery, and variants of these…

数值分析 · 数学 2014-07-28 Raja Giryes , Deanna Needell

Asymptotic concentration behaviors of linear combinations of weight distributions on the random linear code ensemble are presented. Many important properties of a binary linear code can be expressed as the form of a linear combination of…

信息论 · 计算机科学 2008-03-10 Tadashi Wadayama

We consider a random access network consisting of source-destination pairs. Each source node generates status updates and transmits this information to its intended destination over a shared spectrum. The goal is to minimize the…

网络与互联网体系结构 · 计算机科学 2023-07-18 Zhiling Yue , Howard H. Yang , Meng Zhang , Nikolaos Pappas

Conventional power-domain non-orthogonal multiple access (NOMA) relies on precise power control, which requires real-time channel state information at transmitters. This requirement severely limits its application to future wireless…

信息论 · 计算机科学 2020-03-13 Zhaoji Zhang , Ying Li , Guanghui Song , Chau Yuen , Yong Liang Guan

This paper deals with a two-way relay network (TWRN) based on a slotted ALOHA protocol which utilizes network coding to exchange the packets. We proposed an analytical approach to study the behavior of such networks and the effects of…

网络与互联网体系结构 · 计算机科学 2016-02-08 Alireza Mahdavi Javid , Mehdi Setayesh , Farzaneh Farhadi , Farid Ashtiani

Stability region of random access wireless networks is known for only simple network scenarios. The main problem in this respect is due to interaction among queues. When transmission probabilities during successive transmissions change,…

网络与互联网体系结构 · 计算机科学 2014-06-18 Farzaneh Farhadi , Farid Ashtiani

For a sound field observed on a sensor array, compressive sensing (CS) reconstructs the direction-of-arrival (DOA) of multiple sources using a sparsity constraint. The DOA estimation is posed as an underdetermined problem by expressing the…

统计理论 · 数学 2023-07-19 Peter Gerstoft , Angeliki Xenaki , Christoph F. Mecklenbräuker

A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable…

分布式、并行与集群计算 · 计算机科学 2015-06-15 Sivaraman Dasarathan , Cihan Tepedelenlioglu , Mahesh Banavar , Andreas Spanias

Various random access mechanisms, such as Aloha protocol and its corresponding variants have been widely studied as efficient methods to coordinate the medium access among competing users. But when two or more wireless users transmit…

信息论 · 计算机科学 2015-01-07 Zaaloul Abdellah , Haqiq Abdelkrim

In this article, we provide further asymptotic analysis to the higher-order statistics (HOS) of the channel capacity over generalized fading channels, especially by proposing simple and closed-form expressions each of which can be easily…

信息论 · 计算机科学 2019-10-18 Ferkan Yilmaz

We consider a general asynchronous Stochastic Approximation (SA) scheme featuring a weighted infinity-norm contractive operator, and prove a bound on its finite-time convergence rate on a single trajectory. Additionally, we specialize the…

最优化与控制 · 数学 2020-02-06 Guannan Qu , Adam Wierman

We propose a probabilistic handshake mechanism for all-to-all broadcast coded slotted ALOHA. We consider a fully connected network where each user acts as both transmitter and receiver in a half-duplex mode. Users attempt to exchange…

A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmissions occur in a time-slotted ALOHA-type fashion but with an important…

网络与互联网体系结构 · 计算机科学 2015-05-14 Xin Liu , John Kountouriotis , Athina P. Petropulu , Kapil R. Dandekar

This paper extends various theoretical results from stationary data processing to cyclostationary (CS) processes under a unified framework. We first derive their asymptotic eigenbasis, which provides a link between their Fourier and…

信号处理 · 电气工程与系统科学 2025-11-17 Marc Vilà-Insa , Jaume Riba

The proportionally fair sharing of the capacity of a Poisson network using Spatial-Aloha leads to closed-form performance expressions in two extreme cases: (1) the case without topology information, where the analysis boils down to a…

网络与互联网体系结构 · 计算机科学 2013-08-01 François Baccelli , Bartlomiej Blaszczyszyn , Chandramani Singh