# Multi-channel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications

## Abstract

Current wireless networks mainly focus on delay-tolerant applications while demands for latency-sensitive applications are rising with VR/AR technologies and machine-to-machine IoT applications. In this paper we consider multi-channel, multi-radio scheduling at the MAC layer to optimize for the performance of prioritized, delay-sensitive demands. Our objective is to design an interference-free schedule that minimizes the maximum weighted refresh time among all edges, where the refresh time of an edge is the maximum number of time slots between two successive slots of that edge and the weights reflect given priorities. In the single-antenna unweighted case with *k* channels and *n* transceivers, the scheduling problem reduces to the classical edge coloring problem when \(k \ge \lfloor n/2 \rfloor \) and to strong edge coloring when \(k=1\), but it is neither edge coloring nor strong edge coloring for general *k*. Further, the priority requirement introduces extra challenges. In this paper we provide a randomized algorithm with an approximation factor of \(\tilde{O}\left( \max \left\{ \sqrt{\varDelta _p }, \frac{\varDelta _p}{\sqrt{k}} \right\} \log m \right) \) in expectation, where \(\varDelta _p\) denotes the maximum degree of the unweighted multi-graph, which is formed by duplicating each edge \(e_i\) for \(w_i\) times (\(w_i\) is \(e_i\)’s integral priority value), and *m* is the number of required link communications (\(f(n) \in \tilde{O}(h(n))\) means that \(f(n) \in O\left( h(n) \log ^k(h(n)) \right) \) for some positive constant *k*. The results are generalized to the multi-antenna settings. We evaluate the performance of our methods in different settings using simulations).

## Keywords

Latency sensitive scheduling Multi-channel scheduling Fairness## Notes

### Acknowledgements

This work was supported in part by NSF grants CCF-1439084, CCF-1535900, CNS-1553510, CNS-1618391, CNS-1553273, and DMS-1737812.

## Supplementary material

## References

- 1.Al Islam, A.A., Islam, M.J., Nurain, N., Raghunathan, V.: Channel assignment techniques for multi-radio wireless mesh networks: a survey. IEEE Commun. Surv. Tutorials
**18**(2), 988–1017 (2015)CrossRefGoogle Scholar - 2.Balakrishnan, H., Barrett, C.L., Kumar, V.S., Marathe, M.V., Thite, S.: The distance-2 matching problem and its relationship to the mac-layer capacity of ad hoc wireless networks. IEEE J. Sel. A. Commun.
**22**(6), 1069–1079 (2006)CrossRefGoogle Scholar - 3.Barrett, C.L., Istrate, G., Kumar, V.S.A., Marathe, M.V., Thite, S., Thulasidasan, S.: Strong edge coloring for channel assignment in wireless radio networks. In: Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW 2006), pp. 105–110, March 2006Google Scholar
- 4.Bicket, J., Aguayo, D., Biswas, S., Morris, R.: Architecture and evaluation of an unplanned 802.11 b mesh network. In: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, pp. 31–42. ACM (2005)Google Scholar
- 5.Chambers, B.: A rooftop ad hoc wireless network (2002). http://www.pdos.lcs.mit.edu/grid/
- 6.Chaporkar, P., Kar, K., Luo, X., Sarkar, S.: Throughput and fairness guarantees through maximal scheduling in wireless networks. IEEE Trans. Inf. Theory
**54**(2), 572–594 (2008)MathSciNetCrossRefGoogle Scholar - 7.Committee, L.S., et al.: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: High-Speed Physical Layer in the 5 GHZ Band, vol. 802, no. 1. IEEE Std., Piscataway (1999)Google Scholar
- 8.CREATE-NET and Technion: WING: wireless mesh network for next-generation internet (2012). http://www.wingproject.org. Accessed 15 June 2019
- 9.Ghosh, A., Wolter, D.R., Andrews, J.G., Chen, R.: Broadband wireless access with WiMax/802.16: current performance benchmarks and future potential. IEEE Commun. Mag.
**43**(2), 129–136 (2005)CrossRefGoogle Scholar - 10.Gonnet, G.H.: Expected length of the longest probe sequence in hash code searching. J. ACM (JACM)
**28**(2), 289–304 (1981)MathSciNetCrossRefGoogle Scholar - 11.Group, I.W., et al.: Part 11: wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Higher-Speed Physical Layer Extension in the 2.4 GHZ Band. ANSI/IEEE Std 802.11 (1999)Google Scholar
- 12.Hajek, B., Sasaki, G.: Link scheduling in polynomial time. IEEE Trans. Inf. Theory
**34**(5), 910–917 (1988)MathSciNetCrossRefGoogle Scholar - 13.Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput.
**10**(4), 718–720 (1981)MathSciNetCrossRefGoogle Scholar - 14.Joo, C., Lin, X., Shroff, N.B.: Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks. In: IEEE INFOCOM 2008 - The 27th Conference on Computer Communications, pp. 1777–1785, April 2008Google Scholar
- 15.Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, Philadelphia, PA, USA, pp. 1021–1030 (2004)Google Scholar
- 16.Mahdian, M.: The strong chromatic index of graphs. Dissertation, Department of Computer Science, University of Toronto (2000)Google Scholar
- 17.Nandagopal, T., Kim, T.E., Gao, X., Bharghavan, V.: Achieving MAC layer fairness in wireless packet networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 87–98. ACM (2000)Google Scholar
- 18.Raab, M., Steger, A.: “Balls into Bins”—a simple and tight analysis. In: Luby, M., Rolim, J.D.P., Serna, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 159–170. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49543-6_13CrossRefzbMATHGoogle Scholar
- 19.Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE/ACM Trans. Networking
**1**(2), 166–177 (1993)CrossRefGoogle Scholar - 20.Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Netw.
**5**(2), 81–94 (1999)CrossRefGoogle Scholar - 21.Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE/ACM Trans. Network. (TON)
**1**(2), 166–177 (1993)CrossRefGoogle Scholar - 22.Sharma, G., Mazumdar, R.R., Shroff, N.B.: On the complexity of scheduling in wireless networks. In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, MobiCom 2006, pp. 227–238. ACM, New York (2006)Google Scholar
- 23.Shi, H., Prasad, R.V., Onur, E., Niemegeers, I.G.M.M.: Fairness in wireless networks: issues, measures and challenges. IEEE Commun. Surv. Tutorials
**16**(1), 5–24 (2014)CrossRefGoogle Scholar - 24.Si, W., Selvakennedy, S., Zomaya, A.Y.: An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks. J. Parallel Distrib. Comput.
**70**(5), 505–524 (2010)CrossRefGoogle Scholar - 25.Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inf. Process. Lett.
**15**(1), 14–19 (1982)MathSciNetCrossRefGoogle Scholar - 26.Wan, P.J., Frieder, O., Jia, X., Yao, F., Xu, X., Tang, S.: Wireless link scheduling under physical interference model. IEEE (2011)Google Scholar
- 27.Wan, P.J., Jia, X., Dai, G., Du, H., Wan, Z., Frieder, O.: Scalable algorithms for wireless link schedulings in multi-channel multi-radio wireless networks. In: INFOCOM, 2013 Proceedings IEEE, pp. 2121–2129 (2013)Google Scholar
- 28.Wu, X., Srikant, R., Perkins, J.R.: Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. IEEE Trans. Mob. Comput.
**6**(6), 595–605 (2007)CrossRefGoogle Scholar