# SINR-Threshold Scheduling with Binary Power Control for D2D Networks

###### Abstract

In this paper, we consider a device-to-device communication network in which transmitter-receiver pairs are sharing spectrum with each other. We propose a novel but simple binary scheduling scheme for this network to maximize the average sum rate of the pairs. According to the scheme, each receiver predicts its Signal-to-Interference-plus-Noise Ratio (SINR), assuming all other user pairs are active, and compares it to a preassigned threshold to decide whether its corresponding transmitter to be activated or not. For our proposed scheme, the optimal threshold that maximizes the expected sum rate is obtained analytically for the two user-pair case and empirically in the general user-pair case. Simulation results reveal that our proposed SINR-threshold scheduling scheme outperforms ITLinQ [1], FlashLinQ [2] and the method presented in [3] in terms of the expected sum rate (network throughput). In addition, the computational complexity of the proposed scheme is , outperforming both ITLinQ and FlashLinQ that have complexity requirements. Moreover, we also discuss the application of our proposed new scheme into an operator-assisted cellular D2D heterogeneous network.

## I Introduction

Device-to-Device (D2D) refers to a wireless communication technology that enables direct communication between nearby devices. Establishing D2D communication links offers a means for offloading traffic over a cellular network. Once D2D communication links are connected and established, it is unnecessary to use the base station (BS) or other intermediate devices for data transmission. Driven by the prevalence of smart devices, the rapid growth of data load and internet of things, the forthcoming 5G aims at achieving significantly higher rates per unit area and significantly lower latency than the current LTE systems. Thus, the D2D technology is widely recognized, e.g., by 3GPP, as one of the key technologies for 5G. To achieve the promised D2D benefits in 5G, several challenges need to be addressed, such as D2D user detection and identification [4], D2D synchronization [5], wireless resource management [6], power control and interference management [7], and efficient handovers between cellular access and D2D [8]. In this paper, we focus on sharing the D2D channel among multiple user pairs and develop simple methods for power control and interference management.

### I-a The Problem

A D2D wireless network consisting of transmitter-receiver pairs is traditionally abstracted as a -user interference channel. Although the capacity characterization of the -user interference channel is still one of the most fundamental open problems in information theory, several recent discoveries have significantly advanced our understanding of the capacity limits, such as linear deterministic models [9] and interference alignment [10], almost all requiring global channel state information (CSI) be available at each user node.

As far as practical system designs are concerned, it is imperative to keep the encoding and decoding schemes as simple as possible. One such simple scheme in multiuser interference management is treating interference as noise (TIN) at the receiver. Recently, Geng et al. in [11] identified a TIN-optimality condition under which TIN is generalized degrees-of-freedom (GDoF) optimal and achieves the capacity region within a constant gap. However, the gap in the finite SNR regime could be large, particularly if the size of the network scales up. In addition, scheduling a small subset of users satisfying the TIN-optimality condition may not be necessarily the right metric for maximizing the expected sum rate in the network. Thus, the sum rate characterization of the -user interference channel remains open. In particular, selecting a subset of user pairs which results in the highest sum rate has not been fully solved yet. On this avenue, the problem we investigate in this work can be concisely expressed as follows: How to design a simple scheduling scheme with binary power control based on local (not global) CSI to achieve a higher sum rate than the state-of-the-art scheduling schemes?

### I-B The Prior Works

On multiuser scheduling, there are a few recent works considering SINR-based methods, such as [12] where a greedy algorithm was developed to improve the packet reception rate, but only an approximation of the optimal scheduling scheme is obtained in, e.g., [12, 13, 14]. Moreover, only a bound on SINR is derived and the ergodic sum rate is not characterized in [12]. Besides SINR-based methods, a SNR-based scheme was introduced in [7] and [3] where whether to activate a link or not depends on the direct link information only. Since the interference links are not taken into account, activating a user-pair which causes strong interference to the others would reduce the sum rate of the network.

