Related papers: Reducibility of joint relay positioning and flow o…
The paper addresses large-scale, convex optimization problems that need to be solved in a distributed way by agents communicating according to a random time-varying graph. Specifically, the goal of the network is to minimize the sum of…
The multihop relay wireless networks have gained traction due to the emergence of Reconfigurable Intelligent Surfaces (RISs) which can be used as relays in high frequency range wireless network, including THz or mmWave. To select paths in…
In a wireless system with a large number of distributed nodes, the quality of communication can be greatly improved by pooling the nodes to perform joint transmission/reception. In this paper, we consider the problem of optimally selecting…
In this paper, we study the relay selection problem in multi-user, multi-hop relay networks with the objective of minimizing the maximum outage probability across all users. When only one user is present, it is well known that the optimal…
The balanced hypergraph partitioning problem is to partition a hypergraph into $k$ disjoint blocks of bounded size such that the sum of the number of blocks connected by each hyperedge is minimized. We present an improvement to the…
This paper is concerned with a constrained optimization problem over a directed graph (digraph) of nodes, in which the cost function is a sum of local objectives, and each node only knows its local objective and constraints. To…
This paper studies a hierarchical over-the-air computation (AirComp) network over a large area, in which multiple relays are exploited to facilitate data aggregation from massive WDs. We present a two-phase amplify-and-forward (AF) relaying…
A scalable framework is developed to allocate radio resources across a large number of densely deployed small cells with given traffic statistics on a slow timescale. Joint user association and spectrum allocation is first formulated as a…
In this paper, the problem of joint radio and computation resource management over multi-channel is investigated for multi-user partial offloading mobile edge computing (MEC) system. The target is to minimize the weighted sum of energy…
Extensive research has been done to achieve better throughput and reliability in wireless networks, with focus on multiple-input multiple-output systems. Recently, cooperative networking techniques have been investigated to increase the…
This paper investigates the problem of resource allocation for a wireless communication network with distributed reconfigurable intelligent surfaces (RISs). In this network, multiple RISs are spatially distributed to serve wireless users…
For a wireless multi-tier heterogeneous network with orthogonal spectrum allocation across tiers, we optimize the association probability and the fraction of spectrum allocated to each tier so as to maximize rate coverage. In practice, the…
Motivated by an emerging framework of Autonomous Modular Vehicles, we consider the abstract problem of optimally routing two modules, i.e., vehicles that can attach to or detach from each other in motion on a graph. The modules' objective…
Tensor network contraction is central to problems ranging from many-body physics to computer science. We describe how to approximate tensor network contraction through bond compression on arbitrary graphs. In particular, we introduce a…
We present a formal model to represent and solve the unicast/multicast routing problem in networks with Quality of Service (QoS) requirements. To attain this, first we translate the network adapting it to a weighted graph (unicast) or…
Unicast communication over a network of $M$-parallel relays in the presence of an eavesdropper is considered. The relay nodes, operating under individual power constraints, amplify and forward the signals received at their inputs. The…
This paper considers the problem of energy-efficient transmission in multi-flow multihop cooperative wireless networks. Although the performance gains of cooperative approaches are well known, the combinatorial nature of these schemes makes…
This paper studies the fundamental problem of how to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling…
We are motivated by the fact that multiple representations of the environment are required to stand for the changes in appearance with time and for changes that appear in a cyclic manner. These changes are, for example, from day to night…
By relying on a wireless backhaul link, relay stations enhance the performance of cellular networks at low infrastructure cost, but at the same time, they can aggravate the interference issue. In this paper, we analyze for several relay…