Access Scheduling on the Control Channels in TDMA Wireless Mesh Networks

摘要

The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access the control channels so that it is guaranteed that each node can transmit a control packet to any one-hop neighbor in the scheduling cycle. The objective is to minimize the total number of different time-slots in the cycle. This paper has taken the large interference range problem into consideration and proposed two algorithms for the scheduling problem, namely, One Neighbor Per Cycle (ONPC) algorithm and All Neighbors Per Cycle (ANPC) algorithm. The number of time-slots by ANPC algorithm is upper-bounded by min(n, AK - 2) in some special cases, where n is the node number and K is the maximum node degree. Both centralized and fully distributed versions are given. Simulation results also show that the performance of ONPC is rather better than ANPC.