Of the vast amount of literature on the sum rate characterization of a D2D network, the most closely related to this work are references [1, 2, 3]. Recently, Wu et al. proposed a scheme referred to as FlashLinQ in [2]. It is a multiuser scheduling scheme where a user pair is scheduled if that user pair meets the FlashLinQ condition. The key of FlashLinQ is to activate a user-pair if the received SINR is strong enough and deactivate them if the transmitter generates too much interference. Instead of testing the SINRs, Naderializadeh and Avestimehr proposed another scheme referred to as ITLinQ in [1]. Inspired by the TIN-optimality condition [11], they defined a new concept of information-theoretic independent sets (ITISs), which indicates the sets of links for which simultaneous communication and treating the interference from each other as noise is information-theoretically optimal (to within a constant gap). Based on this concept, they developed a new spectrum sharing mechanism, called information-theoretic link scheduling (ITLinQ), which at each time schedules those links that form an ITIS. It was demonstrated in [1] that ITLinQ can substantially improve over FlashLinQ. One great attribute of FlashLinQ and ITLinQ is that each user-pair is able to make the scheduling decision based on their local CSI. However, both schemes generate the active set incrementally, by checking the TIN type-optimality condition one user-pair at a time. Also, they require the presence of a central controller, which establishes a user-pair ordering that is to be used to generate the active user-pair set. As we elaborate in Section III, they both have computational complexity and substantial overheads, rendering them inefficient at this stage for practical D2D implementation. Built upon ITLinQ, Yi et al. proposed the ITLinQ+ scheme in [15] to achieve higher spectral efficiency via sophisticated non-binary power control.

To address the computational complexity burden, Kerret et al. developed a binary power control scheme for the interference channel in the framework of game theory. Specifically, each user-pair is selfishly turned on if the desired signal power is above a predetermined threshold. While the computational complexity of the method in [3], referred to as the SNR-based scheme, is reduced to , the sum rate performance is also worse than FlashLinQ and ITLinQ, due to the fact that the interference is not taken into account.

### I-C Contributions

In this paper, we propose a novel and quite simple SINR-threshold scheduling scheme with one-bit feedback and binary power control. Specifically, in a D2D network with transmitter-receiver pairs, the central controller of the network, e.g., a macro BS, broadcasts an optimal threshold to each receiver. Each receiver tests if its SINR, assuming all links are active, is above the given threshold based on its local CSI at the receiver (CSIR), different from the requirements of CSI at both the transmitter and the receiver for ITLinQ and FlashLinQ. Then each receiver feeds back this binary decision to its corresponding transmitter, so that the transmitter is either active in full power transmission or inactive. The predetermined threshold is a function of and it is broadcast to the users. In this work we derive the optimal threshold value (in terms of maximizing the expected sum rate) in closed form for user-pair case, assuming all channels are i.i.d. and Rayleigh distributed. We also empirically optimize the threshold for general -user case, involving more realistic wireless channel models, including pathloss and shadowing, etc. As our simulation-based sum rate analysis reveals, the proposed scheme outperforms the ones in [1, 2, 3]. For example, given the network with the parameters defined in [1] and , the simulation reveals that our scheme gains roughly 13, 75 and 128 sum rate increases compared to ITlinQ, FlashLinQ and the SNR-based scheme, respectively.

### I-D Significance

We next make a few important observations regarding the significance of this work. First, as mentioned earlier in this section, the sum rate characterization of D2D interference networks has attracted a lot of attention both in theory aiming at understanding the fundamental capacity limit via developing many ingenious ideas, and in practice with the goal of developing schemes as simple as possible to achieve the performance as higher as possible. Our work falls into the later category.

Second, our scheme outperforms in delivered sum rate of ITLinQ, FlashLinQ and the SNR-based scheme introduced in [1, 2, 3]. We also set forth two different scheduling approaches for improving user fairness at the cost of sum rate performance. At the same time, fairness should be considered under the umbrella of cellular, as the availability of cellular access provides an alternative to D2D for serving certain user pairs. In light of this observation, the sum rate appears to be a reasonable optimization metric for D2D networks.

