Mobile Information Systems

Mobile Information Systems / 2017 / Article
Special Issue

Embedded IoT Systems: Network, Platform, and Software

View this Special Issue

Research Article | Open Access

Volume 2017 |Article ID 7652902 | 10 pages | https://doi.org/10.1155/2017/7652902

Virtual MIMO Beamforming and Device Pairing Enabled by Device-to-Device Communications for Multidevice Networks

Academic Editor: Jeongyeup Paek
Received23 Nov 2016
Accepted30 Jan 2017
Published21 May 2017

Abstract

We consider a multidevice network with asymmetric antenna configurations which supports not only communications between an access point and devices but also device-to-device (D2D) communications for the Internet of things. For the network, we propose the transmit and receive beamforming with the channel state information (CSI) for virtual multiple-input multiple-output (MIMO) enabled by D2D receive cooperation. We analyze the sum rate achieved by a device pair in the proposed method and identify the strategies to improve the sum rate of the device pair. We next present a distributed algorithm and its equivalent algorithm for device pairing to maximize the throughput of the multidevice network. Simulation results confirm the advantages of the transmit CSI and D2D cooperation as well as the validity of the distributive algorithm.

1. Introduction

The Internet of things (IoT) connecting billions of devices is anticipated to make our society smarter by collecting the remotely sensed data from the devices and actuating the devices autonomously based on the collected data [1, 2]. The networks for the IoT would connect the devices not only to an access point (AP) but also to neighboring devices through direct communication links, which are often observed in machine-to-machine (M2M) and device-to-device (D2D) communications [35]. In addition, the direct links are controlled by the network as a whole or in part to guarantee the quality-of-services.

This paper utilizes the direct links of M2M and D2D communications to assist the information transfer from an AP to the devices through cooperation. There exist various cooperation methods such as amplify-and-forward (AF), decode-and-forward (DF), compress-and-forward (CF), and their variations to enlarge the coverage area or to improve the reliability of information delivery [69]. Among the methods, CF-based receive cooperation has attracted attention recently as a method of improving the system capacity by forming a virtual multiple-input multiple-output (MIMO) configuration with single-antenna devices [1013].

The CF-based receive cooperation is considered for an AP with two antennas supporting two devices in [10, 11] from the aspect of physical layer designs with adaptive modulation and coding. A higher layer issue of device matching and resource sharing has been studied for the network with multiple devices in [12, 13], where a distributive message passing algorithm is derived based on the bargaining in exchange networks [1418]. These studies have shown that the CF-based receive cooperation not only enjoys a proximity gain of the closely located devices but also provides a flexibility in the design of the D2D links by allowing any type of physical layer standard for the D2D links.

This paper proposes a network-assisted D2D communication network as one wireless communication platform for the IoT, which forms the virtual MIMO with multiple-antenna devices to enhance the rate from the physical layer aspect and implements the distributed device pairing algorithms to improve the overall network throughput. The contributions of this paper are summarized as follows. Firstly, the beamforming (BF) and power allocation (PA) strategies exploiting the transmit CSI are proposed for the virtual MIMO to improve the rate performance of the downlink physical layer. Secondly, several distributive algorithms for device pairing are derived from the bargaining [15] and auction [19] to provide the network throughput equivalent to that of the optimal pairing. Thirdly, we verify the synergy of combining the virtual MIMO and device pairing algorithms under various system configurations in the scenario of IoT with D2D communications. It should be further noted that the D2D-assisted virtual MIMO with its enhancements can be adopted in the mobile cellular networks providing the proximity services [4] and the distributive pairing algorithms can be combined with various cooperation strategies among the devices for information sharing and processing [9].

The rest of this paper is organized as follows. After providing notations used in this paper, we describe the system model with and without D2D cooperation in Section 2. Section 3 investigates several methods to improve the sum rate of the two devices in D2D cooperation. Device pairing algorithms are devised from bargaining and auction to maximize the network throughput in Section 4. The performance of the network is evaluated in different aspects in Section 5 followed by the concluding remarks in Section 6.

Notations. We denote by , , , and the transpose, Hermitian, trace, and th element of a matrix , respectively; denotes the diagonal matrix with diagonal vector , denotes the identity matrix, and denotes the matrix with all-zero elements. We denote by the space for complex matrices. The operator denotes the expectation, signifies “distributed as,” and denotes the distribution of a vector with complex Gaussian elements with mean and covariance matrix .

