Utility Bounds of Joint Congestion and Medium Access Control for CSMA based Wireless Networks

• Tao Wang,
• Zheng Yao,
• Baoxian Zhang,
• Cheng Li,

Vol. 11, No. 1, January 29, 2017
10.3837/tiis.2017.01.010, Download Paper (Free):

• Network utility maximization
• link scheduling
• weighted network capacity
• joint optimization
• multi-path routing

Abstract

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

Statistics

Cite this article