Abstract
Radio links in wireless mesh networks (WMN) can select one of several modulation and coding schemes (MCS). A MCS assignment influences links data rates and their mutual interference, and therefore should be optimized. We consider joint optimization of link rate assignment and transmission scheduling in order to maximize the minimal flow in a WMN. One of the main difficulties stems from the requirement that each link has to use only one selected MCS for all its transmissions. This requirement leads to a complicated exact branch-and-price method, which is quite time-consuming for networks of practical size. Thus, we propose an original heuristic based on simulated annealing that utilizes specific characteristics of the problem. The method provides a balance between sub-optimality of the obtained solutions and the running time. The presented method is the main purpose and novelty of the paper. An extensive numerical study illustrates the effectiveness of the proposed approach.
Similar content being viewed by others
References
Akyildiz, I., & Wang, X. (2005). A survey in wireless mesh networks. IEEE Communications Magazine, 43(9), 23–30.
Pathak, P. H., & Dutta, R. (2011). A survey of network design problems and joint design approaches in wireless mesh networks. IEEE Communications Surveys Tutorials, 13(3), 396–428.
Ashraf, U., Abdellatif, S., & Juanole, G. (2011). Route selection in IEEE 802.11 wireless mesh networks. Telecommunication Systems, 1–19.
Vergados, D., Sgora, A., Vergados, D., Vouyioukas, D., & Anagnostopoulos, I. (2012). Fair TDMA scheduling in wireless multihop networks. Telecommunication Systems, 50, 181–198.
Capone, A., Carello, G., Filippini, I., Gualandi, S., & Malucelli, F. (2010). Routing, scheduling and channel assignment in wireless mesh networks: Optimization models and algorithms. Ad Hoc Networks, 8(6), 545–563.
Pióro, M., Zotkiewicz, M., Staehle, B., Staehle, D., & Yuan, D. (2011). On Max-Min Fair Flow Optimization in Wireless Mesh Networks. Ad Hoc Networks,. doi:10.1016/j.adhoc.2011.05.003.
Grace, K., Stine, J., & Durst, R. (2005). An approach for modestly directional communications in mobile ad hoc networks. Telecommunication Systems, 28, 281–296.
Zotkiewicz, M., & Pioro, M. (2013). Exact approach to reliability of wireless mesh networks with directional antennas. Telecommunication Systems,. doi:10.1007/s11235-013-9829-4.
Desaulniers, G., Desrosiers, J., & Solomon, M. (2005). Column Generation. : Springer-Verlag.
Lasdon, L. S. (1970). Optimization Theory for Large Systems. London: Macmillan.
Montemanni, R., & Leggieri, V. (2010). A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks. Mathematical Methods of Operations Research, 74(3), 327–342.
Gupta, P., & Kumar, P. (2000). The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2), 388–404.
Behzad, A., & Rubin, I. (2003). On the performance of graph-based scheduling algorithms for packet radio networks. In Proceeding of IEEE GLOBECOM. San Francisco, USA.
Huang, X., & Bensaou, B. (2001). On max-min fairness and scheduling in wireless ad-hoc networks: Analytical framework and implementation. In Proceeding of ACM MobiHoc. Long Beach, CA, USA.
Leith, D. J., Cao, Q., & Subramanian, V. G. (2012). Max-min fairness in 802.11 mesh networks. IEEE Transaction on Networking, 20(3), 756–769.
Ahmed, I., Mohammed, A., & Alnuweiri, H. (2013). On the fairness of resource allocation in wireless mesh networks: a survey. Wireless Networks, 19(6), 1451–1468.
Staehle, B., Staehle, D., & Pries, R. (2009). Effects of link rate assignment on the max-min fair throughput of wireless mesh networks. In Proceeding of 21st International Teletraffic Congress, Paris, France.
Cai, D. W. H., Tan, C. W., & Low, S. H. (2012). Optimal max-min fairness rate control in wireless networks: Perron-Frobenius characterization and algorithms. In IEEE INFOCOM. Orlando, FL, USA.
Lin, X., & Shroff, N. B. (2004). Joint rate control and scheduling in multihop wireless networks. InProceeding of IEEE Conference on Decision and Control, Atlantis, Paradise Island, Bahamas.
Avallone, S., DElia, F., & Ventre, G. (2012). A new channel, power and rate assignment algorithm for multi-radio wireless mesh networks. Telecommunication Systems, 51, 73–80.
Passos, D., & Albuquerque, C. V. N. (2012). A Joint Approach to Routing Metrics and Rate Adaptation in Wireless Mesh Networks. IEEE/ACM Transaction on Networking, 20(4), 999–1009.
Ancillotti, E., Bruno, R., & Conti, M. (2008). Experimentation and performance evaluation of rate adaptation algorithms in wireless mesh networks. In Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks. New York, USA.
Xia, D. & Fu, Q. (2011). An experimental study on performance comparison of rate adaptation and fxed rate in ieee 802.11g. In Australasian Telecommunication Networks and Applications Conference. Melbourne, Australia.
Pioro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. : Morgan Kaufman.
Perrin, G., Descombes, X., & Zerubia, J. (2005). Energy minimization methods in computer vision and pattern recognition. Berlin Heidelberg: Springer.
Goldsmith, A. (2005). Wireless Communication. : Cambridge University Press.
Acknowledgments
This work was supported by the EC Marie Curie Actions project MESH-WISE (FP7-PEOPLE-2012-IAPP-324515) and Excellence Center at Linköping-Lund in Information Technology (ELLIIT). The research of Michał Pióro and Yuan Li was also supported by National Science Centre (Poland) under grant 2011/01/B/ST7/02967 and by Chinese Scholarship Council, respectively. The research of Di Yuan has been supported by European FP7 Marie Curie IOF grant 329313.
Author information
Authors and Affiliations
Corresponding author
A Appendix (proof of Proposition 1)
A Appendix (proof of Proposition 1)
Consider an arbitrary optimal solution \(\alpha , \; \zeta _e \; (e \in {\mathcal {E}}), \pi _e \; (e \in {\mathcal {E}}), \; \beta _e^m \; (e \in {\mathcal {E}}, m \in {\mathcal {M}})\) of the dual problem DP(\({\mathcal {N}}\)). Define:
-
\(\hat{\beta }_e = \text{ max } \; \{ \beta _e^m: \; m \in {\mathcal {M}} \}\), \(e \in {\mathcal {E}}\)
-
\(\hat{\beta }^i_e = \beta _e^m\) if \(e \in \mathcal {C}_{i}\) and \(r^m_{ei} = 1\), \(e \in {\mathcal {E}}, i \in \mathcal {I}\) (recall that \(r^m_{ei} = 1\) if MCS \(m\) is used for link \(e\) in compatible set \(\mathcal {C}_{i}\))
-
\(\hat{\beta }^i_e = 0\) if \(e \notin \mathcal {C}_{i}\) (then \(r^m_{ei} = 0\) or all \(m \in {\mathcal {M}}\))
-
\(\alpha = \text{ max } \;\left\{ \sum _{e \in {\mathcal {E}}} \pi _e B_{ei} - \sum _{e\in {\mathcal {E}}} \hat{\beta }_e^i : \; i \in \mathcal {I} \right\} \)
-
\(i_0\) is the index of a compatible set with \(\alpha = \sum _{e \in {\mathcal {E}}} \pi _e B_{ei_0} - \sum _{e \in {\mathcal {E}}} \hat{\beta }_e^{i_0})\)
-
\(\hat{W}\) is the minimum of the dual function (6a).
With these definitions the following holds
so that
Since, by definition \(\hat{\beta }_e \ge \hat{\beta }_e^{i_0}, \; e \in {\mathcal {E}}\), we have
which shows that the minimum of the dual function, \(\hat{W}\), is attained also for the original values of \(\alpha \), \(\pi _e\) (\(e \in {\mathcal {E}}\)) and for \(\beta _{e}^{m}=0\) (\(e \in {\mathcal {E}}, m \in {\mathcal {M}}\)), and hence for \(\zeta _e = 0\) (\(e \in {\mathcal {E}}\)). \(\square \)
Rights and permissions
About this article
Cite this article
Li, Y., Pióro, M., Yuan, D. et al. Optimizing link rate assignment and transmission scheduling in WMN through compatible set generation. Telecommun Syst 61, 325–335 (2016). https://doi.org/10.1007/s11235-015-0004-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-015-0004-y