Title
Bottleneck-first scheduling for wireless mesh backhaul networks
Abstract
In this paper, resource allocation for Orthogonal Frequency Division Multiple Access (OFDMA)-based Wireless Mesh Networks (WMNs) is investigated. First, the Even-Odd framework is modified to be better suited for different traffic patterns. Second, the scheduling problem in the modified Even-Odd framework is formulated as a Mixed Integer Quadratically Constrainted Programming (MIQCP), and a heuristic solution is derived. The proposed heuristic solution is motivated from the fact that the bottleneck collision domain throttles the capacity of the networks, and the links in the bottleneck collision domain should be allocated resource carefully to maximize the throughput. The numerical results show that the proposed scheduling scheme can achieve throughput which is over 90% of the nominal capacity and the modified Even-Odd framework improve the end-to-end throughput for asymmetric traffic.
Year
DOI
Venue
2009
10.1109/PIMRC.2009.5450290
PIMRC
Keywords
Field
DocType
nominal capacity,wireless mesh backhaul networks,traffic patterns,bottleneck collision domain,orthogonal frequency division multiple access,ofdm modulation,wireless mesh networks,resource allocation,heuristic solution,heuristic programming,resouce allocation,mixed integer quadratically constrainted programming,frequency division multiple access,bottleneck-first scheduling,scheduling problem,constraint handling,modified even-odd framework,constraint programming,resource management,wireless communication,wireless mesh network,interference,throughput,topology
Collision domain,Bottleneck,Job shop scheduling,Computer science,Scheduling (computing),Computer network,Orthogonal frequency-division multiple access,Resource allocation,Wireless mesh network,Throughput,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4244-5123-4
1
0.43
References 
Authors
6
5
Name
Order
Citations
PageRank
Chaojun Xu161.28
Jimin Liu210.43
Feng Han3151.43
Wu Zheng410.43
Shan Jin55310.02