Login / Signup
Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time.
Alper Köse
Noyan Evirgen
Hakan Gökcesu
Kaan Gökcesu
Muriel Médard
Published in:
CoRR (2017)
Keyphrases
</>
wireless ad hoc networks
optimal scheduling
end to end
ad hoc networks
scheduling problem
multipath
wireless networks
scheduling algorithm
multi hop
special case
distributed computing
computational complexity
service differentiation
routing protocol
wireless channels
fault tolerant
np hard