Wireless link scheduling under a graded SINR interference model
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the fundamental limits of broadcasting in wireless mobile networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Approximation algorithms for wireless link scheduling with SINR-based interference
IEEE/ACM Transactions on Networking (TON)
The fundamental limits of broadcasting in dense wireless mobile networks
Wireless Networks
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG)
Adaptive instantiation of the protocol interference model in wireless networked sensing and control
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
It is known that CSMA/CA channel access schemes are not well suited to meet the high traffic demand of wireless mesh networks. One possible way to increase traffic carrying capacity is to use a spatial TDMA (STDMA) approach in conjunction with the physical interference model, which allows more aggressive scheduling than the protocol interference model on which CSMA/CA is based. While an efficient centralized solution for STDMA with physical interference has been recently proposed, no satisfactory distributed approaches have been introduced so far. In this paper, we first prove that no localized distributed algorithm can solve the problem of building a feasible schedule under the physical interference model. Motivated by this, we design a global primitive, called SCREAM, which is used to verify the feasibility of a schedule during an iterative distributed scheduling procedure. Based on this primitive, we present two distributed protocols for efficient, distributed scheduling under the physical interference model, and we prove an approximation bound for one of the protocols. We also present extensive packet-level simulation results, which show that our protocols achieve schedule lengths very close to those of the centralized algorithm and have running times that are practical for mesh networks.