Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks

— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed coordination method for schedule construction and modification for any wireless ad-hoc network operating under a schedule where transmissions at each slot are explicitly specified over a time period of length T. We first introduce a fluid model of the system where the conflict avoidance requirements of neighboring links are relaxed while the aspect of local channel sharing is captured. In this model we propose an algorithm where the nodes asynchronously re-adjust the rates allocated to their adjacent links using only local information. We prove that, from any initial condition, the algorithm finds the max-min fair rate allocation in the fluid model. Hence, if the iteration is performed constantly the rate allocation will track the optimal even in regim...

• Type: Conference
• Year: 2004
• Where: IWQOS
• Authors: Theodoros Salonidis, Leandros Tassiulas
• Keywords: Fair Rate Allocation, IWQOS 2004, Max-min Fair Rate, Rate Allocation