Conference Paper

Interference Networks with Local View: A Distributed Optimization Approach

Dept. of ECEE, Univ. of Colorado at Boulder, Boulder, CO, USA
DOI: 10.1109/ALLERTON.2009.5394535 Conference: Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Source: IEEE Xplore


In practice, a node in a network learns the channel through local message passing and obtains a local view of the network. Pure wireless message passing as well as mixed wireless and wireline message passing are considered in this paper. We study the distributed optimization of sum-rate for a class of deterministic interference networks with local view. A connection based utility function is designed for each user to exploit the local knowledge. This utility design turns out to be a potential game with sum-rate as the potential function. For the one-to-many channel with 1.5 wireless rounds of message passing, we show that there is a unique Nash equilibrium and using this strategy, the sum capacity can be achieved. We provide a sufficient condition for which a topology does not have unique Nash equilibrium. Then we consider the scenario that the network size and the users IDs are provided to each user. For various mixed wireless and wireline message passing patterns, including wireline at transmitter/receiver side and sequential/concurrent message passing scheduling, we identify whether a three-user interference network can achieve the sum capacity in a distributed fashion. Compared with the 1.5 pure wireless rounds of message passing, the results show that 2.5 mixed wireless and wireline rounds of message passing can significantly improve the system performance of three-user interference networks. We also derive some sufficient conditions for general K-user interference networks such that the sum capacity can not be achieved based on each user's local view.

Download full-text


Available from: Vaneet Aggarwal
  • Source
    • "We also note that the genie-aided information regarding global network connectivity do not aid in making a topology able to support a universally optimal strategy. These results have been extended to consider cooperation between transmitters or receivers in [11]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In distributed wireless networks, nodes often do not know the topology (network size, connectivity and the channel gains) of the network. Thus, they have to compute their transmission and reception parameters in a distributed fashion. In this paper, we consider the information required at the nodes to achieve globally optimal sum capacity. Our first result relates to the case when each of the transmitter know the channel gains of all the links that are at-most two-hop distant from it and the receiver knows the channel gains of all the links that are three-hop distant from it in a deterministic interference channel. With this limited information, we find that distributed decisions are sum-rate optimal only if each connected component is in a one-to-many configuration or a fully-connected configuration. In all other cases of network connectivity, the loss can be arbitrarily large. We then extend the result to see that O(K) hops of information are needed in general to achieve globally optimal solutions. To show this we consider a class of symmetric interference channel chain and find that in certain cases of channel gains, the knowledge of a particular user being odd user or even user is important thus needing O(K) hops of information at the nodes.
    Preview · Conference Paper · Dec 2009