Data Dissemination Performance in Large-Scale Sensor Networks

As the use of wireless sensor networks increases, the need for (energy-)efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of transmissions low. In this paper we develop a model describing the message count in large-scale wireless sensor networks. We focus our attention on the popular Trickle algorithm, which has been proposed as a suitable communication protocol for code maintenance and propagation in wireless sensor networks. Besides providing a mathematical analysis of the algorithm, we propose a generalized version of Trickle, with an additional parameter defining the length of a listen-only period. This generalization proves to be useful for optimizing the design and usage of the algorithm. For single-cell networks we show how the message count increases with the size of the network and how this depends on the Trickle parameters. Furthermore, we derive distributions of inter-broadcasting times and investigate their asymptotic behavior. Our results prove conjectures made in the literature concerning the effect of a listen-only period. Additionally, we develop an approximation for the expected number of transmissions in multi-cell networks. All results are validated by simulations

Outage Analysis of Full-Duplex Architectures in Cellular Networks

The implementation of full-duplex (FD) radio in wireless communications is a potential approach for achieving higher spectral efficiency. A possible application is its employment in the next generation of cellular networks. However, the performance of large-scale FD multiuser networks is an area mostly unexplored. Most of the related work focuses on the performance analysis of small-scale networks or on loop interference cancellation schemes. In this paper, we derive the outage probability performance of large-scale FD cellular networks in the context of two architectures: two-node and three-node. We show how the performance is affected with respect to the model's parameters and provide a comparison between the two architectures.Comment: to appear in Proc. IEEE VTC 2015 Spring, Glasgo

Performance Analysis of Micro Unmanned Airborne Communication Relays for Cellular Networks

This paper analyses the potential of utilising small unmanned-aerial-vehicles (SUAV) as wireless relays for assisting cellular network performance. Whilst high altitude wireless relays have been investigated over the past 2 decades, the new class of low cost SUAVs offers new possibilities for addressing local traffic imbalances and providing emergency coverage.We present field-test results from an SUAV test-bed in both urban and rural environments. The results show that trough-to-peak throughput improvements can be achieved for users in poor coverage zones. Furthermore, the paper reinforces the experimental study with large-scale network analysis using both stochastic geometry and multi-cell simulation results.Comment: conferenc

Performance analysis of hybrid UAV networks for probabilistic content caching

Caching content in small-cell networks can reduce the traffic congestion in backhaul. In this article, we develop a hybrid caching network comprising of unmanned aerial vehicles (UAVs) and ground small-cell base stations (SBSs), where UAVs are preferred because of their flexibility and elevated platform for line of sight. First, we derive the association probability for the ground user affiliated with a UAV and ground SBS. Then, we derive the successful content delivery probability by considering both the intercell and intracell interference. We also analyze the energy efficiency of the hybrid network and compare it with the separate UAV and ground networks. We further propose the caching scheme to improve the successful content delivery by managing the content popularity, where the part of the caching capacity in each UAV and ground SBS is reserved to store the most popular content (MPC), while the remaining stores less popular contents. Numerical results unveil that the proposed caching scheme has an improvement of 26.6% in content delivery performance over the MPC caching, which overlooks the impact of content diversity during caching

Wireless Secrecy in Large-Scale Networks

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper provides an overview of the main properties of this new class of random graphs. We first analyze the local properties of the iS-graph, namely the degree distributions and their dependence on fading, target secrecy rate, and eavesdropper collusion. To mitigate the effect of the eavesdroppers, we propose two techniques that improve secure connectivity. Then, we analyze the global properties of the iS-graph, namely percolation on the infinite plane, and full connectivity on a finite region. These results help clarify how the presence of eavesdroppers can compromise secure communication in a large-scale network.Comment: To appear: Proc. IEEE Information Theory and Applications Workshop (ITA'11), San Diego, CA, Feb. 2011, pp. 1-10, Invited Pape

Large-scale Spatial Distribution Identification of Base Stations in Cellular Networks

The performance of cellular system significantly depends on its network topology, where the spatial deployment of base stations (BSs) plays a key role in the downlink scenario. Moreover, cellular networks are undergoing a heterogeneous evolution, which introduces unplanned deployment of smaller BSs, thus complicating the performance evaluation even further. In this paper, based on large amount of real BS locations data, we present a comprehensive analysis on the spatial modeling of cellular network structure. Unlike the related works, we divide the BSs into different subsets according to geographical factor (e.g. urban or rural) and functional type (e.g. macrocells or microcells), and perform detailed spatial analysis to each subset. After examining the accuracy of Poisson point process (PPP) in BS locations modeling, we take into account the Gibbs point processes as well as Neyman-Scott point processes and compare their accuracy in view of large-scale modeling test. Finally, we declare the inaccuracy of the PPP model, and reveal the general clustering nature of BSs deployment, which distinctly violates the traditional assumption. This paper carries out a first large-scale identification regarding available literatures, and provides more realistic and more general results to contribute to the performance analysis for the forthcoming heterogeneous cellular networks

On the Performance Gain of NOMA over OMA in Uplink Communication Systems

In this paper, we investigate and reveal the ergodic sum-rate gain (ESG) of non-orthogonal multiple access (NOMA) over orthogonal multiple access (OMA) in uplink cellular communication systems. A base station equipped with a single-antenna, with multiple antennas, and with massive antenna arrays is considered both in single-cell and multi-cell deployments. In particular, in single-antenna systems, we identify two types of gains brought about by NOMA: 1) a large-scale near-far gain arising from the distance discrepancy between the base station and users; 2) a small-scale fading gain originating from the multipath channel fading. Furthermore, we reveal that the large-scale near-far gain increases with the normalized cell size, while the small-scale fading gain is a constant, given by $\gamma$ = 0.57721 nat/s/Hz, in Rayleigh fading channels. When extending single-antenna NOMA to $M$-antenna NOMA, we prove that both the large-scale near-far gain and small-scale fading gain achieved by single-antenna NOMA can be increased by a factor of $M$ for a large number of users. Moreover, given a massive antenna array at the base station and considering a fixed ratio between the number of antennas, $M$, and the number of users, $K$, the ESG of NOMA over OMA increases linearly with both $M$ and $K$. We then further extend the analysis to a multi-cell scenario. Compared to the single-cell case, the ESG in multi-cell systems degrades as NOMA faces more severe inter-cell interference due to the non-orthogonal transmissions. Besides, we unveil that a large cell size is always beneficial to the ergodic sum-rate performance of NOMA in both single-cell and multi-cell systems. Numerical results verify the accuracy of the analytical results derived and confirm the insights revealed about the ESG of NOMA over OMA in different scenarios.Comment: 51 pages, 7 figures, invited paper, submitted to IEEE Transactions on Communication

Laplace Functional Ordering of Point Processes in Large-scale Wireless Networks

Stochastic orders on point processes are partial orders which capture notions like being larger or more variable. Laplace functional ordering of point processes is a useful stochastic order for comparing spatial deployments of wireless networks. It is shown that the ordering of point processes is preserved under independent operations such as marking, thinning, clustering, superposition, and random translation. Laplace functional ordering can be used to establish comparisons of several performance metrics such as coverage probability, achievable rate, and resource allocation even when closed form expressions of such metrics are unavailable. Applications in several network scenarios are also provided where tradeoffs between coverage and interference as well as fairness and peakyness are studied. Monte-Carlo simulations are used to supplement our analytical results.Comment: 30 pages, 5 figures, Submitted to Hindawi Wireless Communications and Mobile Computin