Title
Distributed Scheduling in Multihop Wireless Networks with Maxmin Fairness Provisioning.
Abstract
Fair allocation of resources is an important consideration in the design of wireless networks. In this paper, we consider the setting of multihop wireless networks with multiple routing paths and develop an online flow control and scheduling algorithm for packet admission and link activation that achieves high aggregate throughput while providing different data flows with a fair share of network capacity. For fairness provisioning, we seek to maximize the minimum throughput provided to flows in the network. To cope with different degrees of data reliability among the different links in the network, we use different channel code rates as appropriate. While we expect performance improvement using channel coding and multipath routing, the main contribution of our work is a joint treatment of network stability, multipath routing and link-level reliability in meeting the overarching goal of maxmin fairness. We develop a decentralized, and hence practical, scheduling policy that addresses various concerns and demonstrate, via simulations, that it is competitive with respect to an optimal centralized rate allocator. We also evaluate the fairness provisioning under the proposed algorithm and show that channel coding improves the performance of the network significantly. Finally, we show through simulations that the proposed algorithm outperforms a class of existing approaches on fairness provisioning, which are developed based on utility maximization.
Year
DOI
Venue
2012
10.1109/TWC.2012.030812.110493
IEEE Transactions on Wireless Communications
Keywords
Field
DocType
channel coding,distributed algorithms,minimax techniques,multipath channels,radio networks,resource allocation,scheduling,telecommunication network reliability,telecommunication network routing,channel code rates,data reliability,distributed scheduling algorithm,link activation,link-level reliability,maxmin fairness provisioning evaluation,multihop wireless networks design,multiple routing paths,network capacity,network stability,online flow control,optimal centralized rate allocator,packet admission,resource fair allocation,scheduling policy,utility maximization,Lyapunov stability theory,Scheduling,channel coding,decentralized resource allocation,fairness,multipath routing
Wireless network,Max-min fairness,Multipath routing,Scheduling (computing),Computer network,Real-time computing,Maximum throughput scheduling,Fairness measure,Throughput,Mathematics,Fair queuing
Journal
Volume
Issue
ISSN
11
5
1536-1276
Citations 
PageRank 
References 
7
0.53
19
Authors
3
Name
Order
Citations
PageRank
Keivan Ronasi1323.79
Vincent W. S. Wong21696124.91
Sathish Gopalakrishnan342633.10