Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Multiple Access Protocol for Power-Controlled Wireless Access Nets
IEEE Transactions on Mobile Computing
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks
Computer Communications
Spatial channel reuse in wireless sensor networks
Wireless Networks
Approximate dynamic programming for link scheduling in wireless mesh networks
Computers and Operations Research
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Topology control for effective interference cancellation in multi-user MIMO networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Self-stabilizing algorithm of two-hop conflict resolution
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On optimal SINR-based scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Measurement-based link scheduling for maritime mesh networks with directional antennas
International Journal of Network Management
Distributed time slot assignment in wireless ad hoc networks for STDMA
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Topology control for effective interference cancellation in multiuser MIMO networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Spatial reuse TDMA is an access scheme for multi-hop radio networks. The idea is to increase capacity by letting several radio terminals use the same time slot when possible. A time slot can be shared when the radio units are geographically separated such that small interference is obtained. STDMA schedules can assign transmission rights to nodes or alternatively assign transmission rights to links, i.e. transmitter/receiver pairs. Here we compare these two methods and determine which one is preferable. We show that only the connectivity of the network and the input traffic load of the network is needed in order to determine whether node or link assignment is preferable.