Some complexity results about packet radio networks (Corresp.)

DOI10.1109/TIT.1984.1056928MaRDI QIDQ3342476zbMATH OpenOpenAlexFDO

Authors 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) Applications of graph theory to circuits and networks (94C15) Communication, information (94A99)

Recommendations

• On the computational complexity of continuous routing
• Packet Routing: Complexity and Algorithms
• Transmissions in a network with capacities and delays
• Packet transmission in radio networks
• On the capacity assignment problem in packet-switching computer networks

Cited in

(10)

• Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models
• Power consumption in packet radio networks
• MAC protocols over wireless mesh networks: problems and perspective
• scientific article; zbMATH DE number 2099717 (Why is no real title available?)
• Bounding the maximum size of a packet radio network
• Radio Network Lower Bounds Made Easy
• scientific article; zbMATH DE number 4145830 (Why is no real title available?)
• On the np-completeness of certain network testing problems
• Distance edge coloring and collision-free communication in wireless sensor networks
• Power consumption in packet radio networks (extended abstract)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342476)