2. System Model

Consider an IoT network with an AP and devices as described in Figure 1(a), where the AP is equipped with transmit antennas and each device is equipped with receive antennas. We consider asymmetric antenna configurations as , which are often encountered in practical scenarios with high complexity APs and low complexity IoT devices. The downlink (DL) from the AP to the devices utilizes a licensed spectrum of bandwidth for long-range communications, while the D2D links utilize an unlicensed spectrum of bandwidth for relatively short-range communications as shown in Figure 1(b); although an unlicensed spectrum is also available at a very higher frequency as 60 GHz, we limit our description to an unlicensed spectrum at a carrier frequency below 6 GHz which has a propagation model similar to that of the licensed spectrum. The DL frame is divided into equilength time slots, each of which is dedicated to each device to be shared with the paired device.

The channel from the AP to device is modeled by the channel response matrix . The component vector is modeled as , where is the path-loss at device determined by the distance from the AP, path-loss constant , and path-loss exponent , and is the log-normal random variable reflecting the shadowing. The D2D link from device to device is described by the channel matrix , where and is the path-loss between devices and at distance . The channel reciprocity holds in D2D links as . This paper assumes that the AP has the perfect CSI on the channels . The network pairs the devices for signal transmission with transmit beamforming (BF) over the time slots allocated to the devices. Without D2D receive cooperation, the network supports MIMO from the AP to each device in the pair. If the devices in the pair participate in D2D receive cooperation, the network forms virtual MIMO from the AP and each device in the pair which can support spatially multiplexed symbols.

Let devices and be paired for signal transmission over their time slots with transmit BF . The transmit symbol vector for devices is modeled as where is the transmit power of the AP, are the symbol vector with , and is the scaling factor satisfying the transmit power . The corresponding received signal vector at device is expressed as where is the background-noise vector at device .

With D2D cooperation that exchanges the compressed versions of the received signals between the paired devices, the received signals available at device are given by where is the channel matrix of the pair and with . Here, is a vector of noises that the compression in D2D cooperation incurs. With Voronoi vector quantization, the compression noises can be modeled as zero-mean complex Gaussian with [10], where and is bounded from the rate-distortion theory [20] as where is the source coding rate employed at device for compression of . Therefore, we have Under this model, the network employs the transmit BF at the BS; that is, and , where is the matrix constructed with the first columns of from singular value decomposition (SVD) of the pair channel matrix . Device receiving signals in (3) through D2D cooperation uses the receive BF such that With D2D cooperation, the transmit symbol vector can be devoted to symbol transmission, for device only, for device only, or for both, according to the resource allocation.

For comparison, we consider the system without D2D cooperation. Up to symbols can be multiplexed for each device at the AP as , where is the symbol vector for device . The transmit BF without D2D cooperation can be designed as by means of the block diagonalization (BD) method to decode from (2) at device as in [21]. To be specific, is designed to be orthogonal to but to be steered to as , where is the submatrix of corresponding to the null space of and is the submatrix corresponding to nonzero eigenvalues from the right unitary matrix of . The design of is obtained in a similar way. Therefore, we have and . By applying to at device , we have It should be noted that received signals are available at each device, while received signals are available at each device, and thus BF strategies are different.

3. Improvement of Sum Rate of a Device Pair

With D2D cooperation, the sum rate achieved by the pair is a linear combination of rates , delivered to device when the two time slots are devoted to device , and , delivered to device when the two time slots are devoted to device . The sum rate achieved by a device pair is given by where nonnegative factors and denote the fractions of the two time slots allocated to devices and , respectively, subject to . Here, is given by from (7), where and The rate delivered to device is also obtained in a similar form by exchanging and .

To improve the rate (12), we need to reduce or equivalently given in (4). We can reduce by increasing the source coding rate as much as possible. The source coding rate for device to compress the received signal samples to be forwarded to device is limited by the channel capacity of the D2D link, where and are the transmit power and noise power of the device, respectively. Specifically, for the forwarded samples to be recovered at device without errors, their transmission rate over the D2D link should not exceed . Therefore, the source coding rate is upper-bounded by where is the bandwidth ratio.