Third, compared to FlashLinQ and ITLinQ, the computational complexity of our scheme is also significantly reduced from to . And last but not least, from the network-wide operational perspective, our scheme only needs the central controller to broadcast a SINR threshold to all the users in the network according to the network size, which is much simpler than FlashLinQ and ITLinQ.

## Ii System Model

Consider a wireless D2D network where there are transmitter-receiver pairs for , each node equipped with one antenna only, and each Tx aims to send one independent message to its intended Rx. Formulated as a -user interference channel, the system input-output relationship can be characterized by the following equation:

(1) |

where represents the received signal at Rx at time ; represents the transmitted signal from Tx at time satisfying the power constraint ; denotes the i.i.d. additive white Gaussian noise (AWGN); represents the complex channel coefficient from Tx to Rx. We assume that the channel coefficients ’s are drawn from a continuous distribution, which will be specified in detail in Section IV and Section V, and they stay constant during the entire transmission once they are drawn. We also assume that all the transmitter-receiver pairs share a common wireless medium, i.e., given the same chunk of frequency-time resources, we need to deal with considerable multiuser interference. In this work, we assume that local CSI is available at each receiver, i.e., is known to Rx. In practice, this can be accomplished by training the channels via sending a pilot symbol from each transmitter to all receivers at a time and allowing each receiver for channel estimation.

Next, we introduce the formal definition of binary power control aiming at maximizing the expected sum rate based on the local CSI at each receiver.

### Ii-a Binary Power Control

Consider the Best Response (BR) approach introduced in [3], and define the binary power control function at Tx as:

(2) |

where represents the feedback function from Rx to Tx, and the optimal power control scheme can be written as

(3) |

where indicates the set corresponding to all possible power control functions .

This optimization problem is a typical Team Decision problem [16] due to the fact that each transmitter aims to maximize the ergodic sum rate based on their individual channel information. To simplify this optimization problem, a modified version of BR for the case was defined in [3] and is rewritten as follows:

Definition 1 [3]: are the best response power control functions if they satisfy

(4) | ||||

## Iii The Proposed SINR-Threshold Scheduling Scheme

Since resolving the optimization problem (3) is complicated, we focus on a smaller functional space called a threshold function. In addition, to reduce the feedback cost, we impose the constraint that each feedback function has up to one bit only, i.e., its entropy is upper bounded by one. In this section, we propose a novel and very simple SINR-threshold scheduling scheme based on local CSIR for the binary power control problem. The scheme consists of the learning phase, the scheduling phase and the communication phase.

### Iii-a The Learning Phase

In this phase, each Rx acquires its local CSI of , by reading the pilot symbol sent by one transmitter every time. Then, all users predict their SINRs by assuming all links to be active. The predicted SINR at Rx is calculated as follows:

(5) |

### Iii-B The Scheduling Phase

After completing the learning phase, each Rx compares its SINR with the threshold which is prior assigned by, e.g., the macro-cell BS to each receiver. Then each receiver distributively determines whether to activate its corresponding transmitter or not according to the following definition.

Definition 2 (The SINR-Threshold Scheduling with Binary Power Control): We choose the feedback function as an indicator function , and a functional subset is defined as:

(6) |

where is the indicator function with if and if .

After the value of is fed from Rx back to Tx^{1}^{1}1The availability of feedback can be accomplished via either the feedback channel from the receiver to its transmitter or the help of the macro-cell BS through uplink and then downlink cellular transmission., the transmitter Tx determines its status in the next phase of data transmission via the mapping function . Specifically, Tx will be activated with full power if the received SINR at its corresponding receiver is above its preassigned threshold; Otherwise Tx will keep silent. Thus, only the user pairs in the subset are scheduled for transmission given the channel realizations .

Remark 1: Since the feedback is an indicator function, it contains up to one bit only. Also, the SINR threshold depends on both the desired signal power and interference strength. In contrast, the threshold in [3] depends on the CSI of the desired link only (i.e., the SNR). Thus, one can expect that the sum rate of our scheme outperforms that in [3].

### Iii-C The Communication Phase

