English
Related papers

Related papers: Fluid Limits for an ALOHA-type Model with Impatien…

200 papers

We introduce a model for the classical synchronised multiple access system with a single transmission channel and a randomised transmission protocol (ALOHA). We assume in addition that there is an energy harvesting mechanism, and any…

Probability · Mathematics 2016-01-18 Sergey Foss , Dmitriy Kim , Andrey Turlikov

We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…

Information Theory · Computer Science 2016-11-15 Cedomir Stefanovic , Petar Popovski , Dejan Vukobratovic

In the present paper, we study the evolution of an overloaded cyclic polling model that starts empty. Exploiting a connection with multitype branching processes, we derive fluid asymptotics for the joint queue length process. Under passage…

Probability · Mathematics 2014-10-24 Maria Frolkova , Sergey Foss , Bert Zwart

One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards…

Information Theory · Computer Science 2017-09-08 Cedomir Stefanovic , Francisco Lazaro , Petar Popovski

In this paper, a simple variation of classical Slotted Aloha is introduced and analyzed. The enhancement relies on adding multiple receivers that gather different observations of the packets transmitted by a user population in one slot. For…

Networking and Internet Architecture · Computer Science 2014-01-16 Andrea Munari , Michael Heindlmaier , Gianluigi Liva , Matteo Berioli

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

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to…

Networking and Internet Architecture · Computer Science 2013-02-26 Javad Ghaderi , Sem Borst , Phil Whiting

In this paper, we adopt the fluid limits to analyze Age of Information (AoI) in a wireless multiaccess network with many users. We consider the case wherein users have heterogeneous i.i.d. channel conditions and the statuses are…

Information Theory · Computer Science 2020-12-29 Zhiyuan Jiang

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…

Networking and Internet Architecture · Computer Science 2015-05-14 Xin Liu , John Kountouriotis , Athina P. Petropulu , Kapil R. Dandekar

The synchronization process inherent to the Bitcoin network gives rise to an infinite-server model with the unusual feature that customers interact. Among the closed-form characteristics that we derive for this model is the busy period…

Probability · Mathematics 2017-03-27 Maria Frolkova , Michel Mandjes

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…

Networking and Internet Architecture · Computer Science 2016-02-08 Alireza Mahdavi Javid , Mehdi Setayesh , Farzaneh Farhadi , Farid Ashtiani

We investigate the age-of-information (AoI) in the context of random access networks, in which transmitters need to send a sequence of information packets to intended receivers over shared spectrum. We establish an analytical framework that…

Information Theory · Computer Science 2020-09-22 Howard H. Yang , Ahmed Arafa , Tony Q. S. Quek , H. Vincent Poor

The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model,…

Networking and Internet Architecture · Computer Science 2017-07-04 Enrico Paolini , Cedomir Stefanovic , Gianluigi Liva , Petar Popovski

We study a many-server queuing system with general service time distribution and state dependent service rates. The dynamics of the system are modeled using measure valued processes which keep track of the residual service times. Under…

Probability · Mathematics 2013-04-09 Anup Biswas

In wireless networks, where each node transmits independently of other nodes in the network (the ALOHA protocol), the expected delay experienced by a packet until it is successfully received at any other node is known to be infinite for…

Information Theory · Computer Science 2015-12-01 Srikanth K. Iyer , Rahul Vaze

To efficiently utilize the scarce wireless resource, the random access scheme has been attaining renewed interest primarily in supporting the sporadic traffic of a large number of devices encountered in the Internet of Things (IoT). In this…

Information Theory · Computer Science 2024-10-24 Dick Maryopi , Daud Al Adumy , Osman Musa , Peter Jung , Agus Virgono

For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The…

Information Theory · Computer Science 2013-10-04 Harpreet S. Dhillon , Howard C. Huang , Harish Viswanathan , Reinaldo A. Valenzuela

We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…

Information Theory · Computer Science 2016-05-20 Jesper H. Sørensen , Elisabeth de Carvalho , Čedomir Stefanović , Petar Popovski

Proliferation of the urban Internet-of-Things (IoTs) for smart cities has fuelled massive amounts of data over wireless cellular networks. Random access (RA) system of wireless cellular networks, e.g., 5G New Radio (NR), based on S-ALOHA…

Information Theory · Computer Science 2024-10-28 Yangqian Hu , Jun-Bae Seo , Hu Jin