With the maximum source coding rate, the variance of the compression noise is given by from (4) and (15). From (16), we can suggest some strategies to improve the sum rate achieved by a device pair in D2D cooperation. Firstly, the compression nose variance decreases exponentially as the bandwidth expansion increases. For the fixed bandwidth expansion ratio as , the compression noise variance is reduced when the D2D link quality is much better than the DL quality in an average sense as

We further improve the sum rate of the device pair by applying power allocation (PA) such that and . In the case, the sum rate of the device pair is given by which is maximized by applying the water-filing algorithm with the information on [20]. Although the CSI on is available at the AP, the noise variance is not easy to be informed to the AP since it depends on the transmit signal and D2D link qualities. Therefore, the AP can compute the PA with water-filling algorithm by assuming . This sum rate of the device pair becomes the maximum when or equivalently when .

For comparison, the achievable sum rate of pair using two slots without D2D cooperation is given by , where from (10), where .

4. Distributed Pairing Algorithms

This section aims at forming the pairs to maximize the average normalized throughput of the network. The problem is formulated aswhere is the matrix with . The pairing indicator is given by when devices and are paired and , otherwise.

We first solve the problem by using a distributed algorithm based on Nash bargaining as proposed in [12] not only to maximize the average throughput but also to satisfy each device’s desire to obtain the best bargaining gain. We then derive the auction algorithms for device paring which are equivalent to the bargaining algorithm.

4.1. Bargaining Algorithm Based on Message Passing

The problem is described by a graph in an exchange network [14], where is the set of vertices corresponding to the devices and is the set of edges corresponding to the D2D links among the devices. The edge connecting vertices and is associated with a positive weight which corresponds to the sum rate of the device pair ensured by any sharing policy ; without knowing in advance, we estimate the sum rate of the device pair pessimistically with the minimum value.

Let denote a configuration of the device pairing and resource sharing, where is a matching described by in graph and is the set of the rates that the devices can obtain from the matching . The solution is obtained with a balanced configuration [14] satisfying the stability for device pair contained in the matching and the balancefor all , where is the set of neighbors of device .

This stable balanced configuration can be found by a distributed algorithm based on a message passing (MP) framework [17, 18, 22, 23], where each device transfers a nonnegative message on the current best alternative in device matching to its neighbors at each time instant. Let denote the message from device to device at time , representing the resource share which is guaranteed for device in the pair . That is, is an alternative rate that device can obtain maximally up to time instant when pairing with its neighbor except for . Initially, is set to zero for all since there is no guarantee ensured by the neighboring devices initially. Based on the alternative rate, an individual device makes an offer to each of its neighbors for D2D cooperation, where the offer from device to device is computed asWith the offers from the other devices, device estimates its maximal rate usingThe update rule for is given by where is an estimate of the rate guaranteed for device and is the damping factor [12]. With the updated , the repeated updates of and proceed using (24) and (25), respectively. The iteration continues until converges for all available pairs . Let , , and denote the corresponding values to which , , and converge, that is, a fixed point of the algorithm. Upon convergence, device sets its share to and chooses device with as its partner. From , the device obtains the resource sharing factor . This procedure is summarized in Algorithm 1.

(1) Set for .
(2)  repeat
(3)   At device , update offer using (24) for and send it back to device
(4)   On receipt of for all devices, update using (25).
(5)   At device , update alternative rate using (26) and send it back to device .
(6)    .
(7)   until   All messages converge or max number of iterations are reached.
(8) At device , fix and for all to determine using (25), and find partner
  device such that .
4.2. Equivalent Auction Algorithm for Device Pairing

The auction algorithm finds the maximum weighted matching (MWM) via an auction, based on the notion of buyers and prices [19]. The MWM corresponds to the optimal pairing providing the maximum throughput so that we briefly describe the auction algorithm in terms of messages defined in the previous section.

We can set the alternative rate to the price which buyer pays to buy product and set the sum rate to the value of product , respectively. The benefit that can be earned when buyer buys product is given by . The goal is to find the assignment of all buyers and products that maximizes the overall benefit, that is, . Therefore, the sum of the prices is constant and the MWM maximizes the overall benefit [15]. To handle this problem, the auction algorithm proceeds as in Algorithm 2. This algorithm is known to converge to the MWM if a solution exists [15, 19].

(1) Set for .
(2)   repeat
(3)   At device , calculate
,
,
,
     and update offer using with a certain positive constant and send it to device .
