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

Dario Lucatti

dblp:52/927 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1996
—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
Cellular and mobile networks · 67% Wireless networking · 33%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › cellular network performance
cellular system capacity
0.011996
Bounds and Performance of Reuse Partitioning in Cellular Networks · INFOCOM 1996
Wireless networking › channel assignment
dynamic channel allocation
0.011996
Bounds and Performance of Reuse Partitioning in Cellular Networks · INFOCOM 1996
Cellular and mobile networks › frequency reuse
reuse partitioning
0.011996
Bounds and Performance of Reuse Partitioning in Cellular Networks · INFOCOM 1996

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

numerical evaluation · 0.0analytical bounding · 0.0
YearPublicationVenuePosition
1996 Bounds and Performance of Reuse Partitioning in Cellular Networks
abstract
We study a scheme that allows a smooth increase of the capacity of a cellular system for circuit-switching by applying cell-partitioning and dynamic channel allocation techniques. A bound is computed for this reuse partitioning scheme that gives the maximum theoretical gain accomplished in the system bandwidth. The performance of the proposed scheme, in terms of blocking probability, is evaluated both when the position of the mobiles remains unchanged and when mobility is taken into account. The numerical results show that the capacity of the proposed scheme is higher than that of a fixed allocation scheme.
Dario Lucatti, Achille Pattavina, Vittorio Trecordi
INFOCOM1