相关论文: Quasi-optimal grouping for broadcast systems with …

In this paper we use a variation of simulated annealing algorithm for optimizing two-dimensional constellations with 32 signals. The main objective is to maximize the symmetric pragmatic capacity under the peak-power constraint. The method…

We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number…

This paper considers the problem of decentralized submodular maximization subject to partition matroid constraint using a sequential greedy algorithm with probabilistic inter-agent message-passing. We propose a communication-aware framework…

Multiple-input multiple-output (MIMO) systems will play a crucial role in future wireless communication, but improving their signal detection performance to increase transmission efficiency remains a challenge. To address this issue, we…

A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing…

This paper considers an orthogonal frequency division multiplexing (OFDM) point-to-point wireless communication system with simultaneous wireless information and power transfer. We study a receiver which is able to harvest energy from the…

Efficient handover algorithms are essential for highly performing mobile wireless communications. These algorithms depend on numerous parameters, whose settings must be appropriately optimized to offer a seamless connectivity. Nevertheless,…

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…

We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \emph{schedule}) the links into the minimum number of slots, each satisfying…

In this work, we design and analyze novel distributed scheduling algorithms for multi-user MIMO systems. In particular, we consider algorithms which do not require sending channel state information to a central processing unit, nor do they…

We investigate a distributed optimization problem over a cooperative multi-agent time-varying network, where each agent has its own decision variables that should be set so as to minimize its individual objective subject to local…

In this paper, we consider a full duplex wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point. An optimization framework is proposed…

Multicasting is an efficient technique for simultaneously transmitting common messages from the base station (BS) to multiple mobile users (MUs). Multicast scheduling over multiple channels, which aims to jointly minimize the energy…

Group synchronization asks to recover group elements from their pairwise measurements. It has found numerous applications across various scientific disciplines. In this work, we focus on orthogonal and permutation group synchronization…

This paper gives poly-logarithmic-round, distributed D-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-cost Covering). The approximation ratio D is the maximum number of…

A variety of large-scale machine learning problems can be cast as instances of constrained submodular maximization. Existing approaches for distributed submodular maximization have a critical drawback: The capacity - number of instances…

In this work, we consider a wireless network with K cooperating transmitters (TXs) serving jointly K receivers (RXs). Due to the practical limitations of the backhaul network, it is relevant to consider a setting where each TX receives its…

We propose a numerical algorithm for computing approximately optimal solutions of the matching for teams problem. Our algorithm is efficient for problems involving large number of agent categories and allows for non-discrete agent type…

Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…