Please use this identifier to cite or link to this item:
Title: Utility-based scheduling in wireless multi-hop networks over non-deterministic fading channels
Authors: Liu, Zheng
Ma, Maode
Dai, Jufeng
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2012
Source: Liu, Z., Ma, M.,& Dai, J. (2012). Utility-based scheduling in wireless multi-hop networks over non-deterministic fading channels. Computer Networks, 56(9), 2304-2315.
Series/Report no.: Computer networks
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. By jointly taking into account of the link scheduling and the statistical variations of signal and interference power, the convex sets for the NUM are derived. Two types of non-deterministic fading channels (i.e., Rayleigh fading channel and Ricean fading channel) are characterized into our NUM models as examples. To solve the convex optimization problem, the subgradient projection method based on dual decomposition is employed. Then, a heuristic algorithm is designed for the TDM mode wireless multi-hop networks by minimizing the discrepancy between the expected network cost and the optimal one in each timeslot. At last, the source–destination session rate and network utility are evaluated in a dedicated wireless multi-hop network scenario. The numerical results demonstrate that the session rates convergence and the network utility is improved by our proposed scheme.
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2012.03.020
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Citations 20

Updated on Mar 6, 2021

Citations 20

Updated on Mar 8, 2021

Page view(s) 10

Updated on Jul 2, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.