Intracell interference characterization and cluster interference for D2D communication

The homogeneous spatial Poisson point process (SPPP) is widely used for spatial modeling of mobile terminals (MTs). This process is characterized by a homogeneous distribution, complete spatial independence, and constant intensity measure. However, it is intuitive to understand that the locations of MTs are neither homogeneous, due to inhomogeneous terrain, nor independent, due to homophilic relations. Moreover, the intensity is not constant due to mobility. Therefore, assuming an SPPP for spatial modeling is too simplistic, especially for modeling realistic emerging device-centric frameworks such as device-to-device (D2D) communication. In this paper, assuming inhomogeneity, positive spatial correlation, and random intensity measure, we propose a doubly stochastic Poisson process, a generalization of the homogeneous SPPP, to model D2D communication. To this end, we assume a permanental Cox process (PCP) and propose a novel Euler-Characteristic-based approach to approximate the nearest-neighbor distribution function. We also propose a threshold and spatial distances from an excursion set of a chi-square random field as interference control parameters for different cluster sizes. The spatial distance of the clusters is incorporated into a Laplace functional of a PCP to analyze the average coverage probability of a cellular user. A closed-form approximation of the spatial summary statistics is in good agreement with empirical results, and its comparison with an SPPP authenticates the correlation modeling of D2D nodes

Simplicial Homology for Future Cellular Networks

Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this article, we use simplicial homology in order to not only compute the topology of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies while maximizing the usage of each one. Then, our energy conservation algorithm falls into the self-optimization feature of future cellular networks. It optimizes the energy consumption of the cellular network during off-peak hours while taking into account both coverage and user traffic. Finally, we present and discuss the performance of a disaster recovery algorithm using determinantal point processes to patch coverage holes

Diffusion in Networks and the Unexpected Virtue of Burstiness

Whether an idea, information, infection, or innovation diffuses throughout a society depends not only on the structure of the network of interactions, but also on the timing of those interactions. Recent studies have shown that diffusion can fail on a network in which people are only active in "bursts", active for a while and then silent for a while, but diffusion could succeed on the same network if people were active in a more random Poisson manner. Those studies generally consider models in which nodes are active according to the same random timing process and then ask which timing is optimal. In reality, people differ widely in their activity patterns -- some are bursty and others are not. Here we show that, if people differ in their activity patterns, bursty behavior does not always hurt the diffusion, and in fact having some (but not all) of the population be bursty significantly helps diffusion. We prove that maximizing diffusion requires heterogeneous activity patterns across agents, and the overall maximizing pattern of agents' activity times does not involve any Poisson behavior

Achieving Non-Zero Information Velocity in Wireless Networks

In wireless networks, where each node transmits independently of other nodes in the network (the ALOHA protocol), the expected delay experienced by a packet until it is successfully received at any other node is known to be infinite for signal-to-interference-plus-noise-ratio (SINR) model with node locations distributed according to a Poisson point process. Consequently, the information velocity, defined as the limit of the ratio of the distance to the destination and the time taken for a packet to successfully reach the destination over multiple hops, is zero, as the distance tends to infinity. A nearest neighbor distance based power control policy is proposed to show that the expected delay required for a packet to be successfully received at the nearest neighbor can be made finite. Moreover, the information velocity is also shown to be non-zero with the proposed power control policy. The condition under which these results hold does not depend on the intensity of the underlying Poisson point process.Comment: to appear in Annals of Applied Probabilit

Localization for Anchoritic Sensor Networks

We introduce a class of anchoritic sensor networks, where communications between sensor nodes is undesirable or infeasible, e.g., due to harsh environment, energy constraints, or security considerations