• Corpus ID: 18240676

How to group wireless nodes together?

@article{Giovanidis2016HowTG,
  title={How to group wireless nodes together?},
  author={Anastasios Giovanidis},
  journal={ArXiv},
  year={2016},
  volume={abs/1602.03906}
}
This report presents a survey on how to group together in a static way planar nodes, that may belong to a wireless network (ad hoc or cellular). The aim is to identify appropriate methods that could also be applied for Point Processes. Specifically matching pairs and algorithms are initially discussed. Next, specifically for Point Processes, the Nearest Neighbour and Lilypond models are presented. Properties and results for the two models are stated. Original bounds are given for the value of… 
View PDF on arXiv

References

SHOWING 1-10 OF 28 REFERENCES
Analyzing interference from static cellular cooperation using the Nearest Neighbour Model
TLDR
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.
Cooperative Base Station Coloring for Pair-Wise Multi-Cell Coordination
TLDR
The main advantage of the proposed coordination method is that the BS selection conflict problem is prevented, while users are guaranteed to communicate with their two closest BSs in any irregular BS topology.
A Stochastic Geometry Framework for Analyzing Pairwise-Cooperative Cellular Networks
TLDR
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, focused on a case of limited information based on Willems' encoding.
Coverage by pairwise base station cooperation under adaptive geometric policies
TLDR
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.
A Dynamic Clustering Approach in Wireless Networks with Multi-Cell Cooperative Processing
TLDR
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.
Coordinated Multipoint Joint Transmission in Heterogeneous Networks
TLDR
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.
Coordinated multipoint in heterogeneous networks: A stochastic geometry approach
TLDR
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 0–1 program to form minimum cost clusters in the downlink of cooperating base stations
TLDR
This work highlights the combinatorial nature of the problem, exploits this to describe the system of users and base stations as a graph and formulate a pure 0-1 program, which suggests a cost optimal way to form clusters and assign user subsets to them.
Interference Coordination: Random Clustering and Adaptive Limited Feedback
TLDR
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.
Studying the SINR Process of the Typical User in Poisson Networks Using Its Factorial Moment Measures
TLDR
The presented framework consisting of the mathematical representations of SINR characteristics with respect to the factorial moment measures holds for the whole domain of SinR, and is amenable to considerable model extension.
...
...