English
Related papers

Related papers: Approaching Optimal Centralized Scheduling with CS…

200 papers

We investigate the optimal carrier sensing threshold in random CSMA/CA networks considering the effect of binary exponential backoff. We propose an iterative algorithm for optimizing the carrier sensing threshold and hence maximizing the…

Information Theory · Computer Science 2013-12-23 Dong Min Kim , Seong-Lyun Kim

In this paper, we investigate the resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The proposed algorithm is obtained from the solution of a non-convex optimization problem for the…

Information Theory · Computer Science 2016-03-29 Yan Sun , Derrick Wing Kwan Ng , Zhiguo Ding , Robert Schober

Interference mitigation techniques are essential for improving the performance of interference limited wireless networks. In this paper, we introduce novel interference mitigation schemes for wireless cellular networks with space division…

Information Theory · Computer Science 2014-08-18 Martin Kasparick , Gerhard Wunder

In this paper, we propose a novel adaptive carrier sense multiple access scheme with collision avoidance (CSMA/CA) to perform efficient and reliable data transfer with increased throughput across multiple coexisting wireless body area…

Networking and Internet Architecture · Computer Science 2018-03-18 Samiya M. Shimly , David B. Smith , Samaneh Movassaghi

Channel allocation is the task of assigning channels to users such that some objective (e.g., sum-rate) is maximized. In centralized networks such as cellular networks, this task is carried by the base station which gathers the channel…

Information Theory · Computer Science 2019-12-05 S. M. Zafaruddin , Ilai Bistritz , Amir Leshem , Dusit Niyato

This paper develops a novel approach to obtaining the optimal scheduling strategy in a multi-input multi-output (MIMO) multi-access channel (MAC), where each transmitter is powered by an individual energy harvesting process. Relying on the…

Information Theory · Computer Science 2017-09-28 Zheng Nan , Wenming Li

Simulated annealing (SA) method has had significant recent success in designing distributed control algorithms for wireless networks. These SA based techniques formed the basis of new CSMA algorithms and gave rise to the development of…

Optimization and Control · Mathematics 2018-09-11 Jaewook Kwak , Ness B. Shroff

This letter introduces a novel resource allocation algorithm for achieving max-min fairness (MMF) in a rate-splitting multiple access (RSMA) empowered multi-antenna broadcast channel. Specifically, we derive the closed-form solution for the…

Information Theory · Computer Science 2023-10-31 Facheng Luo , Yijie Mao

We consider multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is throughput-optimal in networks with a fixed number users, fails to…

Networking and Internet Architecture · Computer Science 2010-08-17 Shihuan Liu , Lei Ying , R. Srikant

Traffic load-balancing in datacenters alleviates hot spots and improves network utilization. In this paper, a stable in-network load-balancing algorithm is developed in the setting of software-defined networking. A control plane configures…

Networking and Internet Architecture · Computer Science 2016-12-07 Sucha Supittayapornpong , Michael J. Neely

This paper provides proofs of the rate stability, Harris recurrence, and epsilon-optimality of CSMA algorithms where the backoff parameter of each node is based on its backlog. These algorithms require only local information and are easy to…

Information Theory · Computer Science 2009-07-08 Libin Jiang , Devavrat Shah , Jinwoo Shin , Jean Walrand

In this paper, we consider a multiple-access fading channel where $N$ users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over…

Information Theory · Computer Science 2017-02-10 Antonious M. Girgis , Amr El-Keyi , Mohammed Nafie

We consider the delay properties of max-weight opportunistic scheduling in a multi-user ON/OFF wireless system, such as a multi-user downlink or uplink. It is well known that max-weight scheduling stabilizes the network (and hence yields…

Optimization and Control · Mathematics 2009-01-02 Michael J. Neely

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

This paper studies how to achieve the maximal link throughputs in a CSMA wireless network through offered-load control. First, we propose an analytical model, contention-graph-combination (CGC), to describe the relationship between the…

Networking and Internet Architecture · Computer Science 2014-04-29 Caihong Kai , Qi Zhang , Lusheng Wang

In this paper we propose distributed flooding-based storage algorithms for large-scale wireless sensor networks. Assume a wireless sensor network with $n$ nodes that have limited power, memory, and bandwidth. Each node is capable of both…

Information Theory · Computer Science 2009-09-01 Salah A. Aly , Hager S. Darwish , Moustafa Youssef , Mahmoud Zidan

In Fixed Wireless Applications (FWA), the Code Division Multiple Access (CDMA) is the most promising candidate for wideband data access. The reason is the soft limit on the number of active mobile devices. Many Fixed Wireless Applications…

Information Theory · Computer Science 2012-12-12 Muhammad Zeeshan , Shoab A Khan , Muhammad Yasir Malik

A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band systems. The optimization is over the joint space of all rate allocation and coding…

Information Theory · Computer Science 2007-07-13 Prasanna Chaporkar , Kimmo Kansanen , Ralf R. Müller

There is a growing interest in development of in-network dispersed computing paradigms that leverage the computing capabilities of heterogeneous resources dispersed across the network for processing massive amount of data is collected at…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-05-28 Chien-Sheng Yang , Ramtin Pedarsani , A. Salman Avestimehr

There has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling policies for constrained queueing network models that arise in the context of emerging communication networks. Here, we…

Information Theory · Computer Science 2010-04-06 Devavrat Shah , Jinwoo Shin