Related papers: Sparsity-Cognizant Multiple-Access Schemes for Lar…

In this paper, we focus on the problem of data sharing over a wireless computer network (i.e., a wireless grid). Given a set of available data, we present a distributed algorithm which operates over a dynamically changing network, and…

Distributed Opportunistic Scheduling (DOS) techniques have been recently proposed to improve the throughput performance of wireless networks. With DOS, each station contends for the channel with a certain access probability. If a contention…

This work studies centralized radio resource management in metropolitan area networks with a very large number of access points and user devices. A central controller collects time-averaged traffic and channel conditions from all access…

Design of energy efficient protocols for modern wireless systems has become an important area of research. In this paper, we propose a distributed optimization algorithm for the channel assignment problem for multiple interfering…

This article introduces a metric for performance evaluation of medium access schemes in wireless ad hoc networks known as local capacity. Although deriving the end-to-end capacity of wireless ad hoc networks is a difficult problem, the…

The multiple access scheduling decides how the channel is shared among the nodes in the network. Typical scheduling algorithms aims at increasing the channel utilization and thereby throughput of the network. This paper describes several…

To increase the spectral efficiency of wireless networks without requiring full-duplex capability of user devices, a potential solution is the recently proposed three-node full-duplex mode. To realize this potential, networks employing…

We consider a single source transmitting data to one or more receivers/users over a shared wireless channel. Due to random fading, the wireless channel conditions vary with time and from user to user. Each user has a buffer to store…

Compressive sensing has been successfully used for optimized operations in wireless sensor networks. However, raw data collected by sensors may be neither originally sparse nor easily transformed into a sparse data representation. This…

In this paper we improve the approximation ratio for the problem of scheduling packets on line networks with bounded buffers, where the aim is that of maximizing the throughput. Each node in the network has a local buffer of bounded size…

We consider a wireless network where multiple energy harvesting transmitters communicate with the common receiver in a time sharing manner. In each slot, a transmitter can either harvest energy or send its data to the receiver. Given a time…

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…

We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless…

The rapid growth of data volume and the accompanying congestion problems over the wireless networks have been critical issues to content providers. A novel technique, termed as coded cache, is proposed to relieve the burden. Through…

We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the…

This paper addresses the problem of estimating sparse channels in massive MIMO-OFDM systems. Most wireless channels are sparse in nature with large delay spread. In addition, these channels as observed by multiple antennas in a neighborhood…

The near-far problem causes severe throughput unfairness in wireless powered communication networks (WPCN). In this paper, we exploit non-orthogonal multiple access (NOMA) technology and propose a fairness-aware NOMA-based scheduling scheme…

This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…

Load balancing across parallel servers is an important class of congestion control problems that arises in service systems. An effective load balancer relies heavily on accurate, real-time congestion information to make routing decisions.…

In this paper, we study the resource allocation algorithm design for multiuser orthogonal frequency division multiplexing (OFDM) downlink systems with simultaneous wireless information and power transfer. The algorithm design is formulated…