Performance Analysis of Millimeter Wave Massive MIMO Systems in Centralized and Distributed Schemes

This paper considers downlink multi-user millimeter-wave massive multiple-input multiple-output (MIMO) systems in both centralized and distributed configurations, referred to as C-MIMO and D-MIMO, respectively. Assuming the fading channel is composite and comprised of both large-scale fading and small-scale fading, a hybrid precoding algorithm leveraging antenna array response vectors is applied into both the C-MIMO system with fully connected structure and the D-MIMO system with partially connected structure. First, the asymptotic spectral efficiency (SE) of an arbitrary user and the asymptotic average SE of the cell for the C-MIMO system are analyzed. Then, two radio access unit (RAU) selection algorithms are proposed for the D-MIMO system, based on minimal distance (D-based) and maximal signal-to-interference-plus-noise-ratio (SINR) (SINR-based), respectively. For the D-MIMO system with circular layout and D-based RAU selection algorithm, the upper bounds on the asymptotic SE of an arbitrary user and the asymptotic average SE of the cell are also investigated. Finally, numerical results are provided to assess the analytical results and evaluate the effects of the numbers of total transmit antennas and users on system performance. It is shown that, from the perspective of the cell, the D-MIMO system with D-based scheme outperforms the C-MIMO system and achieves almost alike performance compared with the SINR-based solution while requiring less complexity.Peer reviewe

Design of personalized location areas for future Pcs networks

In Global Systems for Mobile Communications (GSM), always-update location strategy is used to keep track of mobile terminals within the network. However future Personal Communication Networks (PCS) will require to serve a wide range of services (digital voice, video, data, and email) and also will have to support a large population of users. Under such demands, determining the exact location of a user by traditional strategies would be difficult and would result in increasing the signaling load imposed by location-update and paging procedures. The problem is not only in increasing cost, but also in non-efficient utilization of a precious resource, i.e., radio bandwidth; In this thesis, personalized Location Areas (PLAs) are formed considering the mobility patterns of individual users in the system such that the signaling due to location update and paging is minimized. We prove that the problem in this formulation is of NP complexity. Therefore we study efficient optimization techniques able to avoid combinatorial search. Three known classes of optimization techniques are studied. They are Simulated Annealing, Tabu Search and Genetic Search. Three algorithms are designed for solving the problem. Modeling does not assume any specific cell structure or network topology that makes the proposal widely applicable. The behavior of mobile terminals in the network is modeled as Random Walk with an absorbing state and the Markov chain is used for cost analysis; Numeric simulation carried out for 25 and 100 hexagonal cell networks have shown that Simulated Annealing based algorithm outperforms other two by indicators of the runtime complexity and signaling cost of location management. The ID\u27s of cells populating the calculated area are provided to the mobile terminal and saved in its local memory every time the mobile subscriber moves out its current location area. Otherwise, no location update is performed, but only paging. Thus, at the expense of small local memory, the location management is carried more efficiently

Location and resource management for quality of service provisioning in wireless/mobile networks

Wireless communication has been seen unprecedented growth in recent years. As the wireless network migrates from 2G to 2.5G and 3G, more and more high-bandwidth services have to be provided to wireless users. However, existing radio resources are limited, thus quality-of-service (QoS) provisioning is extremely important for high performance networKing In this dissertation, we focus on two problems crucial for QoS provisioning in wireless networks. They are location and resource management. Our research is aimed to develop efficient location management and resource allocation techniques to provide qualitative services in the future generations of wireless/mobile networks. First, the hybrid location update method (HLU) is proposed based on both the moving distance and the moving direction of mobile terminals. The signaling cost for location management is analyzed using a 2D Markov walk model. The results of numerical studies for different mobility patterns show that the HLU scheme outperforms the methods employing either moving distance or moving direction. Next, a new dynamic location management scheme with personalized location areas is developed. It takes into account terminal\u27s mobility characteristics in different locations of the service area. The location area is designed for each individual mobile user such that the location management cost is minimized. The cost is calculated based on a continuous-time Markov chain. Simulation results acknowledge a lower cost of the proposed scheme compared to that of some known techniques. Our research on the resource management considers the dynamic allocation strategy in the integrated voice/data wireless networks. We propose two new channel de-allocation schemes, i.e., de-allocation for data packet (DASP) and de-allocation for both voice call and data packet (DASVP). We then combine the proposed de-allocation methods with channel re-allocation, and evaluate the performance of the schemes using an analytic model. The results indicate the necessity of adapting to QoS requirements on both voice call and data packet. Finally, a new QoS-based dynamic resource allocation scheme is proposed which differentiates the new and handoff voice calls. The scheme combines channel reservation, channel de-allocation/re-allocation for voice call and packet queue to adapt to QoS requirements by adjusting the number of reserved channels and packet queue size. The superiority of the propose scheme in meeting the QoS requirements over existing techniques is proved by the experimental studies

