In practice, wireless networks are deployed over finite domains, the level of mobility is different at different locations, and user mobility is correlated over time. All these features have an impact on the temporal properties of interference which is often neglected. In this paper, we show how to incorporate correlated user mobility into the interference and outage correlation models. We use the random waypoint mobility model over a bounded one-dimensional domain as an example model inducing correlation, and we calculate its displacement law at different locations. Based on that, we illustrate that the temporal correlations of interference and outage are location-dependent, being lower close to the centre of the domain, where the level of mobility is higher than near the boundary. Close to the boundary, more time is also needed to see uncorrelated interference. Our findings suggest that an accurate description of the mobility pattern is important, because it leads to more accurate understanding/modeling of interference and receiver performance.

Interference statistics in vehicular networks have long been studied using the Poisson Point Process (PPP) for the locations of vehicles. In roads with few number of lanes and restricted overtaking, this model becomes unrealistic because it assumes that the vehicles can come arbitrarily close to each other. In this paper, we model the headway distance (the distance between the head of a vehicle and the head of its follower) equal to the sum of a constant hardcore distance and an exponentially distributed random variable. We study the mean, the variance and the skewness of interference at the origin with this deployment model. Even though the pair correlation function becomes complicated, we devise simple formulae to capture the impact of hardcore distance on the variance of interference in comparison with a PPP model of equal intensity. In addition, we study the extreme scenario where the interference originates from a lattice. We show how to relate the variance of interference due to a lattice to that of a PPP under Rayleigh fading.

No abstract

In this paper, we propose a mechanism for mode selection and spectrum allocation for in-band overlay D2D communication. A potential D2D user measures the activity over the spectrum allocated for D2D transmissions and uses a carrier sensing threshold to decide about its transmission mode. By appropriately selecting the carrier sensing threshold, the interference among D2D communication pairs can be controlled and their performance can be improved. Also, the distributed nature of this mechanism leads to less signalling overhead between D2D users and base stations even in dense deployments. Based on this method, we find spectrum allocation factors and carrier sensing thresholds for maximizing the rate of D2D users under target rate constraint for cellular users.

Abstract-We consider two small cell operators deployed in the same geographical area, sharing spectrum resources from a common pool. A method is investigated to coordinate the utilization of the spectrum pool without monetary transactions and without revealing operator-specific information to other parties. For this, we construct a protocol based on asking and receiving spectrum usage favors by the operators, and keeping a book of the favors. A spectrum usage favor is exchanged between the operators if one is asking for a permission to use some of the resources from the pool on an exclusive basis, and the other is willing to accept that. As a result, the proposed method does not force an operator to take action. An operator with a high load may take spectrum usage favors from an operator that has few users to serve, and it is likely to return these favors in the future to show a cooperative spirit and maintain reciprocity. We formulate the interactions between the operators as a repeated game and determine rules to decide whether to ask or grant a favor at each stage game. We illustrate that under frequent network load variations, which are expected to be prominent in small cell deployments, both operators can attain higher user rates as compared to the case of no coordination of the resource utilization.Keywords-Co-primary spectrum sharing, repeated games, spectrum pooling. I. INTRODUCTIONIn the state-of-art mobile communication systems, a network operator possesses a spectrum license that provides exclusive transmission rights for a particular range of radio frequencies. Spectrum assignment based on dedicated licenses resolves the issues related to inter-operator interference but it also results in low spectrum utilization efficiency. Inter-operator spectrum sharing is envisioned as one of the viable approaches to achieve higher operational bandwidth efficiency and meet the increasing mobile data traffic demand in a timely manner [1].In the limited spectrum pool (LSP) scenario, a limited number of operators share a common resource pool by relying on more flexible and adaptive prioritization policies than is currently possible with dedicated licenses [2]. Cognitive radio technologies are effective measures to resolve the sharing conflicts over the LSP under vertical spectrum sharing [3], where the lessor (owner) operator has higher legacy rights over the spectrum than the lessee operator. On the other hand, the co-primary or horizontal spectrum sharing scheme conceptualizes the case where authorized operators possess equal ownership on the spectrum being adopted [4]. However, a priori agreements should be made on the spectrum usage with regard to the long term share of an individual operator.The multilateral use of shared resources in the LSP can, for instance, be achieved with channel allocation schemes originally developed for single-operator systems. These schemes

No abstract

No abstract

We consider the Voronoi tessellation induced by a homogeneous and stationary Poisson point process of intensity λ > 0 in a quadrant, where the two half-axes represent boundaries. We show that the mean cell size is less than λ −1 when the seed is located exactly at the boundary, and it can be larger than λ −1 when the seed lies close to the boundary. In addition, we calculate the second moment of the cell size at two locations: (i) at the corner of a quadrant, and (ii) at the boundary of the half-plane. In both cases, we illustrate that the two-parameter Gamma distribution, with location-dependent parameters, provides a good fit. As a potential application, we use the Gamma approximations to study the degree distribution for secure in-connectivity in wireless sensor networks deployed over a bounded domain. Index TermsPhysical layer security, Poisson Voronoi tessellations, stochastic geometry I. INTRODUCTIONA random tessellation is a random subdivision of a space into disjoint regions or cells C i , see [1], [2] for a formal definition. Perhaps the most basic random tessellation model partitions the plane R 2 into Voronoi cells. In order to construct them, a set of random nuclei (or seeds) S i are first distributed, and then, the locations of the plane are associated with the nearest seed for the Euclidean distance. The boundaries of the Voronoi cells are equidistant to the two nearest K. Koufos and C.P. Dettmann are with the