TY - GEN
T1 - Access scheduling on the control channels in TDMA wireless mesh networks
AU - Cheng, Hongju
AU - Jia, Xiaohua
AU - Liu, Hai
PY - 2007
Y1 - 2007
N2 - 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 broadcast the control packet to any one-hop neighbor in one scheduling cycle. The objective is to minimize the total number of different time-slots in the scheduling cycle. The original contributions of this paper are that it has taken the large interference range problem into consideration for the first time and proposed two algorithms for the scheduling problem, namely, the Speak Once algorithm and the Speak Separately algorithm. We prove that the number of time-slots by the second algorithm is upper-bounded by min(n, 2K) in some special cases, where n is the node number and K is the maximum node degree. The fully distributed versions of these algorithms are given in this paper. Simulation results also show that the performance of the Speak Separately algorithm is rather better than that of the Speak Once algorithm. © Springer-Verlag Berlin Heidelberg 2007.
AB - 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 broadcast the control packet to any one-hop neighbor in one scheduling cycle. The objective is to minimize the total number of different time-slots in the scheduling cycle. The original contributions of this paper are that it has taken the large interference range problem into consideration for the first time and proposed two algorithms for the scheduling problem, namely, the Speak Once algorithm and the Speak Separately algorithm. We prove that the number of time-slots by the second algorithm is upper-bounded by min(n, 2K) in some special cases, where n is the node number and K is the maximum node degree. The fully distributed versions of these algorithms are given in this paper. Simulation results also show that the performance of the Speak Separately algorithm is rather better than that of the Speak Once algorithm. © Springer-Verlag Berlin Heidelberg 2007.
KW - Access scheduling
KW - Algorithms
KW - Control channel
KW - TDMA (time-division-multiple access)
KW - Wireless mesh networks
UR - http://www.scopus.com/inward/record.url?scp=38149127140&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-38149127140&origin=recordpage
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783540744757
VL - 4706 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 247
EP - 260
BT - Computational Science and Its Applications - ICCSA 2007
PB - Springer Verlag
T2 - International Conference on Computational Science and its Applications, ICCSA 2007
Y2 - 26 August 2007 through 29 August 2007
ER -