English
Related papers

Related papers: Optimal Slotted ALOHA under Delivery Deadline Cons…

200 papers

We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and…

Information Theory · Computer Science 2016-05-26 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , 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

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

Applications like environmental sensing, and health and activity sensing, are supported by networks of devices (nodes) that send periodic packet transmissions over the wireless channel to a sink node. We look at simple abstractions that…

Information Theory · Computer Science 2017-05-10 Sanjit K. Kaul , Roy D. Yates

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

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

One of the main problems in WIMAX is to share the medium by multiple users who compete for access. Various random access mechanisms, such as ALOHA and its corresponding variations have been widely studied as efficient methods to coordinate…

Information Theory · Computer Science 2015-01-06 Abdellah Zaaloul , Mohamed Ben El Aattar , Mohamed Hanini , Abdelkrim Haqiq , Mohammed Boulmalaf

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 the intended receivers over a shared spectrum. Due to interference, the dynamics…

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

We consider a slotted-time system with a transmitter-receiver pair. In the system, a transmitter observes a dynamic source and sends updates to a remote receiver through a communication channel. We assume that the channel is error-free but…

Information Theory · Computer Science 2023-01-19 Yutao Chen , Anthony Ephremides

In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate…

Networking and Internet Architecture · Computer Science 2016-11-15 Manolis Ploumidis , Nikolaos Pappas , Apostolos Traganitis

In this paper, we design a novel high-throughput random access scheme for an indoor optical wireless communication (OWC) massive Internet of Things (IoT) scenario. Due to the large density of both IoT devices and OWC access points (APs), we…

Signal Processing · Electrical Eng. & Systems 2020-04-20 Dejan Vukobratovic , Francisco J. Escribano

We consider a linear multi-hop network composed of multi-state discrete-time memoryless channels over each hop, with orthogonal time-sharing across hops under a half-duplex relaying protocol. We analyze the probability of error and…

Information Theory · Computer Science 2008-10-29 Ozgur Oyman

Slotted ALOHA (SA) algorithms with Successive Interference Cancellation (SIC) decoding have received significant attention lately due to their ability to dramatically increase the throughput of traditional SA. Motivated by increased density…

Information Theory · Computer Science 2017-06-30 Aleksandar Mastilovic , Dejan Vukobratovic , Dusan Jakovetic , Dragana Bajovic

This paper proposes an improvement of the random multiple access scheme for satellite communication named Multislot coded ALOHA (MuSCA). MuSCA is a generalization of Contention Resolution Diversity Slotted ALOHA (CRDSA). In this scheme,…

Information Theory · Computer Science 2012-07-04 Huyen Chi Bui , Jérôme Lacan , Marie-Laure Boucheret

Packet transmission scheduling on multi-hop wireless sensor networks with 3-egress gateway linear topology is studied. Each node generates a data packet in every one cycle period and forwards it bounded for either of gateways at edges. We…

Networking and Internet Architecture · Computer Science 2021-02-11 Linh Vu Nguyen , Nguyen Viet Ha , Masahiro Shibata , Masato Tsuru

Multipath communication not only allows improved throughput but can also be used to leverage different path characteristics to best fulfill each application's objective. In particular, certain delay-sensitive applications, such as real time…

Networking and Internet Architecture · Computer Science 2017-07-06 Laurent Chuat , Adrian Perrig , Yih-Chun Hu

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 introduces a protocol that distributively constructs a collision-free schedule for multi-hop packet radio networks in the presence of hidden terminals. As a preliminary step, each wireless station computes the schedule length…

Networking and Internet Architecture · Computer Science 2012-06-21 Jaume Barcelo , Boris Bellalta , Cristina Cano , Azadeh Faridi , Miquel Oliver

Recently, random access protocols have acquired a new wave of interest, not only from the satellite communication community, but also from researchers active in fields like Internet of Things and machine-to-machine. Asynchronous (slot- and…

Information Theory · Computer Science 2017-10-09 Federico Clazzer , Christian Kissling , Mario Marchese

Multi-packet reception (MPR) has been recognized as a powerful capacity-enhancement technique for random-access wireless local area networks (WLANs). As is common with all random access protocols, the wireless channel is often…

Networking and Internet Architecture · Computer Science 2016-11-15 Ying Jun , Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›