相关论文: Efficient Approximation Algorithms for Multi-Anten…

The long-range and low energy consumption requirements in Internet of Things (IoT) applications have led to a new wireless communication technology known as Low Power Wide Area Network (LPWANs). In recent years, the Long Range (LoRa)…

The important problem of weighted sum rate maximization (WSRM) in a multicellular environment is intrinsically sensitive to channel estimation errors. In this paper, we study ways to maximize the weighted sum rate in a linearly precoded…

Let G be an edge-weighted hypergraph on n vertices, m edges of size \le s, where the edges have real weights in an interval [1,W]. We show that if we can approximate a maximum weight matching in G within factor alpha in time T(n,m,W) then…

In this paper, we consider the energy-bandwidth allocation for a network with multiple broadcast channels, where the transmitters access the network orthogonally on the assigned frequency band and each transmitter communicates with multiple…

We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sublinear time per update. Our main result is a data structure that maintains a $(1+\epsilon)$…

In the Maximum Weight Independent Set of Rectangles (MWISR) problem we are given a set of n axis-parallel rectangles in the 2D-plane, and the goal is to select a maximum weight subset of pairwise non-overlapping rectangles. Due to many…

This paper addresses the scheduling problem in mobile social networks. We begin by proving that the approximation ratio analysis presented in the paper by Zhang \textit{et al.} (IEEE Transactions on Mobile Computing, 2025) is incorrect, and…

This paper proposes an analytic model for dimensioning OFDMA based networks like WiMAX and LTE systems. In such a system, users require a number of subchannels which depends on their \SNR, hence of their position and the shadowing they…

Practical data detectors for future wireless systems with hundreds of antennas at the base station must achieve high throughput and low error rate at low complexity. Since the complexity of maximum-likelihood (ML) data detection is…

We propose a distributed algorithm based on Alternating Direction Method of Multipliers (ADMM) to minimize the sum of locally known convex functions using communication over a network. This optimization problem emerges in many applications…

Recent advancements in unmanned aerial vehicles, also known as drones, have motivated logistics to use drones for multiple operations. Collaboration between drones and trucks in a last-mile delivery system has numerous benefits and reduces…

We present the first near optimal approximation schemes for the maximum weighted (uncapacitated or capacitated) $b$--matching problems for non-bipartite graphs that run in time (near) linear in the number of edges. For any…

Given a weighted bipartite graph $G = (L, R, E, w)$, the maximum weight matching (MWM) problem seeks to find a matching $M \subseteq E$ that maximizes the total weight $\sum_{e \in M} w(e)$. This paper presents a novel algorithm with a time…

LoRaWAN exhibits several characteristics that can lead to an unfair distribution of the Data Extracted Rate (DER) among nodes. Firstly, the capture effect leads to a strong signal suppressing a weaker signal at the gateway and secondly, the…

We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$. This problem is equivalent to the Minimum Weight Set Cover Problem in which the frequency of every…

The maximum weighted matching (MWM) problem is one of the most well-studied combinatorial optimization problems in distributed graph algorithms. Despite a long development on the problem, and the recent progress of Fischer, Mitrovic, and…

The combination of energy harvesting and large-scale multiple antenna technologies provides a promising solution for improving the energy efficiency (EE) by exploiting renewable energy sources and reducing the transmission power per user…

We study the densest subgraph problem and give algorithms via multiplicative weights update and area convexity that converge in $O\left(\frac{\log m}{\epsilon^{2}}\right)$ and $O\left(\frac{\log m}{\epsilon}\right)$ iterations,…

In this paper, we develop optimal energy-bandwidth allocation algorithms in fading channels for multiple energy harvesting transmitters, each may communicate with multiple receivers via orthogonal channels. We first assume that the side…

We study the problem of assigning transmission ranges to radio stations placed arbitrarily in a $d$-dimensional ($d$-D) Euclidean space in order to achieve a strongly connected communication network with minimum total power consumption. The…