End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks

Sharing the common spectrum among the links in a vicinity is a fundamental problem in wireless ad-hoc networks. Lately, some scheduling approaches have been proposed that guarantee fair share of bandwidth among the links. The quality of service perceived by the applications however depends on the end-to-end bandwidth allocated to the multihop sessions. We propose an algorithm that provides provably maxmin fair end-to-end bandwidth to sessions. The algorithm combines a link scheduling that avoids collisions, a fair session service discipline per link, and a hop-by-hop window flow control. All the stages of the algorithm are implementable based on local information, except the link scheduling part that needs some network-wide coordination.