In this paper, we study stability and latency of routing in wireless networks
where it is assumed that no collision will occur. Our approach is inspired by
the adversarial queuing theory, which is amended in order to model wireless
communication. More precisely, there is an adversary that specifies
transmission rates of wireless links and injects data in such a way that an
average number of data injected in a single round and routed through a single
wireless link is at most $r$, for a given $r\in (0,1)$.