Mobility and Handoff Management in Wireless Networks

With the increasing demands for new data and real-time services, wireless networks should support calls with different traffic characteristics and different Quality of Service (QoS)guarantees. In addition, various wireless technologies and networks exist currently that can satisfy different needs and requirements of mobile users. Since these different wireless networks act as complementary to each other in terms of their capabilities and suitability for different applications, integration of these networks will enable the mobile users to be always connected to the best available access network depending on their requirements. This integration of heterogeneous networks will, however, lead to heterogeneities in access technologies and network protocols. To meet the requirements of mobile users under this heterogeneous environment, a common infrastructure to interconnect multiple access networks will be needed. In this chapter, the design issues of a number of mobility management schemes have been presented. Each of these schemes utilizes IP-based technologies to enable efficient roaming in heterogeneous network. Efficient handoff mechanisms are essential for ensuring seamless connectivity and uninterrupted service delivery. A number of handoff schemes in a heterogeneous networking environment are also presented in this chapter.Comment: 28 pages, 11 figure

Distributed N-body Simulation on the Grid Using Dedicated Hardware

We present performance measurements of direct gravitational N -body simulation on the grid, with and without specialized (GRAPE-6) hardware. Our inter-continental virtual organization consists of three sites, one in Tokyo, one in Philadelphia and one in Amsterdam. We run simulations with up to 196608 particles for a variety of topologies. In many cases, high performance simulations over the entire planet are dominated by network bandwidth rather than latency. With this global grid of GRAPEs our calculation time remains dominated by communication over the entire range of N, which was limited due to the use of three sites. Increasing the number of particles will result in a more efficient execution. Based on these timings we construct and calibrate a model to predict the performance of our simulation on any grid infrastructure with or without GRAPE. We apply this model to predict the simulation performance on the Netherlands DAS-3 wide area computer. Equipping the DAS-3 with GRAPE-6Af hardware would achieve break-even between calculation and communication at a few million particles, resulting in a compute time of just over ten hours for 1 N -body time unit. Key words: high-performance computing, grid, N-body simulation, performance modellingComment: (in press) New Astronomy, 24 pages, 5 figure

Mobility modeling and management for next generation wireless networks

Mobility modeling and management in wireless networks are the set of tasks performed in order to model motion patterns, predict trajectories, get information on mobiles\u27 whereabouts and to make use of this information in handoff, routing, location management, resource allocation and other functions. In the literature, the speed of mobile is often and misleadingly referred to as the level of mobility, such as high or low mobility. This dissertation presents an information theoretic approach to mobility modeling and management, in which mobility is considered as a measure of uncertainty in mobile\u27s trajectory, that is, the mobility is low if the trajectory of a mobile is highly predictable even if the mobile is moving with high speed. On the other hand, the mobility is high if the trajectory of the mobile is highly erratic. Based on this mobility modeling concept, we classify mobiles into predictable and non-predictable mobility classes and optimize network operations for each mobility class. The dynamic mobility classification technique is applied to various mobility related issues of the next generation wireless networks such as location management, location-based services, and energy efficient routing in multihop cellular networks