Related papers: Optimality of Orthogonal Access for One-dimensiona…
This paper investigates an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network. Our objective is to minimize the total energy consumption of all users including transmission energy and local computation…
To better understand the correlation between network topological features and the robustness of network controllability in a general setting, this paper suggests a practical approach to searching for optimal network topologies with given…
Many situations in physics, biology, and engineering consist of the transport of some physical quantity through a network of narrow channels. The ability of a network to transport such a quantity in every direction can be described by the…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
We consider the problem of estimating the states of weakly coupled linear systems from sampled measurements. We assume that the total capacity available to the sensors to transmit their samples to a network manager in charge of the…
In this paper we consider a general problem set-up for a wide class of convex and robust distributed optimization problems in peer-to-peer networks. In this set-up convex constraint sets are distributed to the network processors who have to…
Neural codes serve as a language for neurons in the brain. Convex codes, which arise from the pattern of intersections of convex sets in Euclidean space, are of particular relevance to neuroscience. Not every code is convex, however, and…
Maintaining multiple wireless connections is a promising solution to boost capacity in fifth-generation (5G) networks, where user equipment is able to consume radio resources of several serving cells simultaneously and potentially aggregate…
Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a…
We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum $\sum_{i=1}^{m}f_i(z)$ of functions over in a network. We provide complexity bounds for four different…
In this paper, we consider a single-cell multi-user orthogonal frequency division multiple access (OFDMA) network with one unmanned aerial vehicle (UAV), which works as an amplify-and-forward relay to improve the quality-of-service (QoS) of…
Non-orthogonal multiple access (NOMA) is a key technology to enable massive machine type communications (mMTC) in 5G networks and beyond. In this paper, NOMA is applied to improve the random access efficiency in high-density…
For the task of moving a set of indistinguishable agents on a connected graph with unit edge distance to an arbitrary set of goal vertices, free of collisions, we propose a fast distance optimal control algorithm that guides the agents into…
We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applications, each edge in a network is associated with a certain…
Orthogonal Frequency Division Multiplexing (OFDM) is a multi-carrier modulation scheme that provides efficient bandwidth utilization and robustness against time dispersive channels. This paper deals with the basic system model for OFDM…
The solvability set of a power network - the set of all power injection vectors for which the corresponding Power Flow equations admit a solution - is central to power systems stability and security, as well as to the tightness of Optimal…
This paper studies the possibility of upper bounding the position error of an estimate for range based positioning algorithms in wireless sensor networks. In this study, we argue that in certain situations when the measured distances…
We consider the optimal coverage problem where a multi-agent network is deployed in an environment with obstacles to maximize a joint event detection probability. The objective function of this problem is non-convex and no global optimum is…
In this paper, we investigate the optimal precoding scheme for relay networks with finite-alphabet constraints. We show that the previous work utilizing various design criteria to maximize either the diversity order or the transmission rate…