Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks

Soaring capacity and coverage demands dictate that future cellular networks need to soon migrate towards ultra-dense networks. However, network densification comes with a host of challenges that include compromised energy efficiency, complex interference management, cumbersome mobility management, burdensome signaling overheads and higher backhaul costs. Interestingly, most of the problems, that beleaguer network densification, stem from legacy networks' one common feature i.e., tight coupling between the control and data planes regardless of their degree of heterogeneity and cell density. Consequently, in wake of 5G, control and data planes separation architecture (SARC) has recently been conceived as a promising paradigm that has potential to address most of aforementioned challenges. In this article, we review various proposals that have been presented in literature so far to enable SARC. More specifically, we analyze how and to what degree various SARC proposals address the four main challenges in network densification namely: energy efficiency, system level capacity maximization, interference management and mobility management. We then focus on two salient features of future cellular networks that have not yet been adapted in legacy networks at wide scale and thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and device-to-device (D2D) communications. After providing necessary background on CoMP and D2D, we analyze how SARC can particularly act as a major enabler for CoMP and D2D in context of 5G. This article thus serves as both a tutorial as well as an up to date survey on SARC, CoMP and D2D. Most importantly, the article provides an extensive outlook of challenges and opportunities that lie at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201

Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks

The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast channel, even without any network interference, it is known that such gains collapse due to interstream interference if the feedback is delayed or low rate. In this paper, we investigate SDMA in the presence of interference from many other simultaneously active transmitters distributed randomly over the network. In particular we consider zero-forcing beamforming in a decentralized (ad hoc) network where each receiver provides feedback to its respective transmitter. We derive closed-form expressions for the outage probability, network throughput, transmission capacity, and average achievable rate and go on to quantify the degradation in network performance due to residual self-interference as a function of key system parameters. One particular finding is that as in the classical broadcast channel, the per-user feedback rate must increase linearly with the number of transmit antennas and SINR (in dB) for the full multiplexing gains to be preserved with limited feedback. We derive the throughput-maximizing number of streams, establishing that single-stream transmission is optimal in most practically relevant settings. In short, SDMA does not appear to be a prudent design choice for interference-limited wireless networks.Comment: Submitted to IEEE Transactions on Wireless Communication

Collaborative Beamforming for Distributed Wireless Ad Hoc Sensor Networks

The performance of collaborative beamforming is analyzed using the theory of random arrays. The statistical average and distribution of the beampattern of randomly generated phased arrays is derived in the framework of wireless ad hoc sensor networks. Each sensor node is assumed to have a single isotropic antenna and nodes in the cluster collaboratively transmit the signal such that the signal in the target direction is coherently added in the far- eld region. It is shown that with N sensor nodes uniformly distributed over a disk, the directivity can approach N, provided that the nodes are located sparsely enough. The distribution of the maximum sidelobe peak is also studied. With the application to ad hoc networks in mind, two scenarios, closed-loop and open-loop, are considered. Associated with these scenarios, the effects of phase jitter and location estimation errors on the average beampattern are also analyzed.Comment: To appear in the IEEE Transactions on Signal Processin

Dynamic Radio Cooperation for Downlink Cloud-RANs with Computing Resource Sharing

A novel dynamic radio-cooperation strategy is proposed for Cloud Radio Access Networks (C-RANs) consisting of multiple Remote Radio Heads (RRHs) connected to a central Virtual Base Station (VBS) pool. In particular, the key capabilities of C-RANs in computing-resource sharing and real-time communication among the VBSs are leveraged to design a joint dynamic radio clustering and cooperative beamforming scheme that maximizes the downlink weighted sum-rate system utility (WSRSU). Due to the combinatorial nature of the radio clustering process and the non-convexity of the cooperative beamforming design, the underlying optimization problem is NP-hard, and is extremely difficult to solve for a large network. Our approach aims for a suboptimal solution by transforming the original problem into a Mixed-Integer Second-Order Cone Program (MI-SOCP), which can be solved efficiently using a proposed iterative algorithm. Numerical simulation results show that our low-complexity algorithm provides close-to-optimal performance in terms of WSRSU while significantly outperforming conventional radio clustering and beamforming schemes. Additionally, the results also demonstrate the significant improvement in computing-resource utilization of C-RANs over traditional RANs with distributed computing resources.Comment: 9 pages, 6 figures, accepted to IEEE MASS 201

Large-Scale MIMO versus Network MIMO for Multicell Interference Mitigation

This paper compares two important downlink multicell interference mitigation techniques, namely, large-scale (LS) multiple-input multiple-output (MIMO) and network MIMO. We consider a cooperative wireless cellular system operating in time-division duplex (TDD) mode, wherein each cooperating cluster includes $B$ base-stations (BSs), each equipped with multiple antennas and scheduling $K$ single-antenna users. In an LS-MIMO system, each BS employs $BM$ antennas not only to serve its scheduled users, but also to null out interference caused to the other users within the cooperating cluster using zero-forcing (ZF) beamforming. In a network MIMO system, each BS is equipped with only $M$ antennas, but interference cancellation is realized by data and channel state information exchange over the backhaul links and joint downlink transmission using ZF beamforming. Both systems are able to completely eliminate intra-cluster interference and to provide the same number of spatial degrees of freedom per user. Assuming the uplink-downlink channel reciprocity provided by TDD, both systems are subject to identical channel acquisition overhead during the uplink pilot transmission stage. Further, the available sum power at each cluster is fixed and assumed to be equally distributed across the downlink beams in both systems. Building upon the channel distribution functions and using tools from stochastic ordering, this paper shows, however, that from a performance point of view, users experience better quality of service, averaged over small-scale fading, under an LS-MIMO system than a network MIMO system. Numerical simulations for a multicell network reveal that this conclusion also holds true with regularized ZF beamforming scheme. Hence, given the likely lower cost of adding excess number of antennas at each BS, LS-MIMO could be the preferred route toward interference mitigation in cellular networks.Comment: 13 pages, 7 figures; IEEE Journal of Selected Topics in Signal Processing, Special Issue on Signal Processing for Large-Scale MIMO Communication

Achieving Small World Properties using Bio-Inspired Techniques in Wireless Networks

It is highly desirable and challenging for a wireless ad hoc network to have self-organization properties in order to achieve network wide characteristics. Studies have shown that Small World properties, primarily low average path length and high clustering coefficient, are desired properties for networks in general. However, due to the spatial nature of the wireless networks, achieving small world properties remains highly challenging. Studies also show that, wireless ad hoc networks with small world properties show a degree distribution that lies between geometric and power law. In this paper, we show that in a wireless ad hoc network with non-uniform node density with only local information, we can significantly reduce the average path length and retain the clustering coefficient. To achieve our goal, our algorithm first identifies logical regions using Lateral Inhibition technique, then identifies the nodes that beamform and finally the beam properties using Flocking. We use Lateral Inhibition and Flocking because they enable us to use local state information as opposed to other techniques. We support our work with simulation results and analysis, which show that a reduction of up to 40% can be achieved for a high-density network. We also show the effect of hopcount used to create regions on average path length, clustering coefficient and connectivity.Comment: Accepted for publication: Special Issue on Security and Performance of Networks and Clouds (The Computer Journal