By Topic

A Distributed Scheduling Algorithm for End-to-End Flow Fairness in Wireless Multi-hop Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiaowei Qin ; USTC, Hefei ; Peixia Xu

A distributed scheduling algorithm is proposed for achieving end-to-end flow max-min fairness in wireless multi-hop networks. The problem is modeled as an optimization problem by taking into account the MAC-layer constraints. With dual programming and Lagrange relaxation, the problem is decomposed into two subproblems, one is for transport layer at the source node, and the other for MAC layer in the network. A max-price based max-min fair rate allocation algorithm is adopted for the transport layer subproblem and an algorithm based on integer programming is designed for scheduling link activities at MAC layer. Simulation results show that the proposed algorithm can achieve conflict-free schedule for wireless links and provide max-min fairness for end-to-end flows efficiently.

Published in:

Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)

Date of Conference:

3-6 Dec. 2007