English
Related papers

Related papers: Random Access Schemes in Wireless Systems With Cor…

200 papers

In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling,…

Information Theory · Computer Science 2016-11-17 Qiao Li , Rohit Negi

Most existing random access schemes for machine-type communications (MTC) simply adopt a uniform preamble selection distribution, irrespective of the underlying device activity distributions. Hence, they may yield unsatisfactory access…

Information Theory · Computer Science 2022-03-14 Wang Liu , Ying Cui , Feng Yang , Lianghui Ding , Jun Sun

Random access schemes in modern wireless communications are generally based on the framed-ALOHA (f-ALOHA), which can be optimized by flexibly organizing devices' transmission and re-transmission. However, this optimization is generally…

Networking and Internet Architecture · Computer Science 2020-02-19 Nan Jiang , Yansha Deng , Arumugam Nallanathan

We study a wireless-powered uplink communication system with non-orthogonal multiple access (NOMA), consisting of one base station and multiple energy harvesting users. More specifically, we focus on the individual data rate optimization…

Information Theory · Computer Science 2016-11-17 Panagiotis D. Diamantoulakis , Koralia N. Pappi , Zhiguo Ding , George K. Karagiannidis

WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…

Information Theory · Computer Science 2009-11-03 Georg Böcherer , Alexandre de Baynast

A high success rate of grant-free random access scheme is proposed to support massive access for machine-to-machine communications in massive multipleinput multiple-output systems. This scheme allows active user equipments (UEs) to transmit…

Information Theory · Computer Science 2020-12-29 Huimei Han , Lushun Fang , Weidang Lu , Wenchao Zhai , Ying Li , Jun Zhao

This paper investigates the problem of distributed medium access control in a time slotted wireless multiple access network with an unknown finite number of homogeneous users. Assume that each user has a single transmission option. In each…

Information Theory · Computer Science 2018-11-28 Yanru Tang , Faeze Heydaryan , Jie Luo

In this work, we consider the problem of multiuser scheduling for the downlink of cell-free massive multi-input multi-output networks with clustering. In particular, we develop a multiuser scheduling algorithm based on an enhanced greedy…

Information Theory · Computer Science 2023-06-06 S. Mashdour , R. C. de Lamare , J. P. Sales

User selection has become crucial for decreasing the communication costs of federated learning (FL) over wireless networks. However, centralized user selection causes additional system complexity. This study proposes a network intrinsic…

Machine Learning · Computer Science 2024-09-17 Chen Sun , Shiyao Ma , Ce Zheng , Songtao Wu , Tao Cui , Lingjuan Lyu

Recent mobile equipment (as well as the norm IEEE 802.21) now offers the possibility for users to switch from one technology to another (vertical handover). This allows flexibility in resource assignments and, consequently, increases the…

Computer Science and Game Theory · Computer Science 2009-09-07 Pierre Coucheney , Corinne Touati , Bruno Gaujal

In many wireless communication networks a common channel is shared by multiple users who must compete to gain access to it. The operation of the network by self-interested and strategic users usually leads to the overuse of the channel…

Computer Science and Game Theory · Computer Science 2012-11-16 Luca Canzian , Yuanzhang Xiao , Michele Zorzi , Mihaela van der Schaar

We propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type…

Information Theory · Computer Science 2016-10-25 Rana Abbas , Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

Collective communications are ubiquitous in parallel applications. We present two new algorithms for performing a reduction. The operation associated with our reduction needs to be associative and commutative. The two algorithms are…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-10-18 Bradley R. Lowery , Julien Langou

Data aggregation is a promising approach to enable massive machine-type communication (mMTC). This paper focuses on the aggregation phase where a massive number of machine-type devices (MTDs) transmit to aggregators. By using non-orthogonal…

Information Theory · Computer Science 2018-04-25 Onel L. Alcaraz López , Hirley Alves , Pedro Nardelli , Matti Latva-aho

Massive access is one of the main use cases of beyond 5G (B5G) wireless networks and massive MIMO is a key technology for supporting it. Prior works studied massive access in the co-located massive MIMO framework. In this paper, we…

Information Theory · Computer Science 2021-05-24 Unnikrishnan Kunnath Ganesan , Emil Björnson , Erik G. Larsson

This paper introduces the novel concept of proactive resource allocation in which the predictability of user behavior is exploited to balance the wireless traffic over time, and hence, significantly reduce the bandwidth required to achieve…

Information Theory · Computer Science 2010-10-12 Hesham El-Gamal , John Tadrous , Atilla Eryilmaz

Over the past decade we have witnessed a rapid growth and development in wireless communication systems, to the point that conventional spectrum allocation policies may not be able to fulfill them all. Federal Communications Commission…

Networking and Internet Architecture · Computer Science 2013-02-11 Armin Banaei , Costas N. Georghiades

This paper develops a distributed algorithm for rate allocation in wireless networks that achieves the same throughput region as optimal centralized algorithms. This cross-layer algorithm jointly performs medium access control (MAC) and…

Information Theory · Computer Science 2015-03-13 Jubin Jose , Sriram Vishwanath

In this paper, an LSTM-aided hybrid random access scheme (LSTMH-RA) is proposed to support diverse quality of service (QoS) requirements in 6G machine-type communication (MTC) networks, where massive MTC (mMTC) devices and ultra-reliable…

Signal Processing · Electrical Eng. & Systems 2022-08-01 Wenchao Zhai , Huimei Han , Lei Liu , Jun Zhao

In this paper, we explore various multi-agent reinforcement learning (MARL) techniques to design grant-free random access (RA) schemes for low-complexity, low-power battery operated devices in massive machine-type communication (mMTC)…

Information Theory · Computer Science 2023-02-16 Muhammad Awais Jadoon , Adriano Pastore , Monica Navarro , Alvaro Valcarce