After determining the subset of user pairs for scheduling, the scheduled user-pair can achieve the following rate^{2}^{2}2Even without CSIT, the rate in (7) can be achieved arbitrarily closely with HARQ at the cost of decoding delay, if the traffic is not delay sensitive. by using TIN as the decoding scheme:

(7) |

Thus, the following sum rate and the ergodic sum rate are achievable:

(8) | |||||

(9) |

Finally, the optimal sum rate of the network offered by our scheme is characterized by the optimization problem:

(10) |

Remark 2: Consider the computational complexity of our scheme, ITLinQ and FlashLinQ. Since they all require local CSIR which can be obtained with the linear complexity, we do not consider the cost of acquiring CSI and the corresponding SINR values, but consider the scheduling decision making only. In our scheme, each receiver only needs to compare its SINR to the given threshold for once, so that the total computational complexity of user-pairs is given by . In contrast, in both ITLinQ and FlashLinQ, when we check whether or not to add a new user-pair into the subset including user pairs chosen for scheduling, we have to check their corresponding conditions at each transmitter and each receiver in that subset, and schedule the new transmitter-receiver pair if they both satisfy the condition. This results in the total complexity up to , i.e., . Thus, the computational complexity of our proposed scheme outperforms both ITLinQ and FlashLinQ.

Based on the proposed scheme, it can be seen that to achieve the maximum sum rate in (10), we need to find out the value of the corresponding optimal threshold . To do this, we will begin with deriving the closed form expression of the expected sum rate for the case in Section IV, and then proceed to evaluating the expected sum rate for the general -user case via simulation in Section V, followed by a few discussions.

## Iv Optimal Threshold Selection

In this section, we first analytically derive the optimal threshold for . For the general -user case, due to the difficulty of expressing the closed form ergodic rate in terms of the threshold, the optimal threshold can be numerically obtained based on search over the effective SINR regime.

For , to simplify the problem (10) as much as possible, we assume the channel coefficients ’s are i.i.d. and follow the Rayleigh distribution , and the noise is normalized to unit power , the same assumption as in [3]. Under this setting, we have the following lemma:

Lemma 1: Suppose are power control functions, then there exists a pair so that .

###### Proof.

The proof follows directly from [3] where we replace the SNR threshold with the SINR threshold in this paper. ∎

To maximize the ergodic sum rate in (10), we will develop the analytical expression of the sum rate in (10) for , and then find out the optimal threshold. For brevity, we rewrite the mapping function as follows:

(11) |

where for follow the exponential distribution with mean one. Hence, the ergodic sum rate is given by:

(12) | |||||

(13) | |||||

(14) |

where the first equal sign in (13) is due to the fact that the rates for the two users are statistically the same. Since is a binary number, we can continue to rewrite as follows

(16) | |||||

where . Furthermore, we define:

(17) | ||||

By substituting into (16), can be further written in the following compact form:

(18) |

Note that given the power , depends on the threshold only. To find the optimal threshold , we take the first derivative of w.r.t. and solve . While the closed form expression of is difficult to derive, it can be solved by applying many numerical algorithms such as the Newton method and the gradient descending algorithm, and the result can be easily verified via simulation.

For the general -user case, we resort to simulations. In particular, we use to approximate by letting be large enough where is the total number of randomly drawn channel realization sets and represents the set for . In addition, when the user distance, channel fading and shadowing are taken into account, the objective function is not convex and even not continuous w.r.t. due to use of the indicator function. Thus, we need to develop a new method to find the global optimal in Problem (10). We state our result as follows.

Lemma 2: There exists an optimal so that , and can be obtained in .

###### Proof.

We show first the converse and then the achievability.

(Converse) Recall the scheduling policy in Definition 2 where user-pairs are scheduled only if their SINRs are no less than . That is, once a realization set is given, the predicted SINR at each receiver is determined. Let us sort the SINRs as SINR SINR SINR where maps to the index of the user pair which has the smallest value of SINR. It can be easily seen that for , is a continuous function of . Thus, given channel realization sets , is still piecewise continuous of . Also, note that the effective SINR regime to choose from is bounded by the smallest and the largest values of SINRs obtained from receivers over times. For a piecewise continuous function on a bounded regime, is also upper bounded.

