Some complexity results about packet radio networks (Corresp.)

DOI10.1109/TIT.1984.1056928zbMath0548.94048OpenAlexW2038603123MaRDI QIDQ3342476

Erdal Arikan

Publication date: 1984

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1984.1056928

zbMATH Keywords

packet radio networkcapacity regionnondeterministic polynomial time hard

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Queues and service in operations research (90B22) Communication, information (94A99) Applications of graph theory to circuits and networks (94C15)

Related Items (5)

Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ MAC protocols over wireless mesh networks: problems and perspective ⋮ Power consumption in packet radio networks ⋮ Power consumption in packet radio networks ⋮ Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models

This page was built for publication: Some complexity results about packet radio networks (Corresp.)