{"title":"Utility-Based Scheduling with Non-Deterministic Fading Channels in Wireless Multi-Hop Networks","authors":"Zheng Liu, M. Ma, J. Dai","doi":"10.1109/GLOCOM.2009.5425866","DOIUrl":null,"url":null,"abstract":"In this paper, an innovative scheduling scheme is proposed for interference-limited wireless multi-hop networks with non-deterministic fading channels. The scheduling problem is considered as a network utility maximization(NUM) problem subject to link rate constraints. With jointly considering link scheduling and the statistical variations of both signal and interference power, the convex sets for NUM are built. The subgradient projection method based on dual decomposition is employed to solve the convex optimization problem. Then a practical algorithm is designed for the TDM mode wireless multihop networks with minimizing the discrepancy between the expected network cost and the optimal value in each timeslot. The numerical results demonstrate the convergence and the improvement over network utility made by our proposed scheme.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"19 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2009.5425866","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, an innovative scheduling scheme is proposed for interference-limited wireless multi-hop networks with non-deterministic fading channels. The scheduling problem is considered as a network utility maximization(NUM) problem subject to link rate constraints. With jointly considering link scheduling and the statistical variations of both signal and interference power, the convex sets for NUM are built. The subgradient projection method based on dual decomposition is employed to solve the convex optimization problem. Then a practical algorithm is designed for the TDM mode wireless multihop networks with minimizing the discrepancy between the expected network cost and the optimal value in each timeslot. The numerical results demonstrate the convergence and the improvement over network utility made by our proposed scheme.