Some complexity results about packet radio networks (Corresp.)

DOI10.1109/TIT.1984.1056928zbMATH Open0548.94048OpenAlexW2038603123MaRDI QIDQ3342476FDOQ3342476

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

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

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)

Cited In (10)

• Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models
• Power consumption in packet radio networks
• Title not available (Why is that?)
• MAC protocols over wireless mesh networks: problems and perspective
• Bounding the maximum size of a packet radio network
• Radio Network Lower Bounds Made Easy
• Title not available (Why is that?)
• 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)