Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Quality-of-service in ad hoc carrier sense multiple access wireless networks
IEEE Journal on Selected Areas in Communications
Minimum delay routing for wireless networks with STDMA
Wireless Networks
Efficient group multicast node scheduling schemes in multi-hop wireless networks
Computer Communications
Minimizing multiplayer interactive delay in multihop wireless networks
International Journal of Communication Systems
| Hi-index | 0.01 |
Spatial reuse TDMA has been proposed as an access scheme for multi-hop radio networks where real-time service guarantees are important. 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. In reuse scheduling, there are several alternative assignment methods. Traditionally, transmission rights are given to nodes or to links, i.e., transmitter/receiver pairs. We present a comparison of these two approaches and show that both have undesirable properties in certain cases, e.g. link assignment gives a higher delay for low traffic loads but can achieve much higher throughput than node assignment. Furthermore, we propose a novel assignment strategy, achieving the advantages of both methods. Simulation results show that the proposed method can achieve the throughput of link assignment for high traffic loads as well as the lower delay characteristics of node assignment for low traffic loads.