Optimal Deployment of Heterogeneous Wireless Nodes in Integrated LTElWiFi Networks Optimal placement of small cells in integrated LTEWiFi heterogeneous network architecture is considered one of the key approaches that can be used to increase the system capacity and enhance the coverage to meet the unexpected explosion of mobile data traffic. Cooperation and interworking between different Radio Access Technologies (RATs) introduce the LTEWiFi Aggregation (LWA) which allows the traffic aggregation between WiFi Access Point (WAP) and LTE small cell on the level of Radio Access Network (RAN). In this paper, the effectiveness of the optimal deployment of heterogeneous wireless small nodes in a hotspot zone is considered and explored. The deployment of different wireless small nodes is formulated as an optimization problem with the objective of (i) Maximizing the total system throughput while considering the minimum received SignaltoInterferenceplusNoise Ratio (SINR)SignaltoNoise Ratio (SNR) requirements for LTEWiFi coverage (ii) Choosing the optimal number of small cells which can guarantee the coverage of the considered hotspot zone (iii) Choosing the optimal formation of WAPs Basic Service Sets (BSSs). The objective function is formulated as a Mixed Integer NonLinear Programming (MINLP) problem and solved using genetic algorithm. The performance of the proposed optimal deployment approach is compared to the uniform distributed deployment algorithm in terms of system throughput in which a significant improvement is noticed when the proposed approach is adopted.

Proportional Fair RAT Aggregation in HetNets Heterogeneity in wireless network architectures (i.e., the coexistence of 3G, LTE, 5G, WiFi, etc.) has become a key component of current and future generation cellular networks. Simultaneous aggregation of each clientu0027s traffic across multiple such radio access technologies (RATs)  base stations (BSs) can significantly increase the system throughput, and has become an important feature of cellular standards on multiRAT integration. Distributed algorithms that can realize the full potential of this aggregation are thus of great importance to operators. In this paper, we study the problem of resource allocation for multiRAT traffic aggregation in HetNets (heterogeneous networks). Our goal is to ensure that the resources at each BS are allocated so that the aggregate throughput achieved by each client across its RATs satisfies a proportional fairness (PF) criterion. In particular, we provide a simple distributed algorithm for resource allocation at each BS that extends the PF allocation algorithm for a single BS. Despite its simplicity and lack of coordination across the BSs, we show that our algorithm converges to the desired PF solution and provide (tight) bounds on its convergence speed. We also study the characteristics of the optimal solution and use its properties to prove the optimality of our algorithmu0027s outcomes.