37,714 research outputs found
Learning Autonomy in Management of Wireless Random Networks
This paper presents a machine learning strategy that tackles a distributed
optimization task in a wireless network with an arbitrary number of randomly
interconnected nodes. Individual nodes decide their optimal states with
distributed coordination among other nodes through randomly varying backhaul
links. This poses a technical challenge in distributed universal optimization
policy robust to a random topology of the wireless network, which has not been
properly addressed by conventional deep neural networks (DNNs) with rigid
structural configurations. We develop a flexible DNN formalism termed
distributed message-passing neural network (DMPNN) with forward and backward
computations independent of the network topology. A key enabler of this
approach is an iterative message-sharing strategy through arbitrarily connected
backhaul links. The DMPNN provides a convergent solution for iterative
coordination by learning numerous random backhaul interactions. The DMPNN is
investigated for various configurations of the power control in wireless
networks, and intensive numerical results prove its universality and viability
over conventional optimization and DNN approaches.Comment: to appear in IEEE TW
Implicit Coordination in Two-Agent Team Problems; Application to Distributed Power Allocation
The central result of this paper is the analysis of an optimization problem
which allows one to assess the limiting performance of a team of two agents who
coordinate their actions. One agent is fully informed about the past and future
realizations of a random state which affects the common payoff of the agents
whereas the other agent has no knowledge about the state. The informed agent
can exchange his knowledge with the other agent only through his actions. This
result is applied to the problem of distributed power allocation in a
two-transmitter band interference channel, , in which the
transmitters (who are the agents) want to maximize the sum-rate under the
single-user decoding assumption at the two receivers; in such a new setting,
the random state is given by the global channel state and the sequence of power
vectors used by the informed transmitter is a code which conveys information
about the channel to the other transmitter.Comment: 6 pages, appears as WNC3 2014: International Workshop on Wireless
Networks: Communication, Cooperation and Competition - International Workshop
on Resource Allocation, Cooperation and Competition in Wireless Network
Outage Capacity and Optimal Transmission for Dying Channels
In wireless networks, communication links may be subject to random fatal
impacts: for example, sensor networks under sudden power losses or cognitive
radio networks with unpredictable primary user spectrum occupancy. Under such
circumstances, it is critical to quantify how fast and reliably the information
can be collected over attacked links. For a single point-to-point channel
subject to a random attack, named as a \emph{dying channel}, we model it as a
block-fading (BF) channel with a finite and random delay constraint. First, we
define the outage capacity as the performance measure, followed by studying the
optimal coding length such that the outage probability is minimized when
uniform power allocation is assumed. For a given rate target and a coding
length , we then minimize the outage probability over the power allocation
vector \mv{P}_{K}, and show that this optimization problem can be cast into a
convex optimization problem under some conditions. The optimal solutions for
several special cases are discussed.
Furthermore, we extend the single point-to-point dying channel result to the
parallel multi-channel case where each sub-channel is a dying channel, and
investigate the corresponding asymptotic behavior of the overall outage
probability with two different attack models: the independent-attack case and
the -dependent-attack case. It can be shown that the overall outage
probability diminishes to zero for both cases as the number of sub-channels
increases if the \emph{rate per unit cost} is less than a certain threshold.
The outage exponents are also studied to reveal how fast the outage probability
improves over the number of sub-channels.Comment: 31 pages, 9 figures, submitted to IEEE Transactions on Information
Theor
- …