English
Related papers

Related papers: Throughput and Delay Analysis of Slotted Aloha wit…

200 papers

In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to…

Networking and Internet Architecture · Computer Science 2016-03-30 Zheng Chen , Nikolaos Pappas , Marios Kountouris , Vangelis Angelakis

Irregular repetition slotted aloha (IRSA) is a massive random access protocol in which users transmit several replicas of their packet over a frame to a base station. Existing studies have analyzed IRSA in the single-cell (SC) setup, which…

Signal Processing · Electrical Eng. & Systems 2023-02-22 Chirag Ramesh Srivatsa , Chandra R. Murthy

In this work, we design and analyse a Slotted ALOHA (SA) solution for Optical Wireless Communication (OWC)-based Internet of Underwater Things (IoUT). In the proposed system, user devices exchange data with an access point (AP) which…

In this paper, we model the minimum achievable throughput within a transmission block of restricted duration and aim to maximize it in movable antenna (MA)-enabled multiuser downlink communications. Particularly, we account for the antenna…

Information Theory · Computer Science 2024-11-22 Honghao Wang , Qingqing Wu , Ying Gao , Wen Chen , Weidong Mei , Guojie Hu , Lexi Xu

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

This paper studies the network throughput and transport delay of a multihop wireless random access network based on a Markov renewal model of packet transportation. We show that the distribution of the source-to-destination (SD) distance…

Networking and Internet Architecture · Computer Science 2008-05-12 Lin Dai , Tony T. Lee

In this paper, we investigate the effect of bursty traffic and random availability of caching helpers in a wireless caching system. More explicitly, we consider a general system consisting of a caching helper with its dedicated user in…

Information Theory · Computer Science 2017-09-04 Nikolaos Pappas , Zheng Chen , Ioannis Dimitriou

LoRaWAN is one of the most promising standards for IoT applications. Nevertheless, the high density of end-devices expected for each gateway, the absence of an effective synchronization scheme between gateway and end-devices, challenge the…

Networking and Internet Architecture · Computer Science 2018-09-17 Tommaso Polonelli , Davide Brunelli , Luca Benini

Load balancing plays a critical role in efficiently dispatching jobs in parallel-server systems such as cloud networks and data centers. A fundamental challenge in the design of load balancing algorithms is to achieve an optimal trade-off…

Performance · Computer Science 2020-12-16 Mark van der Boor , Sem Borst , Johan van Leeuwaarden

This paper deals with the delay-throughput analysis of a single-hop wireless network with $n$ transmitter/receiver pairs. All channels are assumed to be block Rayleigh fading with shadowing, described by parameters $(\alpha,\varpi)$, where…

Information Theory · Computer Science 2016-11-17 Jamshid Abouei , Alireza Bayesteh , Amir K. Khandani

In this paper, we consider the performance of a random-access time-slotted wireless network with a single access point and a mix of half- and full- duplex stations. Full-duplex transmissions involve data transmitted simultaneously in both…

Information Theory · Computer Science 2014-07-15 Vaneet Aggarwal , N. K. Shankaranarayanan

We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the…

Networking and Internet Architecture · Computer Science 2013-05-17 Niek Bouman , Sem Borst , Johan van Leeuwaarden

The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme.…

Information Theory · Computer Science 2018-04-16 Tomokazu Emoto , Takayuki Nozaki

A multiple access system with bursty data arrivals to the terminals is considered. The users are frame-synchronized, with variable sized packets independently arriving in each slot at every transmitter. Each packet needs to be delivered to…

Information Theory · Computer Science 2016-11-29 Sakshi Kapoor , Sreejith Sreekumar , Sibi Raj B Pillai

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

Information Theory · Computer Science 2022-07-12 Justin Kang , Wei Yu

To date, most analysis of WLANs has been focused on their operation under saturation condition. This work is an attempt to understand the fundamental performance of WLANs under unsaturated condition. In particular, we are interested in the…

Networking and Internet Architecture · Computer Science 2008-02-26 Ying Jun Zhang , Soung Chang Liew , Darui Chen

This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational…

Information Theory · Computer Science 2020-07-07 Francisco Lázaro , Čedomir Stefanović , Petar Popovski

Previous work on ad hoc network capacity has focused primarily on source-destination throughput requirements for different models and transmission scenarios, with an emphasis on delay tolerant applications. In such problems, network…

Information Theory · Computer Science 2007-07-13 Cristina Comaniciu , H. Vincent Poor

This paper uses a spatial Aloha model to describe a distributed autonomous wireless network in which a group of transmit-receive pairs (users) shares a common collision channel via slotted-Aloha-like random access. The objective of this…

Information Theory · Computer Science 2016-11-17 Jiangbin Lyu , Yong Huat Chew , Wai-Choong Wong

In this work, we consider the case where a source with bursty traffic can adjust the transmission duration in order to increase the reliability. The source is equipped with a queue in order to store the arriving packets. We model the system…

Information Theory · Computer Science 2018-09-11 Nikolaos Pappas