Packet-oblivious stable routing in multi-hop wireless networks
share
In this work, we study the fundamental problem of scheduling communication in multi-hop wireless networks. We focus on packet-oblivious routing protocols; that is, algorithms that do not take into account any historical information about packets or carried out by packets. Such protocols are well motivated in practice, as real forwarding protocols and corresponding data-link layer architectures are typically packet-oblivious. We provide a local-knowledge protocol, i.e., which is working without using any topological information, except for some upper bounds on the number of links and the network's degree, that is stable for a wide spectrum of packet injection rates. It is based on novel transmission schedules, called universally strong selectors, which, combined with some known queuing policies (LIS, SIS, NFS, FTG), makes it the best known local-knowledge packet-oblivious routing protocol regarding the injection rate for which stability is guaranteed. We also propose a global-knowledge protocol, which is stable if the packet injection rate per link is smaller than the inverse of the chromatic number of the collision graph associated with the network. Although the protocol does not take into account any historical information, it has to be seeded by some information about the network topology.
READ FULL TEXT
