Reducing the power consumption in LTE-advanced wireless access networks by a capacity based deployment tool

As both the bit rate required by applications on mobile devices and the number of those mobile devices are steadily growing, wireless access networks need to be expanded. As wireless networks also consume a lot of energy, it is important to develop energy-efficient wireless access networks in the near future. In this study, a capacity-based deployment tool for the design of energy-efficient wireless access networks is proposed. Capacity-based means that the network responds to the instantaneous bit rate requirements of the users active in the selected area. To the best of our knowledge, such a deployment tool for energy-efficient wireless access networks has never been presented before. This deployment tool is applied to a realistic case in Ghent, Belgium, to investigate three main functionalities incorporated in LTE-Advanced: carrier aggregation, heterogeneous deployments, and Multiple-Input Multiple-Output (MIMO). The results show that it is recommended to introduce femtocell base stations, supporting both MIMO and carrier aggregation, into the network (heterogeneous deployment) to reduce the network's power consumption. For the selected area and the assumptions made, this results in a power consumption reduction up to 70%. Introducing femtocell base stations without MIMO and carrier aggregation can already result in a significant power consumption reduction of 38%

The Capacity of Heterogeneous Wireless Networks

Abstract—A substantial body of the literature exists addressing the capacity of wireless networks. However, it is commonly assumed that all nodes in the network are identical. The issue of heterogeneity has not been embraced into the discussions. In this paper, we investigate the throughput capacity of heterogeneous wireless networks with general network settings. Specifically, we consider an extended network with n normal nodes and m nb (0 b 1) more powerful helping nodes in a rectangular area with width sðnÞ and length n=sðnÞ, where sðnÞ nw and 0 w 1=2. We assume that there are n flows in the network. All the n normal nodes are sources while only randomly chosen nd (0 d 1) normal nodes are destinations. We further assume that the n normal nodes are uniformly and independently distributed, while the m helping nodes are either regularly placed or uniformly and independently distributed, resulting in two different kinds of networks called Regular Heterogeneous Wireless Networks and Random Heterogeneous Wireless Networks, respectively. We show that network capacity is determined by the shape of the network area, the number of destination nodes, the number of helping nodes, and the bandwidth of helping nodes. We also find that heterogeneous wireless networks can provide throughput higher in the order sense than traditional homogeneous wireless networks only under certain conditions. Index Terms—Heterogeneous wireless networks, extended networks, achievable throughput Ç

Queueing Networks for Vertical Handover

PhDIt is widely expected that next-generation wireless communication systems will be heterogeneous, integrating a wide variety of wireless access networks. Of particular interest recently is a mix of cellular networks (GSM/GPRS and WCDMA) and wireless local area networks (WLANs) to provide complementary features in terms of coverage, capacity and mobility support. If cellular/ WLAN interworking is to be the basis for a heterogeneous network then the analysis of complex handover traffic rates in the system (especially vertical handover) is one of the most essential issues to be considered. This thesis describes the application of queueing-network theory to the modelling of this heterogeneous wireless overlay system. A network of queues (or queueing network) is a powerful mathematical tool in the performance evaluation of many large-scale engineering systems. It has been used in the modelling of hierarchically structured cellular wireless networks with much success, including queueing network modelling in the study of cellular/ WLAN interworking systems. In the process of queueing network modelling, obtaining the network topology of a system is usually the first step in the construction of a good model, but this topology analysis has never before been used in the handover traffic study in heterogeneous overlay wireless networks. In this thesis, a new topology scheme to facilitate the analysis of handover traffic is proposed. The structural similarity between hierarchical cellular structure and heterogeneous wireless overlay networks is also compared. By replacing the microcells with WLANs in a hierarchical structure, the interworking system is modelled as an open network of Erlang loss systems and with the new topology, the performance measures of blocking probabilities and dropping probabilities can be determined. Both homogeneous and non-homogeneous traffic have been considered, circuit switched and packet-switched. Example scenarios have been used to validate the models, the numerical results showing clear agreement with the known validation scenarios

Information Theoretic Operating Regimes of Large Wireless Networks

In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes--bandwidth- and power-limited--have proven indispensable in the design of good communication schemes. In this paper, we propose a new scaling law formulation for wireless networks that allows us to develop a theory that is analogous to the point-to-point case. We identify fundamental operating regimes of wireless networks and derive architectural guidelines for the design of optimal schemes. Our analysis shows that in a given wireless network with arbitrary size, area, power, bandwidth, etc., there are three parameters of importance: the short-distance SNR, the long-distance SNR, and the power path loss exponent of the environment. Depending on these parameters we identify four qualitatively different regimes. One of these regimes is especially interesting since it is fundamentally a consequence of the heterogeneous nature of links in a network and does not occur in the point-to-point case; the network capacity is {\em both} power and bandwidth limited. This regime has thus far remained hidden due to the limitations of the existing formulation. Existing schemes, either multihop transmission or hierarchical cooperation, fail to achieve capacity in this regime; we propose a new hybrid scheme that achieves capacity.Comment: 12 pages, 5 figures, to appear in IEEE Transactions on Information Theor