Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Langberg-M{e}dard Multiple Unicast Conjecture: Stable $3$-Pair Networks
88
0
0.0
(
0
)
Added by
Guangyue Han
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The Langberg-M{e}dard multiple unicast conjecture claims that for a strongly reachable $k$-pair network, there exists a multi-flow with rate $(1,1,dots,1)$. In this paper, we show that the conjecture holds true for {em stable} $3$-pair networks.
rate research
Read More
The Langberg-Medard multiple unicast conjecture claims that for any strongly reachable $k$-pair network, there exists a multi-flow with rate $(1,1,dots,1)$. In a previous work, through combining and concatenating the so-called elementary flows, we have constructed a multi-flow with rate at least $(frac{8}{9}, frac{8}{9}, dots, frac{8}{9})$ for any $k$. In this paper, we examine an optimization problem arising from this construction framework. We first show that our previous construction yields a sequence of asymptotically optimal solutions to the aforementioned optimization problem. And furthermore, based on this solution sequence, we propose a perturbation framework, which not only promises a better solution for any $k mod 4 eq 2$ but also solves the optimization problem for the cases $k=3, 4, dots, 10$, accordingly yielding multi-flows with the largest rate to date.
This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to $m$ destinations, in the presence of a passive adversary who eavesdrops an unknown set of $k$ edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when $k=1$ and $m$ is arbitrary, or $m=3$ and $k$ is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-layer and arbitrary separable networks.
The codewords of weight $10$ of the $[42,21,10]$ extended binary quadratic residue code are shown to hold a design of parameters $3-(42,10,18).$ Its automorphism group is isomorphic to $PSL(2,41)$. Its existence can be explained neither by a transitivity argument, nor by the Assmus-Mattson theorem.
We study the impact of delayed channel state information at the transmitters (CSIT) in two-unicast wireless networks with a layered topology and arbitrary connectivity. We introduce a technique to obtain outer bounds to the degrees-of-freedom (DoF) region through the new graph-theoretic notion of bottleneck nodes. Such nodes act as informational bottlenecks only under the assumption of delayed CSIT, and imply asymmetric DoF bounds of the form $mD_1 + D_2 leq m$. Combining this outer-bound technique with new achievability schemes, we characterize the sum DoF of a class of two-unicast wireless networks, which shows that, unlike in the case of instantaneous CSIT, the DoF of two-unicast networks with delayed CSIT can take an infinite set of values.
Unmanned aerial vehicles (UAVs) can enhance the performance of cellular networks, due to their high mobility and efficient deployment. In this paper, we present a first study on how the user mobility affects the UAVs trajectories of a multiple-UAV assisted wireless communication system. Specifically, we consider the UAVs are deployed as aerial base stations to serve ground users who move between different regions. We maximize the throughput of ground users in the downlink communication by optimizing the UAVs trajectories, while taking into account the impact of the user mobility, propulsion energy consumption, and UAVs mutual interference. We formulate the problem as a route selection problem in an acyclic directed graph. Each vertex represents a task associated with a reward on the average user throughput in a region-time point, while each edge is associated with a cost on the energy propulsion consumption during flying and hovering. For the centralized trajectory design, we first propose the shortest path scheme that determines the optimal trajectory for the single UAV case. We also propose the centralized route selection (CRS) scheme to systematically compute the optimal trajectories for the more general multiple-UAV case. Due to the NP-hardness of the centralized problem, we consider the distributed trajectory design that each UAV selects its trajectory autonomously and propose the distributed route selection (DRS) scheme, which will converge to a pure strategy Nash equilibrium within a finite number of iterations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