(Achievability) For , is not only continuous but also piecewise constant valued w.r.t. . Hence, when increases, can achieve a new value only when hits an SINR value for . Thus, given channel realization sets , we only need to calculate when , i.e., the SINRs when is given. Since there are users and channel realization sets for simulation, the optimal threshold can be found out from the corresponding largest in . ∎

## V Performance Analysis

In this section, we will numerically compare the performance of the SINR-threshold scheduling scheme proposed in this paper with ITLinQ, Fair ITLinQ, FlashLinQ and the SNR-based scheduling scheme studied in [1, 2, 3] in terms of the sum ergodic rate and the CDFs of the user rates for the general -user D2D network depicted in Fig. 1. Note that choosing these two metrics is consistent with [1]-[2] for a fair comparison. As far as the parameter setting is concerned, we consider the size of the area is given by mm, and there are transmitter-receiver pairs randomly dropped. For fair performance comparison, the same as in [1], we consider the distance between each transmitter and its receiver is drawn from the uniform distribution . Furthermore, we assume that the maximum transmit power for each user is given by dBm, and the noise power spectral density is respectively. The noise figure is set to dB, and the antenna gain per device is assumed to be dB. Moreover, we assume that the carrier frequency is GHz and the bandwidth is MHz. In addition, we assume that all antennas heights are set to be m. As far as path loss is concerned, the transmission power loss in dB value at distance can be modeled the same as [1] as follows

(19) |

where , , and , , represent the BS antenna height, the mobile antenna height, and the transmission wavelength, respectively.

### V-a The Expected Sum Rate Comparison

Fig. 2 demonstrates the average sum rate of our proposed scheme, ITLinQ [1], FairITLinQ [1], FlashLinQ [2] and the SNR-based scheduling scheme [3]. Regarding the ITLinQ scheme, to have a fair comparison, we consider the optimal value for parameter of ITLinQ (which captures the interplay between the desired signal power and strongest interference power, see [1]). For FairITLinQ, we consider following setting of parameters: dB, dB, dB and (see [1]). As far as FlashLinQ is concerned, we follow similar implementation considered in [2] with dB. As Fig. 2 shows, the sum rate of our proposed scheme always outperforms all the other schemes. In particular, our scheme can gain roughly , , and rate increases compared to ITlinQ [1], FairITLinQ [1], FlashLinQ [2] and SNR-based scheme [3], respectively, in the setting with .

Fig. 3 provides the corresponding CDF curves of all the schemes shown in Fig. 2. It can be seen the sum rate gain of our scheme is at the cost of user fairness. For example, the proposed scheme deactivates roughly of user pairs, significantly higher than of ITLinQ and of FlashLinQ. However, as mentioned earlier in this paper, fairness in a D2D network only should not be a fatal issue, because fairness should be considered under the umbrella of cellular heterogeneous networks.

### V-B Discussion: Trade Sum Rates for the User Fairness

Although the fairness is not our focus in this work, we still provide two potential promising approaches which are able to improve the user fairness at the cost of, unsurprisingly, the sum rates. We present the two approaches as follows.

#### V-B1 Modified Proposed Scheme 1 (Enforcing A Portion of Links to be Activated)

The idea is to enforce partial user links to be activated, no matter if their received SINRs are strong enough or not. For the remaining user pairs, we directly apply our scheme considering the interference generated by the enforced user pairs simultaneously.

Consider an example where of user links are enforced to be activated in a Round Robin manner. The average sum rate and the user rate CDF curves for are shown in Fig. 4 and Fig. 5, compared to our originally proposed scheme and ITLinQ. It can be easily seen that the number of inactive user links reduces from to because each user has a chance to talk due to Round Robin scheduling. Also, although we lose a certain sum rate compared to our proposed original scheme, we can still achieve higher sum rate than other schemes in [1, 2, 3] while keeping the computational complexity benefit.

