Cloud-Based Topological Interference Management: A Case with No Cooperative Transmission Gain
We study the problem of managing interference in linear networks, with backhaul constraints that admit centralized allocation of messages to transmitters through the cloud. Our setting is that of a generic channel, where no channel state information is available at the transmitters. Knowing only the network topology, we characterize the optimal decisions for assigning messages to transmitters, given that each receiver is interested in one message that can be available at transmitters. We show that using linear cooperation schemes, the per user degrees of freedom does not increase as we increase beyond unity. Hence, we conclude for the considered problem that cooperative transmission does not increase the degrees of freedom.
TIM, Coordinated Multi-Point, C-RAN, Blind Interference Management, Cloud-Based Wireless
In the past decade, there has been a rising practical significance for Ad-hoc wireless networks. Starting with the emergence of sensor networks and the increased importance and distribution of local wireless networks like WiFi networks, and now with the new paradigm of heterogeneous networks, there is an interest to understand Ad-hoc networks even for the design of cellular networks. Further, the expected future popularity of device networks under the umbrella of the Internet of Things (IoT) is drawing attention to research in the area of Ad-Hoc wireless networks.
At the core of the wireless communication task, lies the problem of interference management, as the interference limitation stands as a bottleneck towards increasing the reliable rate of communication. While there has been tremendous effort over the past two decades to tackle the interference management problem from both theoretical and practical aspects, most of the results obtained cannot apply directly to recent Ad-hoc networks. Traditional results on the interference management problem are either tailored for fixed infrastructural cellular networks or rely on distributed approaches where cell association and transmission schedule decisions are based on local knowledge of the network.
Most interference management solutions for Ad-hoc networks rely on local knowledge to make distributed decisions. Many advances in distributed transmission schemes have accompanied the rise of sensor networks in the past decade. The reason is that prior to the new technology of cloud computing, the common wisdom was that centralized solutions or relying on global network knowledge would not be feasible for networks that are not supported by fixed planned infrastructure. Further, the nature of cellular networks prior to the novel paradigm of heterogeneous networks did not include any form of Ad-hoc networks. Now, with these two new advances: Cloud computing and heterogeneous networks, a centralized approach for managing wireless transmission in Ad-hoc networks is both more feasible and enjoys significant practical relevance (see e.g., -).
We attempt to tackle the problem of managing interference in Ad-hoc networks in this work through studying the information-theoretic model of a linear interference network (introduced by Wyner in ) with no channel state information available at the transmitters (no CSIT). Transmitters are only aware of the network topology in our model. Further, to capture the benefit of the cloud we make two assumptions. First, global information about the network topology is available. Second, each receiver is interested in one message that can be available at transmitters. The constraints on the number of transmitters that can be aware of each message relects a limited backhaul capacity constraint. Assigning messages to transmitters in this model mirrors taking cell association decisions in a cellular heterogeneous network. Further, the flexibility of being able to assign any message to any subset of transmitters reflects a cloud-based centralized controller that takes message assignment (cell association) as well as transmission schedule decisions.
System models that share similarities with the considered model have been studied thoroughly in the literature. In particular, with the availability of channel state information at the transmitters, the problem of finding message assignments to transmitters that maximize the asymptotic per user degrees of freedom (DoF) has been solved for linear interference networks in . It was shown in this work that combining centralized decisions for message assignment with cooperative transmission can achieve significant DoF gains through a simple delay-free zero-forcing transmit beamforming scheme. The question we answer in this work with regard to this previous work is whether the same insight hold even with no CSIT.
The problem of interference management with no CSIT, known as the topological interference management problem, has been studied with no cooperative transmission in [9, 10] and. In  and , this problem was considered for both constant channel and time-varying channel models, respectively. While the constant channel model assumes that the channel coefficients remain the same during a whole block of communication time slots, the time-varying channel model assumes a coherence time of unity, meaning that the channel changes from each time slot to the next. The results in these works show that DoF conclusions as well as the design of optimal interference management schemes differ dramatically between these two channel models. In this work, we show that enabling centralized decisions for assigning messages to transmitters allows us to reach the same conclusion for both time-varying and constant channel models, as long as the coherence time is the same for all communication links.
Recently, the problem of interference management through cooperative transmission has been studied with weak and no CSIT in -. In , it was shown that assigning each message to all the transmitters connected to the desired receiver is beneficial compared to assigning each message only to the transmitter having the same index as the desired receiver. However, the proposed coding scheme in  relies solely on interference avoidance and no cooperative transmission is exploited. In our problem, we try to understand the effect of cooperative transmission by allowing for a flexible assignment of messages to transmitters even when each message can be available at exactly one transmitter.
The main conclusion of this work is that cooperative transmission does not increase the per user degrees of freedom in large linear interference networks. We reach this conclusion by proving an information theoretic converse for the case when each message can be available at more than one transmitter, i.e., . We prove that the asymptotic per user DoF for any is the same as the one for the case when , which is achieved by interference avoidance.
The remainder of this paper is organized as follows. In Section 2, we introduce the problem formulation. The main result is stated in Section 3. We present the interference avoidance scheme for the case when in Section 4. We then prove the information theoretic upper bound for the case when in Section 5. Before concluding, we discuss an extension of our problem to arbitrary network topologies in Section 6. We finally provide concluding remarks in Section 7.
2 Problem Formulation
We use the standard model for the user interference channel with a single antenna at each node.
where is the time index, is the transmitted signal of transmitter , is the received signal of receiver , is the zero mean unit variance Gaussian noise at receiver , is the channel coefficient from transmitter to receiver over the time slot, and denotes the set .
For any set , we define the complement set . For each , let be the message intended for receiver , we use the abbreviations and to denote the sets and , respectively.
2.1 Channel Model
Each transmitter is connected to its corresponding receiver as well as one following receiver, and the last transmitter is connected only to its corresponding receiver. More precisely,
The channel connectivity model is illustrated for in Figure 1.
Each non-zero channel coefficient is drawn independently from the same continuous distribution. Unless stated otherwise, all results in the paper are valid regardless of the coherence time of the channel (whether the channel remains constant across time slots or changes). While all receivers are assumed to be aware of the channel state information, the knowledge available for the design of the transmission scheme is that of the network topology. In other words, no channel state information is available at transmitters (no CSIT).
2.2 Cooperation Model
For each , let be the transmit set of message . The transmitters in cooperatively transmit the message to the receiver . The messages are assumed to be independent of each other. The cooperation constraint is defined as the maximum size of a transmit set:
2.3 Linear Cooperation Schemes
In this work, we restrict our attention to linear precoding schemes, where the transmit signal at each transmitter is given by a linear combination of signals; each depending only on one message. More precisely,
where depends only on message .
Each message is represented by a vector of complex symbols that are desired to be delivered to the receiver. This message is encoded to one or both of the transmit vectors and , where and denote the linear beamforming precoding matrices used by transmitters and to transmit . The rank of () is (), where and . Under such a scheme, the received signal of receiver over the time slots in (1) can be rewritten as
where for every , is an diagonal matrix with the diagonal element being equal to the value of the channel coefficient between transmitter and receiver in time slot . Each precoding matrix is an matrix that can only depend on the knowledge of topology, and has rank .
2.4 Degrees of Freedom
The total power constraint across all the users is . The rates are achievable if the error probabilities of all messages can be simultaneously made arbitrarily small for a large enough block length . The capacity region is the set of all achievable rate tuples. The DoF () is defined as , where is the sum capacity. Since depends on the specific choice of transmit sets, we define as the best achievable over all choices of transmit sets satisfying the cooperation order constraint in (3) for a user channel satisfying (2). We define the per user DoF to measure how the sum degrees of freedom scales with the number of users for a fixed cooperation order.
It is worth noting here that modifying the channel model such that the channel coefficient between the last transmitter and first receiver () is non-zero (cyclic model) does not change the value of .
3 Main Result
The main result in this work is a characterization of the asymptotic per user DoF for all values of the cooperation constraint in Wyner’s linear interference networks.
Under the restriction to linear cooperation schemes, transmitter cooperation with no CSIT does not increase the asymptotic per user DoF in linear interference networks. More precisely,
4 Achieving per user DoF without Cooperation
Consider the following message assignment for the case where . The problem in this case is a link scheduling problem whose solution is given as follows.
Further, the messages are not transmitted. Recall that the objective here is to maximize the sum degrees of freedom, so deactivating some transmitters or not transmitting some messages can make sense. Now, we can see that message can be delivered without interference through to . Also, message can be delivered without interference through to . For every three messages, two are delivered to their intended receivers without interference and one is not transmitted. Hence, degrees of freedom are achieved for each group of successive messages.
5 Converse Proof
In order to prove the converse, we prove a statement about general network topologies. First, we make that statement and show how it implies our desired upper bound, and then we prove it. We define the following condition to refer to a class of network topologies of interest. For any network topology, let be the set of indices of transmitters connected to at least one receiver with an index in . In other words, are the neighbors of receivers in .
We say that a network topology satisfies Condition if there exists a set of receiver indices such that the neighboring sets do not overlap. Further, if we remove all receivers with indices in , as well as all transmitters with indices in from the network, the remaining bipartite graph has a matching that covers each transmitter in .
For any network topology satisfying Condition , the sum DoF .
For the linear interference network topology considered in this work, Condition is satisfied for any network with a number of users such that , with a set (see Figure 2). Hence, applying Lemma 1 for large networks, we reach the result that , regardless of the value of the cooperation constraint .
We now dedicate the rest of this section to prove Lemma 1. We provide the proof here for linear interference networks, and delegate the general proof of any network topology satisfying Condition to the journal version of this work. The first step is to prove the following lemma about reconstructing a message from the knowledge of signals observed at the receivers it interferes at.
For , if has full column rank of almost surely, then,
where and represent the interference caused by message at receivers and , respectively, over time slot. More precisely, and .
We provide the main concepts behind the proof. Note that,
Finally, we prove by induction on the parameter that the addition of in (9) does not reduce the rank of the sum almost surely. In order to do so, we first define the following,
For the base of the induction, we consider the case where . In this case, is just one row of elements. Since and are drawn from a continuous distribution and independently from and , the probability that is zero, and hence, rank rank almost surely.
For the induction step, we assume that rank rank almost surely, and want to prove that for ,
Let and be the submatrices of and that consist of the first rows. We know from the induction hypothesis that rank rank almost surely. Hence, if (13) does not hold, then it has to be the case that the last row of is not in the row span of the first rows, with a non-zero probability. Further, the last row of has to be in the row span of the first rows, with a non-zero probability. Here, we reach a contradiction becasue and the channel coefficients drawn in the time slot are independent from all previous channel coefficients. We now restate [8, Lemma ] without proof.
If there exists a set , a function , and a function whose definition does not depend on the transmit power constraint , and , then the sum DoF .
In the above lemma, we used as the set of indices of transmitters that exclusively carry the messages for the receivers in , and the complement set is the set of indices of transmitters that carry messages for receivers outside . More precisely, .
Now, in order to prove Lemma 1 for linear interference networks, we use Lemma 3 with . The set of transmit signals is the set . Note that we can reconstruct if we can reconstruct the symbols . Assume w.l.o.g. that . We now apply Lemma 3 by designing the functions and such that we remove the contribution of the signals and from , to obtain the matrices that are used in Lemma 2. From these matrices, we can reconstruct the desired symbols almost surely, and hence, the statement of Lemma 3 holds.
The general version of this argument would use the fact that neighboring sets of receivers in do not overlap, , and then we obtain equations in at most variables. From Condition , we know that each variable appears in at least one unique equation (for almost all channel realizations), and hence the system of linear equations can be solved to obtain the signals
6 Discussion: Arbitrary Network Topologies
6.1 Receivers with Identical Neighboring Sets
There is a feature of linear interference networks that enables the proof of Theorem 1. When we look at the set that is used to prove that linear interference networks satisfy Condition , we note that the size of the complement set . In fact, for Condition to be satisfied, a necessary condition would be that . Now, let’s consider an extreme example where this necessary condition is violated for all choices of the receiver set . Consider a network where the following holds,
The network satisfying (14) is the fully connected network. Hence, using the same technique for proving a converse as in Section 5 would not yield a low upper bound on the DoF for fully connected networks. However, one can use a different argument for this network: All receivers in a fully connected network observe a linear combination of all transmit signals, but the coefficients of these linear combinations vary because of the different channel coefficients. However, since we are assuming that the channel coefficients are not known at transmitters and each is drawn independently from the same distribution, the following holds. If receiver can decode message for almost all channel realizations, then any other receiver will also be able to decode for almost all channel realizations, regardless of the choice of message assignment and coding scheme. Further, the same conclusion holds for any other message . It follows that the sum DoF is bounded by the sum DoF of a network that has transmitters and only one receiver, which is unity. Hence, transmitter cooperation cannot increase the DoF in fully connected networks as well, even if we are not restricted to linear cooperation schemes.
We can generalize the above argument for fully connected networks to any general topology. That is, whenever there are two or more receivers connected to the same set of transmitters, the sum DoF for messages intended at these receivers is unity. We haven’t used this fact in Section 5 because for linear interference networks, each receiver is connected to a unique set of transmitters.
6.2 Potential Cooperative Transmission Gains
Another way to look at our result for linear interference networks is that it is not useful to assign any message to a transmitter that is not connected to receiver . We do not know whether this conclusion holds for general network topologies. In particular, consider a network topology as the one depicted in Figure 3, where subnetworks and represent arbitrary sets of transmitters. Message is delivered in the first time slot to receiver through . Now, suppose that in the second time slot, we want to repeat the transmission of to cancel its interference at , without causing interference at because another transmitter in subnetwork is delivering a message to receiver in the second time slot. The only way to do this is to transmit from in the second time slot. However, we do not know whether this scenario can appear in an optimal coding scheme. We just provide this example to stimulate thinking about solving the problem for general network topologies.
6.3 Why Identical Channel Distributions
While we have not made an assumption on the coherence time of the channel in Section 2.1, we have assumed that all channel coefficients are drawn from the same distribution. This assumption was essential to our converse proof in Section 5 as well as the argument we made in Section 6.1. In this section, we consider an example where assuming that channel coherence time varies across channels that are observed at different receivers, leads to a different conclusion.
Consider the example -user network in Figure 4, and assume that is only available at transmitter . i.e., . If all channel coefficients are drawn from the same distribution, then the sum DoF is unity. The converse follows from the following argument. Assuming a reliable communication scheme, if receiver can decode , then it can remove the contribution of from , and consequently, obtain a statistically equivalent signal to . Hence, if receiver can decode , then so will receiver . Receiver can then remove the contribution of from , and finally obtain a statistically equivalent signal to . It follows that all messages can be decoded at receiver , and hence, the sum DoF is at most unity.
If we consider the scenario where the channels and (dashed green in Figure 4) have coherence time of unity but and (solid red in Figure 4) have coherence time of two, then DoF is achievable. The achievability scheme is based on achieving DoF in time slots. In the first time slot, all three transmit signals are active, and in the second time slot, transmitters and repeat their transmissions. Receiver then obtains two equations in and , and these two equations are linearly independent almost surely. Hence, receiver can decode both and . Since and remain constant over the two time slots, receiver can use its received signal in the second time slot, to cancel the interference received in the first time slot. It follows that all receivers can decode their desired messages over two time slots, and hence, DoF is achieved.
We characterized the asymptotic per user DoF for linear interference networks with no CSIT. We considered the possibility of transmitter cooperation by allowing for assigning each message to transmitters. Under the restriction to linear cooperation schemes, we proved that transmitter cooperation is not useful in the considered setting. To prove the result, we showed that the per user DoF for any value of can be achieved by assigning each message to a single transmitter and using an interference avoidance scheme.
We then discussed in Section 6 the extension of our result to general network topologies. We argued that the fully connected network admits the same conclusion about the utility of transmitter cooperation, even without the restriction to linear cooperation schemes. We then shed light on the difficulty of making the same claim to any network topology through an exemplary scenario. Finally, we showed through an example why changing the assumption of identical coherence time for all channel coefficients may lead to different conclusions and insights.
We do not know whether transmitter cooperation can be useful, from a DoF point of view, in any network topology where no channel state information is available at any transmitter. We are interested in attempting to answer this question in future work.
- S. Veetil, K. Kuchi and R. K. Ganti. (2015, Dec.). Performance of cloud radio access networks. [Online]. Available: http://arxiv.org/pdf/1512.05904v1.pdf
- A. Checko, H. L. Christiansen, Y. Yan, L. Scolari, G. Kardaras, M. S. Berger and L. Dittmann, “Cloud RAN for mobile networks - a technology overview,” IEEE Communication Surveys Tutorials, vol. 17, no. 1, pp. 405-426, First Quart. 2015.
- China Mobile, “Next generation fronthaul interface,” White Paper, Oct. 2015.
- The 5G Infrastructure Public Private Partnership. (2015, Jan.). 5G-Xhaul Project. [Online]. Available: https://5g-ppp.eu/5g-xhaul/
- O. Simeone, A. Maeder, M. Peng, O. Sahin and W. Yu. (2015, Dec.). Cloud radio access network: Virtualizing wireless access for dense heterogeneous systems. [Online]. Available: http://arxiv.org/abs/1512.07743.
- S. -H. Park, O. Simeone and S. Shamai. (2016, Jan.). Joint optimization of cloud and edge processing for fog radio access networks. [Online]. Available: http://arxiv.org/abs/1601.02460.
- A. Wyner, “Shannon-theoretic approach to a Gaussian cellular multiple-access channel,” IEEE Trans. Inf. Theory, vol. 40, no. 5, pp. 1713-1727, Nov. 1994.
- A. El Gamal, V. S. Annapureddy, and V. V. Veeravalli, “Interference channels with coordinated multi-point transmission: Degrees of freedom, message assignment, and fractional reuse”, IEEE Trans. Inf. Theory. vol. 60, no. 6, pp. 3483-3498, Mar. 2014.
- S. A. Jafar, “Topological interference management through index coding”, IEEE Transactions on Information Theory, vol. 60, no. 1, pp. 529-568, Jan. 2014.
- N. Naderi, A. El Gamal and S. Avestimehr, “Topological interference management with retransmission: What are the best topologies?,” IEEE International Conference on Communications (ICC), London, Jun. 2015.
- A. El Gamal, N. Naderi and S. Avestimehr, “When does an ensemble of matrices with randomly scaled rows lose rank,” IEEE International Symposium on Information Theory (ISIT), Barcelona, Jul. 2015.
- P. de Kerret and D. Gesbert. (2016, Feb.). Network MIMO: Transmitters with no CSI can still be very useful. [Online]. Available: http://arxiv.org/abs/1601.07399
- P. de Kerret and D. Gesbert, “Degrees of freedom of the network MIMO channel with distributed CSI,” IEEE Transactions on Information Theory, vol. 58, no. 11, pp. 6806-6824, Nov. 2012.
- X. Yi and D. Gesbert, “Topological interference management with transmitter cooperation,” IEEE International Symposium on Information Theory (ISIT), Honolulu, Jul. 2014.
- S. A. Jafar and A. J Goldsmith, “Isotropic fading vector broadcast channels: The scalar upper bound and loss in degrees of freedom,” IEEE Transactions on Information Theory, vol. 51, no. 3, pp. 848-857, Mar. 2005.
- M. Wigger, A. Lapidoth and S. Shamai. (2006.). On the capacity of fading MIMO broadcast channels with imperfect transmitter side information. [Online]. Available: http://arxiv.org/abs/cs/0605079.
- A. G. Davoodi and S. A. Jafar. (2014.). Aligned image sets under channel uncertainty: Setting a conjecture by lapidoth, shamai and wigger on the collapse of degrees of freedom under finite precision CSIT. [Online]. Available: http://arxiv.org/abs/1403.1541.