Graph theory and its applications
Graph theory and its applications
Dynamic TDMA Slot Assignment in Ad Hoc Networks
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
A survey on wireless mesh networks
IEEE Communications Magazine
Hi-index | 0.00 |
From the channel assignment schemes in time division multiple access (TDMA) slot assignment protocols developed in previous studies, we have found that these protocols do not have a convenient frame length reduction scheme after the expansion of the frame length. As the network size grows, the frame length expands rapidly, particularly when we set it as a power of two. A very long frame may result in poor channel utilization when it contains many unused slots. In this paper, we consider a wireless mesh network with a TDMA structure. We divide each code into time slots to form the channels. We propose a dynamic frame length expansion and recovery method termed adaptive distributed channel assignment (ADCA). This strategy is designed to enhance the utilization of the available channels by taking advantage of the spatial reuse concept. In ADCA, an increase in spatial reuse is achieved by adding a certain amount of control overhead. We show that the bandwidth saved due to the channel spatial reuse is larger than the additional bandwidth spent on the control overhead.