(4)     On receipt of at each device , calculate alternative rate gain using (26) and send it back to device .
(5)      .
(6)   until   All messages converge or max number of iterations are reached.
(7) At device , fix and for all to determine using (25), and find partner device such that .

In this algorithm, the maximum is taken over all incoming when updating . In addition, device does not bid at every iteration and to every neighboring device, thereby slowing down the convergence speed. Also, the auction algorithm works only for a bipartite network where one class of buyers is assigned only to the other class of products. Thus, the algorithm should be modified to allow the MWM for nonbipartite network where buyers can also become products. Note that, in a nonbipartite network, the net benefit of device corresponds to the price that device should pay to form a pair . Subsequently, device does not necessarily consider the offer from device to determine the price that device should pay for pairing. To all of those objectives, the auction algorithm is modified to obtain a new algorithm running in a nonbipartite network, and the resulting algorithm is summarized in Algorithm 3.

(1) Set for .
(2)   repeat
(3)  At device , update offer for using and send it back to device .
(4)  On receipt of for all devices, update using (25).
(5)  At device , update alternative rate gain using (26) for and send it back to device .
(6)  .
(7)   until   All messages converge or max number of iterations are reached.
(8) At device , fix and for all to determine using (25), and find partner device such that .

In this algorithm, device can bid to all neighboring device at each iteration instead of updating by adding a small constant . Here, note that the auction algorithm in this subsection bears very close resemblance to the bargaining algorithm in Section 4.1. If we drop the second term in (24), which corresponds to dividing the surplus rate gain equally, we end up with Algorithm 3. Thus, the developed algorithm only differs from the modified auction algorithm in that it includes an extra term that reduces “offers” by half the surplus rate gain. In fact, this algorithm is proved to converge to the MWM if a unique solution exists using the same technique as [12].

We now consider the generalization of the message update rule for (24) asWe see that (27) leads to the bargaining algorithm in Section 4.1 with and the modified auction algorithm with , respectively. In fact, for , the corresponding algorithm finds the MWM if a unique solution exists. This statement can be proved using the technique in [16]. Thus, the distributive algorithms provided in this work can also find the MWM.

5. Numerical Results

We evaluate the performance of the network with devices when  dBm,  dBm,  MHz, and  dBm. The devices are clustered in the circle of radius of which the center is located at distance from the AP. In the circle, the location of the devices is randomly generated with uniform distribution. The SNR at the center of the cluster circle is denoted by for a reference parameter. We assume the unlicensed spectrum of bandwidth  MHz,  MHz, and  MHz for , , and . The path-loss exponent is set to and the shadowing deviation is set to 10 dB for both the licensed and unlicensed spectrums.

Figure 2 shows the performance of the cluster with  m and  m as the cluster center SNR varies when , , , and in dB. In the figure, “D2D-PA” and “D2D” indicate the proposed schemes with water-filling PA and equal PA, respectively, while “No D2D” denotes the BD-based BF without D2D cooperation and “D2D (No CSI)” indicates the D2D cooperation without the transmit CSI; here, “D2D (No CSI)” applies the zero-forcing receive BF at the devices. For the benchmark, we also provide the performance with ideal D2D link (“Ideal”) having no compression noise, or equivalently . The lines in the figure correspond to the results with optimal device matching obtained by finding the maximum value after searching for all possible pairing configurations while the marks correspond to the results with the distributive algorithm presented in the paper. The figure shows that the distributive algorithm provides the performance almost indistinguishable from the optimal performance. The transmit CSI on the DL improves the average throughput for both cases of the network with D2D cooperation and with no D2D cooperation. The best performance is achieved with “D2D-PA” exploiting the transmit CSI and D2D cooperation.

Figure 3 illustrates how the pairs are matched by the distributive bargaining algorithm for a single channel realization generated in Figure 2 when  dB. The left and right subfigures describe a matching of “D2D” and “No D2D,” respectively, for the same channel realization. The numbers inside the squares identify the devices and the numbers near to edges of the same color are the sum rates (weights) of the device pairs associated with the edges. We also show the rates (shares) of the devices near to the devices in Figure 3(a). Note that “D2D” can support the rates of the devices by choosing the resource sharing factors while “No D2D” cannot support them. With D2D cooperation, the devices in proximity are likely to be paired to improve the quality of the D2D links as shown in Figure 3(a). On the other hand, the devices without D2D cooperation tend to be paired independent of their locations but dependent on the DL channel qualities as shown in Figure 3(b). As expected from the distributive algorithm, a device in a better condition tends to take higher rate than the other device in the pair with D2D cooperation; for instance, device 1 having more neighbors to bargain with tends to take higher rate than device 2 having less neighbors.

