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

Alberto Suárez 0002

dblp:s/AlbertoSuarez2 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-5367-3968ORCID · verified

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

Computer networks · 2 · 1 since 2021Systems, architecture and hardware · 1

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
2 papers
Cellular and mobile networks · 87% Wireless networking · 11% Network optimization and economics · 2%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
frequency reuse
0.512021
Fine-Grained Frequency Reuse in Centralized Small Cell Networks · IEEE Trans. Mob. Comput. 2021
Cellular and mobile networks
interference management
0.512021
Fine-Grained Frequency Reuse in Centralized Small Cell Networks · IEEE Trans. Mob. Comput. 2021
Cellular and mobile networks
small cell networks
0.512021
Fine-Grained Frequency Reuse in Centralized Small Cell Networks · IEEE Trans. Mob. Comput. 2021
Graph algorithms and graph theory
graph coloring
0.112021
Fine-Grained Frequency Reuse in Centralized Small Cell Networks · IEEE Trans. Mob. Comput. 2021
Wireless networking
medium access control
0.112009
Team and Noncooperative Solutions to Access Control with Priorities · INFOCOM 2009
Wireless networking › wireless multimedia › qos support
priority access
0.112009
Team and Noncooperative Solutions to Access Control with Priorities · INFOCOM 2009
Network optimization and economics › game theory
game-theoretic networking
0.012009
Team and Noncooperative Solutions to Access Control with Priorities · INFOCOM 2009

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

system-level simulation · 1.0optimization theory · 1.0graph theory · 1.0mixed policies · 0.1game theory · 0.1
YearPublicationVenuePosition
2021 Fine-Grained Frequency Reuse in Centralized Small Cell Networks
abstract
Interference management for Small Cell (SC) networks has drawn great attention from both academia and industry due to its importance in Long-Term Evolution (LTE) and emerging 5G networks. Although various approaches have been proposed in the literature, many of them face practical limitations such as showing gains only in specific scenarios, relying on ideal fronthaul, or becoming computationally intractable as the network size increases. In this paper, a novel framework is proposed for interference management in centralized SC networks by jointly utilizing graph theory and optimization theory. It extends the classic center-edge frequency reuse schemes into a more fine-grained scale, thus capturing the complex interference relationships in SC networks. The cell-level resource partition can be semi-statically updated according to the traffic dynamics while existing Medium Access Control (MAC) schedulers can be used for subframe-level resource allocation, not requiring fiber fronthaul. LTE system-level simulation results show that the proposed scheme can significantly improve both cell edge and mean user throughput with practical complexity.
Tao Guo 0005, Alberto Suárez 0002
IEEE Trans. Mob. Comput.2
2009 Team and Noncooperative Solutions to Access Control with Priorities
abstract
We consider decentralized medium-access control in which many pairwise interactions occur between randomly selected users that belong to a large population. In each local interaction, the users involved compete over an access opportunity. A given user has a fixed number of access attempts and a fixed budget for buying different priority levels. In each time-slot, the access is attributed to the user with the largest priority level. We analyze this problem under both cooperative as well as competitive frameworks. We show that unlike many standard team problems, optimal pure policies do not exist in the team framework, but both an optimal solution as well as equilibria exist within the class of mixed policies. We establish structural properties as well as explicit characterization of these: We show that the optimal policy requires only three priority levels, whereas the noncooperative game possesses a unique symmetric equilibrium point that uses at most two priority levels. Our analysis is applied to power control over wireless capture channels, where the budget constraint corresponds to the battery lifetime.
Eitan Altman, Ishai Menache, Alberto Suárez 0002
INFOCOM3
2008 Using cross-system diversity in heterogeneous networks: Throughput optimization
Samson Lasaulce, Alberto Suárez 0002, Raul de Lacerda, Mérouane Debbah
Perform. Evaluation2