This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links" cannot be simultaneously activated, otherwise transmissions will fail. He...
详细信息
This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links" cannot be simultaneously activated, otherwise transmissions will fail. Here, we consider any binary model of interference. We use the model described by Bui et al. in [L. X. Bui, S. Sanghavi and R. Srikant, Distributed linkscheduling with constant overhead, IEEE/ACM Trans. Netw. 17(5) (2009) 1467-1480;S. Sanghavi, L. Bui and R. Srikant, Distributed linkscheduling with constant overhead, in Proc. ACM Sigrnetrics (San Diego, CA, USA, 2007), pp. 313-324.1. We assume that time is slotted and during each slot there are two phases: one control phase in which a link scheduling algorithm determines a set of non-interfering links to be activated, and a data phase in which data is sent through these links. We assume random arrivals on each link during each slot, so that a queue is associated to each link. Since nodes do not have a global knowledge of the queues sizes, our aim (like in [L. X. Bui, S. Sanghavi and R. Srikant, Distributed linkscheduling with constant overhead, IEEE/ACM Trans. Netw. 17(5) (2009) 1467-1480;S. Sanghavi, L. Bui and R. Srikant, Distributed linkscheduling with constant overhead, in Proc. ACM Sigmetrics (San Diego, CA, USA, 2007), pp. 313-324.]) is to design a distributed link scheduling algorithm. To be efficient, the control phase should be as short as possible;this is done by exchanging control messages during a constant number of mini-slots (constant overhead). In this paper, we design the first fully distributed local algorithm with the following properties: it works for any arbitrary binary interference model;it has a constant overhead (independent of the size of the network and the values of the queues), and it does not require any knowledge of the queue-lengths. We prove that this algorithm gives a maximal set of active links, where for any non-active link there exists at least one active link in its interfer
暂无评论