Figure 4 compares the performance of the network with that of transmit CSI for different antenna configurations when and the other conditions remain unchanged from Figure 2. As the number () of antennas increases, the throughput is improved for all methods by multiplexing more symbols at the transmitter. In addition, the gain of “D2D-PA” over “No D2D” increases with the number of antennas by concentrating the signal power to the desired channel modes. Unfortunately, the performance gain with D2D cooperation is marginal for antenna configuration.

To improve the performance of D2D cooperation for and , we increase the bandwidth expansion ratio in Figure 5 while the other conditions remain unchanged from Figure 2. The D2D cooperation methods are benefited by improving the D2D link qualities through increasing the D2D bandwidth irrespective of the transmit CSI available at the AP or not. The gain is more prominent when increases from to .

Figure 6 compares the performances as the cluster location varies when and  m. The antenna configuration is set to and in Figure 6(a) and and in Figure 6(b). The cluster center SNR is 0 dB at  m for both figures and the cluster center SNR at distance is obtained from . The results reveal that the gain of D2D cooperation is larger when the cluster location gets farther from the AP since the quality of the D2D links relative to the DL gets better. This observation comes from the fact that the signals with larger amplitude suffer from larger quantization errors for the fixed number of quantization levels. The figure also shows that the effect of the compression noises becomes negligible when the device cluster is as small as that used in the figure.

6. Concluding Remarks

This paper considers an IoT network supporting both the centralized signal transmission and D2D communications. With asymmetric antenna configurations, we propose the transmit and receive BF for the virtual MIMO formed by D2D cooperation. For the proposed method, we provide the strategies to improve the sum rate of the device pair and a distributive algorithm for device pairing and resource sharing to maximize the network throughput while meeting each device’s desire. It is confirmed that the distributed algorithm works well in the network with transmit CSI also, providing a performance close to that obtained with optimal pairing. The transmit CSI improves the performance of the network significantly even without D2D cooperation but the D2D cooperation leverages the performance further. The performance gain of the D2D cooperation becomes more prominent when the D2D links are relatively better than the downlink by using a larger bandwidth for the D2D links and by applying the method to clusters of closely located devices but farther from the AP.

Competing Interests

The authors declare that they have no competing interests.

Acknowledgments

This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (nos. NRF-2015R1A2A2A01005390 and NRF-2015R1C1A1A01052529).

