English
Related papers

Related papers: Achieving Stability for Aloha Networks with Multip…

200 papers

Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…

Information Theory · Computer Science 2017-07-03 Federico Clazzer , Enrico Paolini , Iacopo Mambelli , Cedomir Stefanovic

In this article, we consider a random access scheme for an indoor Internet of Things (IoT) framework that uses optical wireless communication (OWC). We focus on a Slotted ALOHA (SA)-based solution where a number of OWC IoT users contend to…

Information Theory · Computer Science 2021-07-16 Milica Petkovic , Tijana Devaja , Dejan Vukobratovic , Francisco J. Escribano , Cedomir Stefanovic

Information-theoretic arguments focus on modeling the reliability of information transmission, assuming availability of infinite data at sources, thus ignoring randomness in message generation times at the respective sources. However, in…

Networking and Internet Architecture · Computer Science 2009-09-29 K. C. V. Kalyanarama Sesha Sayee

Stability with respect to a given scheduling policy has become an important issue for wireless communication systems, but it is hard to prove in particular scenarios. In this paper two simple conditions for stability in broadcast channels…

Networking and Internet Architecture · Computer Science 2009-04-16 Chan Zhou , Gerhard Wunder

We consider a decentralised multi-access algorithm, motivated primarily by the control of transmissions in a wireless network. For a finite single-hop network with arbitrary interference constraints we prove stochastic stability under the…

Information Theory · Computer Science 2019-06-03 Seva Shneer , Alexander Stolyar

Many complex engineering systems network together functional elements and balance demand loads (e.g.information on data networks, electric power on grids). This allows load spikes to be shifted and avoid a local overload. In mobile wireless…

Social and Information Networks · Computer Science 2021-01-26 Mengbang Zou , Yu Huang , Weisi Guo

Random multiple-access protocols of type ALOHA are used to regulate networks with a star configuration where client nodes talk to the hub node at the same frequency (finding a wide range of applications among telecommunication systems,…

Probability · Mathematics 2012-11-07 Maria Frolkova , Sergey Foss , Bert Zwart

In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…

Systems and Control · Computer Science 2014-12-17 Xiaochuan Zhao , Ali H. Sayed

This paper addresses the problem of reaching consensus under input saturation and intermittent communication, which can hinder the convergence of the system. We propose a method that translates the consensus into an equivalent stability…

Systems and Control · Electrical Eng. & Systems 2026-05-26 Thales C. Silva , M. Ani Hsieh

This work aims at combining adaptive protocol design, utility maximization and stochastic geometry. We focus on a spatial adaptation of Aloha within the framework of ad hoc networks. We consider quasi-static networks in which mobiles learn…

Networking and Internet Architecture · Computer Science 2013-03-07 François Baccelli , Chandramani Singh

Admission control can be employed to avoid congestion in queueing networks subject to overload. In distributed networks the admission decisions are often based on imperfect measurements on the network state. This paper studies how the lack…

Probability · Mathematics 2007-08-22 Lasse Leskelä

Based on a stochastic geometry framework, we establish an analysis of the multi-hop spatial reuse aloha protocol (MSR-Aloha) in ad hoc networks. We compare MSR-Aloha to a simple routing strategy, where a node selects the next relay of the…

Information Theory · Computer Science 2010-01-20 Olfa Ben Sik Ali , Christian Cardinal , Francois Gagnon

We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…

Information Theory · Computer Science 2022-05-04 Dmitriy Kim , Georgi Georgiev , Natalya Markovskaya

The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by…

Information Theory · Computer Science 2013-07-02 Cedomir Stefanovic , Petar Popovski

We study the optimal transmission scheme that maximizes the local capacity in two-dimensional (2D) wireless networks. Local capacity is defined as the average information rate received by a node randomly located in the network. Using…

Networking and Internet Architecture · Computer Science 2011-11-10 Salman Malik , Philippe Jacquet

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…

Networking and Internet Architecture · Computer Science 2013-08-01 François Baccelli , Bartlomiej Blaszczyszyn , Chandramani Singh

In our basic model, we study a stationary Poisson pattern of nodes on a line embedded in an independent planar Poisson field of interfering nodes. Assuming slotted Aloha and the signal-to-interference-and-noise ratio capture condition, with…

Networking and Internet Architecture · Computer Science 2015-03-20 Bartlomiej Blaszczyszyn , Paul Muhlethaler

This paper analyzes the connection between the protocol and physical interference models in the setting of Poisson wireless networks. A transmission is successful under the protocol model if there are no interferers within a parameterized…

Information Theory · Computer Science 2016-09-20 Jeffrey Wildman , Steven Weber

A communication network is called a radio network if its nodes exchange messages in the following restricted way. First, a send operation performed by a node delivers copies of the same message to all directly reachable nodes. Secondly, a…

Networking and Internet Architecture · Computer Science 2018-01-03 Bogdan S. Chlebus

In this paper a Time Division Multiple Access (TDMA) based Random Access (RA) channel with Successive Interference Cancellation (SIC) is considered for a finite user population and reliable retransmission mechanism on the basis of…

Information Theory · Computer Science 2016-11-18 Christian Kissling