Abstract
Shortest link scheduling (SLS) is one of the most fundamental problems in wireless networks. Almost all of the state-of-the-art approximation algorithms for SLS in wireless networks are resorted to the ellipsoid method for linear programming exclusively. However, the ellipsoid method can require an inordinate amount of running time and memory even for a moderate sized input, and consequently is often unusable in practice. This paper presents a completely new paradigm for SLS in general wireless networks which is radically different from the prevailing ellipsoid method, and is much faster and simpler. The broarder applicability of this new paradigm is demonstrated by its applications to SLS in wireless single-channel single-radio networks under the physical interference model, wireless multi-channel multi-radio networks under the protocol interference model, and wireless multi-input multi-output networks with receiver-side interference suppression under the protocol interference model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and application. Theor. Comput. 8(1), 121–164 (2012)
Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: Gambling in a rigged casino: the adversarial multi-armed bandit problem. In: Proceedings of IEEE FOCS, pp. 322–331 (1995)
Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., Warmuth, M.: How to use expert advice. J. Assoc. Comput. Mach. 44(3), 427–485 (1997)
Chafekar, D., Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: IEEE INFOCOM, pp. 1166–1174 (2008)
Freund, Y., Schapire, R.: A decision-theoretic generalization of online learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119–139 (1997)
Freund, Y., Schapire, R.: Adaptive game playing using multiplicative weights. Games Econ. Behav. 29, 79–103 (1999)
Han, B., Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Distributed strategies for channel allocation and scheduling in software-defined radio networks. In: Proceedings of the IEEE INFOCOM, pp. 1521–1529 (2009)
Jansen, K., Porkolab, L.: On preemptive resource constrained scheduling: polynomial-time approximation schemes. SIAM J. Discrete Math. 20(3), 545–563 (2006)
Khandekar, R.: Lagrangian relaxation based algorithms for convex programming problems, Ph.D. thesis, Indian Institute of Technology, Delhi (2004)
Kodialam, M., Nandagopal, T.: Characterizing achievable ratesin multi-hop wireless networks: the joint routing and scheduling problem. In: Proceedings of the ACM MobiCom (2003)
Kodialam, M., Nandagopal, T.: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In: Proceedings of the ACM MobiCom (2005)
Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Algorithmic aspects of capacity in wireless networks. SIGMETRICS Perform. Eval. Rev. 33(1), 133–144 (2005)
Liu, J., Hou, Y.T., Shi, Y., Sherali, H.: Cross-layer optimization for MIMO-based wireless ad hoc networks: routing. IEEE J. Sel. Areas Commun. Power Allocation Bandwidth allocation 6, 913–926 (2008)
Ma, C., Al-dhelaan, F., Wan, P.-J.: Maximum independent set of links with a monotone and sublinear power assignment. In: Ren, K., Liu, X., Liang, W., Xu, M., Jia, X., Xing, K. (eds.) WASA 2013. LNCS, vol. 7992, pp. 64–75. Springer, Heidelberg (2013)
Ma, C., Al-dhelaan, F., Wan, P.-J.: Maximum independent set of links with power control. In: Ren, K., Liu, X., Liang, W., Xu, M., Jia, X., Xing, K. (eds.) WASA 2013. LNCS, vol. 7992, pp. 474–485. Springer, Heidelberg (2013)
Schrijver, A.: Combinatorial Optimization. Algorithms and Combinatorics., vol. 24. Springer, Heidelberg (2003)
V. Vovk. A game of prediction with expert advice. In: Proceedings of the 8th Annual Conference on Computational Learning Theory, pp. 51–60 (1995)
Wan, P.-J.: Multiflows in Multihop Wireless Networks, In: ACM MOBIHOC, pp. 85–94 (2009)
Wan, P.-J., Chen, D., Dai, G., Wang, Z., Yao, F.: Maximizing capacity with power control under physical interference model in duplex mode. In: IEEE INFOCOM, pp. 415–423 (2012)
Wan, P.-J., Cheng, Y., Wang, Z., Yao, F.: Multiflows in multi-channel multi-radio multihop wireless networks. In: IEEE INFOCOM, pp. 846–854 (2011)
Wan, P.-J., Frieder, O., Jia, X., Yao, F., Xu, X.-H., Tang, S.-J.: Wireless link scheduling under physical interference model. In: IEEE INFOCOM, pp. 838–845 (2011)
Wan, P.-J., Jia, X., Dai, G., Du, H., Wan, Z.G., Frieder, O.: Scalable algorithms for wireless link schedulings in multi-channel multi-radio wireless networks. In: IEEE INFOCOM, pp. 2121–2129 (2013)
Wan, P.-J., Jia, X., Dai, G., Du, H., Frieder, O.: Fast and simple approximation algorithms for maximum weighted independent set of links. In: IEEE INFOCOM, pp. 1653–1661 (2014)
Wan, P.-J., Wang, L., Ma, C., Wang, Z., Xu, B., Li, M.: Maximizing wireless network capacity with linear power: breaking the logarithmic barrier. In: IEEE INFOCOM, pp. 135–139 (2013)
Wan, P.-J., Xu, B., Frieder, O., Ji, S., Wang, B., Xu, X.: Capacity maximization in wireless MIMO networks with receiver-side interference suppression. In: ACM MOBIHOC, pp. 145–154 (2014)
Acknowledgements
This work was supported in part by the National Science Foundation of USA under grants CNS-1219109 and CNS-1454770, and by the National Natural Science Foundation of P. R. China under grants 61529202, 61170216, and 61572131.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Al-dhelaan, F., Wan, PJ., Yuan, H. (2016). A New Paradigm for Shortest Link Scheduling in Wireless Networks: Theory and Applications. In: Yang, Q., Yu, W., Challal, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2016. Lecture Notes in Computer Science(), vol 9798. Springer, Cham. https://doi.org/10.1007/978-3-319-42836-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-42836-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42835-2
Online ISBN: 978-3-319-42836-9
eBook Packages: Computer ScienceComputer Science (R0)