#### V-B2 Modified Proposed Scheme 2 (Reducing Threshold to Activate More Links)

The idea is to reduce the threshold from the optimal value by a certain level, so that more user pairs could be scheduled.

Consider as an example where is the optimal threshold according to our original scheme, is a constant to be designed, and is the threshold that we apply in this modified scheme. The average sum rate and the user rates CDF curves for are shown in Fig. 4 and Fig. 5 and compared to ITLinQ and FlashLinQ. Since decreasing the threshold results in more fairness at the cost the sum rate, the offset can be tuned to gain a tradeoff between the sum rate and the user fairness. Under our simulation setting and consider as an example. When we choose , Fig. 5 reveals that the user fairness of this modified scheme can be also improved compared to the original scheme, and we still have the sum rate gain, roughly more than ITlinQ and the computational complexity benefit.

Remark 3: Observations of Fig. 5 reveal that when user rates are very close to zero, the modified propose scheme 1 outperforms both Fair ITLinQ and FlashLinQ in terms of fairness. On the other hand, from the operational perspective, all the schemes identified in Fig. 5 are not very efficient in terms of fairness, since roughly of the users cannot achieve rate significantly larger than zero. One possible method is to schedule a subset of users instead of considering all users (corresponding activity fraction equal to one) during each slot.

### V-C Thresholds for Network Operation

Since the optimal threshold developed from Section IV is a function of the network size , it can be predetermined in the network design. Based on our approaches in Section IV, Fig. 6 demonstrates the optimal threshold values for different values. When the D2D network is being operated, the macro BS only needs to first find the threshold values according to the network size, and then broadcast this value to all users in the D2D network. Meanwhile, the thresholds of the modified schemes 1 and 2 introduced above are also shown in Fig. 6.

### V-D Cellular-assisted D2D Network Operation

Observations of the user fairness result shown in Section V reveal that all the schemes identified in Fig. 5 are not efficient. However, as mentioned earlier in this paper, fairness by itself is not a fatal issue due to the fact that fairness in D2D networks should be considered under the umbrella of cellular heterogeneous networks, i.e., each user-pair can be activated in both either D2D or cellular bands. Due to the space limitation and since the user fairness is not the focus of this work, we will briefly discuss the cellular-assisted D2D heterogeneous networks, and defer the detailed analysis into the future work.

We consider a simple example of a cellular-assisted D2D heterogeneous network where in the D2D network, the rate of user is given by . On the other hand, in the cellular network, there are cells, each with one BS in the cell center, and each BS schedules user at each time. After BS-user association and load balancing, each scheduled user is associated with one BS only. Meanwhile, we assume that the nominal user rate provided by the cellular network is given by , implying that the ergodic user rate provided by the cellular network is given by . Suppose the total bandwidth is , and we orthogonally allocate the bandwidth to the cellular network, denoted by , and the D2D network, denoted by . Then the rate is achievable for user via time-sharing between the two rates provided by cellular and D2D, respectively. By doing so, each user can independently choose either D2D or cellular access at each time, and most of the users whose rates in the D2D network are very close to zero can still be served in the cellular network, so as to alleviate the user fairness.

While the idea of time sharing is very simple and easy to operate, the achievable rate can further be significantly improved by jointly designing user scheduling between D2D and cellular, in particular when we take into account the pathloss and channel fading of the cellular transmission.

## Vi Conclusion

In this paper, we introduced a novel but quite simple binary scheduling scheme based on SINR-threshold scheduling. The scheme was based on treating interference as noise at each receiver and SINR-threshold scheduling with binary power control. In particular, the SINR at each receiver is predicted assuming all the other user-pairs are active. This SINR prediction is then compared to an optimal preassigned threshold in order to determine whether or not to activate the individual link. Subsequently, the receiver feeds back this one-bit decision information to its corresponding transmitter, so that the transmitter is either activated with full power or silent for data transmission. As we showed by both analysis and system level evaluations, when compared to the prior schemes such as ITLinQ [1], Fair ITLinQ [1], FlashLinQ [2] and the SNR-based method [3], our proposed scheme outperforms them in terms of sum rate. In addition, the computational complexity of the proposed scheme is lower than ITLinQ and FlashLinQ and on par with the SNR-based method.

