Some complexity results about packet radio networks (Corresp.)
From MaRDI portal
Publication:3342476
Recommendations
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)