Analysis of millimeter wave ad hoc networks

Over the coming few years, the next-generation of wireless networks will be standardized and defined. Ad hoc networks, which operate without expensive infrastructure, are desirable for use cases such as military networks or disaster relief. Millimeter wave (mmWave) technology may enable high speed ad hoc networks. Directional antennas and building blockage limit the received interference power while the huge bandwidth enables high data rates. For this reason, understanding the interference and network performance of mmWave ad hoc networks is crucial for next-generation network design. In my first contribution, I derive the SINR complementary cumulative distribution function (CCDF) for a random single-hop mmWave ad hoc network. These base results are used to further give insights in mmWave ad hoc networks. The SINR distribution is used to compute the transmission capacity of a mmWave ad hoc network using a Taylor bound. The CDF of the interference to noise ratio (INR) is also derived which shows that mmWave ad hoc networks are line-of-sight interference limited. I extend my work in the second contribution to include general clustered Poisson point processes to derive insights in the effect of different spatial interference patterns. Using the developed framework, I derive the ergodic rate of both spatially uniform and cluster mmWave ad hoc networks. I develop scaling trends for the antenna array size to keep the ergodic rate constant. The impact of beam alignment is computed in the final part of the contribution. Finally, I account for the overhead of beam alignment in mmWave ad hoc networks. The final contribution leverages the first two contributions to derive the expected training time a mmWave ad hoc network must perform before data transmission occurs. The results show that the optimal conditions for minimizing the training time are different than the optimal conditions for maximizing rate.Electrical and Computer Engineerin

Interference Alignment in Two-Tier Randomly Distributed Heterogeneous Wireless Networks Using Stochastic Geometry Approach

With the massive increase in wireless data traffic in recent years, multi-tier wireless networks have been deployed to provide much higher capacities and coverage. However, heterogeneity of wireless networks bring new challenges for interference analysis and coordination due to spatial randomly distributed transmitters. In this paper, we present a distance dependent interference alignment (IA) approach for a generic 2-tier heterogeneous wireless network, where transmitters in the first and second tiers are distributed as Poisson Point Process (PPP) and Poisson Cluster Process (PCP) respectively. The feasibility condition of the IA approach is used to find upper bound of the number of interference streams that can be aligned. The proposed IA scheme maximizes the second-tier throughput by using the trade-off between signal-to-interference ratio and multiplexing gain. It is shown that acquiring accurate knowledge of the distance between the receiver in the second-tier and the nearest cross-tier transmitter only brings insignificant throughput gain compared to statistical knowledge of distance. Furthermore, the remaining cross-tier and inter-cluster interferences are modeled and analyzed using stochastic geometry technique. Numerical results validate the derived expressions of success probabilities and throughput, and show that the distance dependent IA scheme significantly outperforms the traditional IA scheme in the presence of path-loss effect

Generalized Interference Alignment—Part II: Application to Wireless Secrecy

In contrast to its wired counterpart, wireless communication is highly susceptible to eavesdropping due to the broadcast nature of the wireless propagation medium. Recent works have proposed the use of interference to reduce eavesdropping capabilities in wireless wiretap networks. However, the concurrent effect of interference on both eavesdropping receivers (ERs) and legitimate receivers has not been thoroughly investigated, and careful engineering of the network interference is required to harness the full potential of interference for wireless secrecy. This two-part article addresses this issue by proposing a generalized interference alignment (GIA) technique, which jointly designs the transceivers at the legitimate partners to impede the ERs without interfering with LRs. In Part I, we have established a theoretical framework for the GIA technique. In Part II, we will first propose an efficient GIA algorithm that is applicable to large-scale networks and then evaluate the performance of this algorithm in stochastic wireless wiretap network via both analysis and simulation. These results reveal insights into when and how GIA contributes to wireless secrecy

Improving Macrocell - Small Cell Coexistence through Adaptive Interference Draining

The deployment of underlay small base stations (SBSs) is expected to significantly boost the spectrum efficiency and the coverage of next-generation cellular networks. However, the coexistence of SBSs underlaid to an existing macro-cellular network faces important challenges, notably in terms of spectrum sharing and interference management. In this paper, we propose a novel game-theoretic model that enables the SBSs to optimize their transmission rates by making decisions on the resource occupation jointly in the frequency and spatial domains. This procedure, known as interference draining, is performed among cooperative SBSs and allows to drastically reduce the interference experienced by both macro- and small cell users. At the macrocell side, we consider a modified water-filling policy for the power allocation that allows each macrocell user (MUE) to focus the transmissions on the degrees of freedom over which the MUE experiences the best channel and interference conditions. This approach not only represents an effective way to decrease the received interference at the MUEs but also grants the SBSs tier additional transmission opportunities and allows for a more agile interference management. Simulation results show that the proposed approach yields significant gains at both macrocell and small cell tiers, in terms of average achievable rate per user, reaching up to 37%, relative to the non-cooperative case, for a network with 150 MUEs and 200 SBSs