References

  1. A. Zanella, N. Bui, A. Castellani, L. Vangelista, and M. Zorzi, “Internet of things for smart cities,” IEEE Internet of Things Journal, vol. 1, no. 1, pp. 22–32, 2014. View at: Publisher Site | Google Scholar
  2. J. Lee, K. D. Singh, Y. Hadjadj-Aoul, and N. Kumar, “Wireless and mobile technologies for the internet of things,” Mobile Information Systems, vol. 2016, Article ID 8206548, 2 pages, 2016. View at: Publisher Site | Google Scholar
  3. M. Hasan, E. Hossain, and D. Niyato, “Random access for machine-to-machine communication in LTE-advanced networks: issues and approaches,” IEEE Communications Magazine, vol. 51, no. 6, pp. 86–93, 2013. View at: Publisher Site | Google Scholar
  4. X. Lin, J. G. Andrews, A. Ghosh, and R. Ratasuk, “An overview of 3GPP device-to-device proximity services,” IEEE Communications Magazine, vol. 52, no. 4, pp. 40–48, 2014. View at: Publisher Site | Google Scholar
  5. M. Tehrani, M. Uysal, and H. Yanikomeroglu, “Device-to-device communication in 5G cellular networks: challenges, solutions, and future directions,” IEEE Communications Magazine, vol. 52, no. 5, pp. 86–92, 2014. View at: Publisher Site | Google Scholar
  6. J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: efficient protocols and outage behavior,” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 50, no. 12, pp. 3062–3080, 2004. View at: Publisher Site | Google Scholar | MathSciNet
  7. C. T. Ng, N. Jindal, A. J. Goldsmith, and U. Mitra, “Capacity gain from two-transmitter and two-receiver cooperation,” IEEE Transactions on Information Theory, vol. 53, no. 10, pp. 3822–3827, 2007. View at: Publisher Site | Google Scholar | MathSciNet
  8. J. S. Wang, Y. H. Kim, I. Song, P. C. Cosman, and L. B. Milstein, “Cooperative relaying of superposition coding with simple feedback for layered source transmission,” IEEE Transactions on Communications, vol. 61, no. 11, pp. 4448–4461, 2013. View at: Publisher Site | Google Scholar
  9. P. Li and S. Guo, Cooperative Device-to-Device Communication in Cognitive Radio Cellular Networks, Springer, Berlin, Germany, 2014.
  10. J. Jiang, J. S. Thompson, and H. Sun, “A singular-value-based adaptive modulation and cooperation scheme for virtual-MIMO systems,” IEEE Transactions on Vehicular Technology, vol. 60, no. 6, pp. 2495–2504, 2011. View at: Publisher Site | Google Scholar
  11. J. Jiang, J. S. Thompson, H. Sun, and P. M. Grant, “Performance assessment of virtual multiple-input multiple-output systems with compress-and-forward cooperation,” IET Communications, vol. 6, no. 11, pp. 1456–1465, 2012. View at: Publisher Site | Google Scholar
  12. S. H. Lee, D. R. Shin, H. W. Jeong, and Y. H. Kim, “Distributed bargaining strategy for downlink virtual MIMO with device-to-device communication,” IEEE Transactions on Communications, vol. 64, no. 4, pp. 1503–1516, 2016. View at: Publisher Site | Google Scholar
  13. Y. Jeong, J. Yoon, Y. H. Kim, and S. H. Lee, “Distributed matching and resource sharing for space division multiplexing assisted by D2D cooperation,” in Proceedings of the International Conference on Information and Communication Technology Convergence (ICTC '16), pp. 112–114, Jeju-do, Korea, October 2016. View at: Publisher Site | Google Scholar
  14. J. Kleinberg and E. Tardos, “Balanced outcomes in social exchange networks,” in Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC '08), pp. 295–304, ACM, New York, NY, USA, 2008. View at: Publisher Site | Google Scholar | MathSciNet
  15. M. Bayati, D. Shah, and M. Sharma, “Max-product for maximum weight matching: convergence, correctness, and LP duality,” IEEE Transactions on Information Theory, vol. 54, no. 3, pp. 1241–1251, 2008. View at: Publisher Site | Google Scholar | MathSciNet
  16. Y. Kanoria, M. Bayati, C. Borgs, J. Chayes, and A. Montanari, “Fast convergence of natural bargaining dynamics in exchange networks,” in Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1518–1537, San Francisco, Calif, USA, January 2011. View at: Google Scholar | MathSciNet
  17. M. Shamaiah, S. H. Lee, S. Vishwanath, and H. Vikalo, “Distributed algorithms for spectrum access in cognitive radio relay networks,” IEEE Journal on Selected Areas in Communications, vol. 30, no. 10, pp. 1947–1957, 2012. View at: Publisher Site | Google Scholar
  18. S. H. Lee, M. Shamaiah, H. Vikalo, and S. Vishwanath, “Message-passing algorithms for coordinated spectrum sensing in cognitive radio networks,” IEEE Communications Letters, vol. 17, no. 4, pp. 812–815, 2013. View at: Publisher Site | Google Scholar
  19. D. P. Bertsekas, “Auction algorithms for network flow problems: a tutorial introduction,” Computational Optimization and Applications, vol. 1, no. 1, pp. 7–66, 1992. View at: Publisher Site | Google Scholar | MathSciNet
  20. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, Hoboken, NJ, USA, 2nd edition, 2006. View at: MathSciNet
  21. Q. H. Spencer, A. L. Swindlehurst, and M. Haardt, “Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels,” IEEE Transactions on Signal Processing, vol. 52, no. 2, pp. 461–471, 2004. View at: Publisher Site | Google Scholar | MathSciNet
  22. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498–519, 2001. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  23. I. Sohn, S. H. Lee, and J. G. Andrews, “Belief propagation for distributed downlink beamforming in cooperative MIMO cellular networks,” IEEE Transactions on Wireless Communications, vol. 10, no. 12, pp. 4140–4149, 2011. View at: Publisher Site | Google Scholar

Copyright © 2017 Yeonjin Jeong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

630 Views | 306 Downloads | 0 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.