Acknowledgment: This work is in part supported by NSF grant NETS-1419632 and ONR award N000141612189.

## References

- [1] N. Naderializadeh and A. S. Avestimehr, “Itlinq: A new approach for spectrum sharing in device-to-device communication systems,” in 2014 IEEE Int. Symposium on Information Theory, June 2014, pp. 1573–1577.
- [2] X. Wu, S. Tavildar, S. Shakkottai, T. Richardson, J. Li, R. Laroia, and A. Jovicic, “Flashlinq: A synchronous distributed scheduler for peer-to-peer ad hoc networks,” IEEE/ACM Transactions on Networking, vol. 21, no. 4, pp. 1215–1228, Aug 2013.
- [3] P. de Kerret, S. Lasaulce, D. Gesbert, and U. Salim, “Best-response team power control for the interference channel with local csi,” in 2015 IEEE Int. Conf. on Communications (ICC), June 2015, pp. 4132–4136.
- [4] J. Hong, S. Park, and S. Choi, “Neighbor device-assisted beacon collision detection scheme for d2d discovery,” in 2014 Int. Conf. on Info. and Comm. Tech. Convergence (ICTC), Oct 2014, pp. 369–370.
- [5] F. Berggren and B. M. Popovi?, “Primary synchronization signal for d2d communications in lte-advanced,” IEEE Communications Letters, vol. 19, no. 7, pp. 1241–1244, July 2015.
- [6] Z. H. C. Xu, L. Song, “Resource management for device-to-device underlay communication,” arXiv: 1311.1018v1, 2013.
- [7] N. Lee, X. Lin, J. G. Andrews, and R. W. Heath, “Power control for d2d underlaid cellular networks: Modeling, algorithms, and analysis,” IEEE J. on Selected Areas in Comm., vol. 33, no. 1, pp. 1–13, Jan 2015.
- [8] X. Shen, “Device-to-device communication in 5g cellular networks,” IEEE Network, vol. 29, no. 2, pp. 2–3, March 2015.
- [9] A. S. Avestimehr, S. N. Diggavi, and D. N. C. Tse, “Wireless network information flow: A deterministic approach,” IEEE Transactions on Information Theory, vol. 57, no. 4, pp. 1872–1905, April 2011.
- [10] S. A. Jafar, “Interference alignment – a new look at signal dimensions in a communication network,” Foundations and Trends® in Communications and Information Theory, vol. 7, no. 1, pp. 1–134, 2011.
- [11] C. Geng, N. Naderializadeh, A. S. Avestimehr, and S. A. Jafar, “On the optimality of treating interference as noise,” IEEE Transactions on Information Theory, vol. 61, no. 4, pp. 1753–1767, April 2015.
- [12] P. Santi, R. Maheshwari, G. Resta, S. Das, and D. M. Blough, “Wireless link scheduling under a graded sinr interference model,” in Proc. of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing, 2009, pp. 3–12.
- [13] G. Brar, D. M. Blough, and P. Santi, “Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks,” in Proc. of the 12th annual international conference on Mobile computing and networking, 2006, pp. 2–13.
- [14] ——, “The scream approach for efficient distributed scheduling with physical interference in wireless mesh networks,” in Proc. of the 28th Int. Conf. on Distributed Computing Systems, June 2008, pp. 214–224.
- [15] X. Yi and G. Caire, “Optimality of treating interference as noise: A combinatorial perspective,” IEEE Transactions on Information Theory, vol. 62, no. 8, pp. 4654–4673, Aug 2016.
- [16] Y.-C. Ho and K.-C. Chu, “Team decision theory and information structures in optimal control problems – part I,” IEEE Transactions on Automatic Control, vol. 17, no. 1, pp. 15–22, Feb 1972.