Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

F. Fleischer

dblp:79/2181 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 50% Network optimization and economics · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network optimization and economics › network design
network planning
0.112009
Distributional Properties of Euclidean Distances in Wireless Networks Involving Road Systems · IEEE J. Sel. Areas Commun. 2009
Wireless networking
stochastic geometry
0.112009
Distributional Properties of Euclidean Distances in Wireless Networks Involving Road Systems · IEEE J. Sel. Areas Commun. 2009
Performance modeling and evaluation › network performance analysis
interference modeling
0.012009
Distributional Properties of Euclidean Distances in Wireless Networks Involving Road Systems · IEEE J. Sel. Areas Commun. 2009

Methods — techniques the papers use, named apart from their topics

voronoi tessellation · 0.2monte carlo simulation · 0.2cox processes · 0.2point processes · 0.1point process · 0.1
YearPublicationVenuePosition
2009 Distributional Properties of Euclidean Distances in Wireless Networks Involving Road Systems
abstract
Stochastic models for hierarchical telecommunication networks are considered, which can be applied to the analysis and planning of large wireless networks. The network geometry is modelled by random geometric graphs, and the locations of network nodes by point processes on the edges of these graphs. In particular, the locations of high-level components (HLC) are modeled by Cox processes concentrated on the edge sets of random graphs, where their serving zones are the cells of Voronoi tessellations induced by these Cox processes. The locations of low-level components (LLC) are either modeled by planar Poisson processes or by Cox processes concentrated on the same edge sets as the HLC. Distributional properties of distances between the locations of network nodes are closely related with the interference geometry and, consequently, the performance of wireless networks. Representation formulas are derived for the distribution function and density of the typical Euclidean connection distance between LLC and HLC. They lead to suitable estimators of these characteristics, which can be computed by Monte Carlo simulation of the typical serving zone and the typical segment system in it, respectively.
F. Fleischer, Florian Voss, Volker Schmidt, Catherine Gloaguen
IEEE J. Sel. Areas Commun.1