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

Hervé Legay

dblp:64/9708 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0002-9563-7869ORCID · reported

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

Computer networks · 1 · 1 since 2021

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
Vehicular, aerial and satellite networks · 50% Cellular and mobile networks · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › interference management
interference mitigation
1.012026
Interference Mitigation in Multibeam Satellite Networks as an Optimal Sublattice Problem · IEEE Trans. Commun. 2026
Vehicular, aerial and satellite networks
satellite communication
1.012026
Interference Mitigation in Multibeam Satellite Networks as an Optimal Sublattice Problem · IEEE Trans. Commun. 2026
Mathematical optimization
discrete optimization
0.312026
Interference Mitigation in Multibeam Satellite Networks as an Optimal Sublattice Problem · IEEE Trans. Commun. 2026

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

lattice theory · 2.0enumerative algorithm · 2.0discrete geometry · 2.0
YearPublicationVenuePosition
2026 Interference Mitigation in Multibeam Satellite Networks as an Optimal Sublattice Problem
abstract
Resource distribution in radio networks aims at maximizing spectrum utilization while minimizing interference. In this paper, we consider the problem of uniform radio resource distribution on a periodic grid. We formulate the problem as finding the sublattice configuration that maximises the distance between adjacent resources, crucial for reducing interference and improving throughput performance. Leveraging concepts from lattice theory and discrete geometry, we present an enumerative, parallelizable algorithm to explore all possible sublattices and efficiently identify the optimal configurations. Additionally, we investigate the existence and properties of scaled-rotated sublattices, exploring how different lattice geometries impact optimal solutions. Numerical results demonstrate the effectiveness of the proposed algorithm and highlight insights into optimal sublattice design for various lattice structures. Furthermore, the results are applied to the identification of the beam layout in a fixed multibeam geostationary satellite. Numerical results show that the spectral efficiency of the optimised sublattice is higher than all other sublattices. This work thus advances the field of radio resource distribution and offers practical implications for improving satellite network performance.
Francesco Lisi, Piero Angeletti, João F. C. Mota, Julien Maurin, Hervé Legay, George Goussetis
IEEE Trans. Commun.5