A Stochastic Geometry Framework for Analyzing Pairwise-Cooperative Cellular Networks
@article{Baccelli2015ASG, title={A Stochastic Geometry Framework for Analyzing Pairwise-Cooperative Cellular Networks}, author={François Baccelli and Anastasios Giovanidis}, journal={IEEE Transactions on Wireless Communications}, year={2015}, volume={14}, pages={794-808} }
Cooperation in cellular networks is a promising scheme to improve system performance, especially for cell-edge users. In this work, stochastic geometry is used to analyze cooperation models where the positions of base stations follow a Poisson point process distribution and where Voronoi cells define the planar areas associated with them. For the service of each user, either one or two base stations are involved. If two, these cooperate by exchange of user data and channel related information…
114 Citations
Coverage by pairwise base station cooperation under adaptive geometric policies
- Computer Science2013 Asilomar Conference on Signals, Systems and Computers
- 2013
A cooperation model where the positions of base stations follow a Poisson point process distribution and where Voronoi cells define the planar areas associated with them shows benefits from cooperation, which are enhanced when Dirty Paper Coding is applied to eliminate the second neighbour interference.
Analysis of Static Cellular Cooperation between Mutually Nearest Neighboring Nodes
- Computer ScienceArXiv
- 2016
A grouping method based on node proximity that can be applied to any type of cooperation in pairs of transmitting nodes, and shows coverage gains from different signal cooperation that can reach up to 15% compared to the standard noncooperative coverage.
Coordinated multipoint in heterogeneous networks: A stochastic geometry approach
- Computer Science2013 IEEE Globecom Workshops (GC Wkshps)
- 2013
Using tools from stochastic geometry, an exact integral expression for the network coverage probability is derived in the scenario where a typical user can coherently combine the received signal from a pool of base stations, that are selected based on their average received power strengths or distance from the receiver.
A tunable base station cooperation scheme for poisson cellular networks
- Computer Science2018 52nd Annual Conference on Information Sciences and Systems (CISS)
- 2018
This work uses a Poisson point process to model BS locations and study a non-coherent joint transmission scheme, i.e., selected BSs jointly serve one user in the absence of channel state information (CSI).
Analyzing interference from static cellular cooperation using the Nearest Neighbour Model
- Computer Science2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
- 2015
This work proposes a grouping method based on proximity, a variation of the so called Nearest Neighbour Model, for the problem of base station cooperation where only singles and pairs of base stations are allowed to be formed.
Coordinated Multipoint Joint Transmission in Heterogeneous Networks
- Computer ScienceIEEE Transactions on Communications
- 2014
Numerical evaluations illustrate absolute gains in coverage probability for the general user and the worst case user compared with the noncooperative case and it is shown that no diversity gain is achieved using noncoherent joint transmission, whereas full diversity gain can be achieved at the receiver if the transmitting base stations have channel state information.
A Location-Dependent Base Station Cooperation Scheme for Cellular Networks
- Computer ScienceIEEE Transactions on Communications
- 2019
The signal-to-interference ratio (SIR) in Poisson networks is analyzed and it is shown that a moderate <inline-formula> jointly improves the average SIR performance and the network fairness.
Stochastic Cooperative Communications Using a Geometrical Probability Approach for Wireless Networks
- Computer Science, BusinessMob. Networks Appl.
- 2019
The mathematical proof and numerical results have shown that the closed-form distribution functions are valid and can be used to analyze the capacity of SCCGP and determine the minimum number of random RSs needed to satisfy an outage requirement.
Coverage Gains from the Static Cooperation of Mutually Nearest Neighbours
- Computer Science2016 IEEE Global Communications Conference (GLOBECOM)
- 2016
In this work, clusters are formed based on the Mutually Nearest Neighbour relation, which defines which stations cooperate in pair and which do not, and can be applied to any type of cooperation or coordination between pairs of transmitting nodes.
Wireless node cooperation with resource availability constraints
- Computer Science2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
- 2017
This work considers an alternative grouping criterion based on a distance that considers both geographic proximity and available resources of the stations, and derives analytical formulas on the proportion of cooperative pairs or single stations and the expected sum interference from each of the groups.
References
SHOWING 1-10 OF 62 REFERENCES
Coverage by pairwise base station cooperation under adaptive geometric policies
- Computer Science2013 Asilomar Conference on Signals, Systems and Computers
- 2013
A cooperation model where the positions of base stations follow a Poisson point process distribution and where Voronoi cells define the planar areas associated with them shows benefits from cooperation, which are enhanced when Dirty Paper Coding is applied to eliminate the second neighbour interference.
Coordinated multipoint in heterogeneous networks: A stochastic geometry approach
- Computer Science2013 IEEE Globecom Workshops (GC Wkshps)
- 2013
Using tools from stochastic geometry, an exact integral expression for the network coverage probability is derived in the scenario where a typical user can coherently combine the received signal from a pool of base stations, that are selected based on their average received power strengths or distance from the receiver.
An Analytical Framework for Multicell Cooperation via Stochastic Geometry and Large Deviations
- Computer ScienceIEEE Transactions on Information Theory
- 2013
It is confirmed analytically that cluster-edge mobiles are the bottleneck for network coverage and provide a plausible analytic framework for more realistic analysis of other multicell techniques.
Multi-cell coordination: A stochastic geometry approach
- Computer Science2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
- 2012
Numerical results show that the average achievable rate with interference coordination as well as the mean loss in rate with equal-bit partitioning increase with increasing average cluster size and increasing number of antennas at the transmitter.
Interference Coordination: Random Clustering and Adaptive Limited Feedback
- Computer ScienceIEEE Transactions on Signal Processing
- 2013
This paper model the base stations locations as a Poisson point process to provide a better analytical assessment of the performance of coordination and illustrates how this analysis can help solve network design problems such as identifying regions where coordination provides gains based on average cluster size, number of antennas, and number of feedback bits.
Using Poisson processes to model lattice cellular networks
- Computer Science2013 Proceedings IEEE INFOCOM
- 2013
This paper presents a Poisson-convergence result for a broad range of stationary (including lattice) networks subject to log-normal shadowing of increasing variance and proves the invariance of the Poisson limit with respect to the distribution of the additional shadowing or fading.
A Dynamic Clustering Approach in Wireless Networks with Multi-Cell Cooperative Processing
- Business, Computer Science2008 IEEE International Conference on Communications
- 2008
A novel dynamic greedy algorithm for the formation of the clusters of cooperating BSs is presented and it is shown that a dynamic clustering approach with a cluster consisting of 2 cells outperforms static coordination schemes with much larger cluster sizes.
A Tractable Approach to Coverage and Rate in Cellular Networks
- Computer ScienceIEEE Transactions on Communications
- 2011
The proposed model is pessimistic (a lower bound on coverage) whereas the grid model is optimistic, and that both are about equally accurate, and the proposed model may better capture the increasingly opportunistic and dense placement of base stations in future networks.
On cooperative wireless relaying: A joint routing and scheduling flow-based framework
- Computer Science2012 IEEE Global Communications Conference (GLOBECOM)
- 2012
It is established that, contrary to popular belief, cooperative relaying provides performance gains in a mid-size network surprisingly rarely, and if gains can be obtained, these gains are typically only marginal.
A Tractable Model for Noncoherent Joint-Transmission Base Station Cooperation
- Computer ScienceIEEE Transactions on Wireless Communications
- 2014
A tractable model for analyzing noncoherent joint-transmission base station (BS) cooperation is presented, taking into account the irregular BS deployment typically encountered in practice, and the signal-to-interference-plus-noise ratio (SINR) distribution with cooperation is precisely characterized in a generality-preserving form.