Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model

DOI10.1016/j.tcs.2023.113718OpenAlexW4317528610MaRDI QIDQ2682938

Publication date: 1 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.07921

zbMATH Keywords

admission control distributed algorithms wireless networks applications of graph theory 2-hop interference model

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
Conflict graphs and the SINR-capacity of the mean power scheme
The performance of an upper bound on the fractional chromatic number of weighted graphs
Matching theory
The ellipsoid method and its consequences in combinatorial optimization
NP-completeness of some generalizations of the maximum matching problem
Induced matchings
Geometric algorithms and combinatorial optimization.
The topology of wireless communication on a line
Approximating weighted induced matchings
Graph imperfection. I
Wireless network algorithmics
The Topology of Wireless Communication
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
Link scheduling in polynomial time
Local-Global Phenomena in Graphs
Performance limits for channelized cellular telephone systems
Distributed Computing: A Locality-Sensitive Approach
Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks
On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models
SINR Diagrams
A Theorem on Coloring the Lines of a Network
Distributed link scheduling in wireless networks
Leader election in SINR model with arbitrary power control

This page was built for publication: Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model