Abstract
In this paper, we have considered the distributed scheduling problem for channel access in TDMA wireless mesh networks. The problem is to assign time-slot(s) for nodes to access the channels, and it is guaranteed that nodes can communicate with all their one-hop neighbors in the assigned time-slot(s). And the objective is to minimize the cycle length, i.e., the total number of different time-slots in one scheduling cycle. In single-channel ad hoc networks, the best known result for this problem is proved to be K 2 in arbitrary graphs (IEEE Trans Comput C-36(6):729–737, 1987) and 25K in unit disk graphs (IEEE/ACM Trans Netw pp 166–177, 1993) with K as the maximum node degree. There are multiple channels in wireless mesh networks, and different nodes can use different control channels to reduce congestion on the control channels. In this paper, we have considered two scheduling models for wireless mesh networks. The first model is that each node has two radios, and the scheduling is simultaneously done on the two radios. We have proved that the upper bound of the cycle length in arbitrary graphs can be 2K. The second model is that the time-slots are scheduled for the nodes regardless of the number of radios on them. In this case, we have proved that the upper bound can be (4K−2). We also have proposed greedy algorithms with different criterion. The basic idea of these algorithms is to organize the conflicting nodes by special criterion, such as node identification, node degree, the number of conflicting neighbors, etc. And a node cannot be assigned to a time-slot(s) until all neighbor nodes, which have higher criterion and might conflict with the current node, are assigned time-slot(s) already. All these algorithms are fully distributed and easy to realize. Simulations are also done to verify the performance of these algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akyildiz I, Wang X, Wang W (2005) Wireless mesh networks: a survey. Comput Netw 47:445–487
Bertossi A, Bonuccelli M (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans Netw 3(4):441–449
Battiti R, Bertossi A, Brunato M (2000) Distributed code assignment in multihop radio networks: object-oriented software simulations. In: IEEE SoftCOM’00, Rijeka, Croatia, October 2000
Cai Z, Lu M, Georghiades C (2003) Topology-transparent time division multiple access broadcast scheduling in multihop packet radio networks. IEEE Trans Veh 52(4):970–984
Chandra R, Bahl P (2004) MultiNet: connecting to multiple IEEE 802.11 networks using a single wireless card. In: IEEE INFOCOM, 2004
Chen J, Ting P, Lin C, Chen J (2004) A novel broadcast scheduling strategy using factor graphs and sum-product algorithm. In: GLOBECOM’04, vol 6, 2004, pp 4048–4053
Chlamtac I, Pinter S (1987) Distributed nodes organization algorithm for channel access in a multihop dynamic radio network. IEEE Trans Comput C-36(6):729–737
Cidon I, Sidi M (1989) Distributed assignment algorithm for multihop packet radio networks. IEEE Trans Comput 38(10):1353–1361
Hu L (1993) Distributed code assignments for CDMA packet radio networks. IEEE/ACM Trans Netw 1(6):668–676
Hung K, Yum T (1990) An efficient code assignment algorithm for multihop spread spectrum packet radio networks. In: IEEE GLOBECOM’90, vol 1, 1990, pp 271–274
Ju J, Li V (1999) TDMA scheduling design of multihop packet radio networks based on Latin squares. IEEE J Sel Areas Commun 17(8):1345–1352
Kyasanur P, Chereddi C, Vaidya N (2006) Net-X: system extensions for supporting multiple channels, multiple radios, and other radio capabilities. Technical Report, Department of Computer Science, University of Illinois at Urbana-Champaign
Lloyd E (2002) Broadcast scheduling for TDMA in wireless multi-Hop networks. In: Stojmenovic I (ed) Handbook of wireless networks and mobile computing. Wiley, New York, pp 347–370
Makansi T (1987) Transmitter-oriented code assignment for multihop packet radio networks. IEEE Trans Commun C-35(12):1379–1382
Maxim 2.4 GHz 802.11b Zero-IF Transceivers. http://pdfserv.maxim-ic.com/en/ds/MAX2820-MAX2821.pdf
Ngo C, Li V (2003) Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms. IEEE Trans Commun 51:1439–1441
Ramanathan S (1999) A unified framework and algorithm for channel assignment in wireless networks. Wirel Netw 81–94
Ramanathan S, Lloyd E ( 1993) Scheduling algorithms for multi-hop radio Nnetworks. IEEE/ACM Trans Netw 166–177
Su Y, Su S, Li J (2004) Topology-transparent link activation scheduling schemes for multihop CDMA Ad Hoc networks. In: IEEE GLOBECOM’04, vol 6, 2004, pp 3563–3567
Tang Z, Garcia-Luna-Aceves J (1999) A protocol for topology-dependent transmission scheduling in wireless networks. IEEE Commun Netw Conf 3:1333–1337
Xiong N, Defago X, Jia X, Yang Y, He Y (2006) Design and analysis of a self-tuning proportional and integral controller for active queue management routers to support TCP flows. In: Proc IEEE Infocomm 2006, Barcelona, Spain, April 23–29, 2006
Xiong N, Yang L, Cao J, Yang Y, He Y (2008) PIDNN: an efficient and distributed flow control approach for multicast networks. ACM Trans Autonom Adaptive Syst, Special Issue on Adaptive Learning in Autonomic Communication, 2008
Xu K, Gerla M, Bae S (2002) How effective is the IEEE 802.11 RTS/CTS handshake in Ad Hoc networks. In: IEEE GLOBECOM’02, Taipei, Taiwan, Nov 2002, pp 72–76
Zhu C, Corson M (2001) A five-phase reservation protocol (FPRP) for mobile Ad Hoc networks. Wirel Netw 7:371–384
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cheng, H., Xiong, N., Yang, L.T. et al. Distributed scheduling algorithms for channel access in TDMA wireless mesh networks. J Supercomput 63, 407–430 (2013). https://doi.org/10.1007/s11227-008-0244-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-008-0244-7