|Title:||Fair Algorithms for Maximal Link Activation in Multi-Hop Radio Networks
|Authors:||I. Chalamtac and A. Lerner
|Abstract:||We present a distributed algorithm for obtaining a fair timeslot allocation for link activation in multi-hop radio network. We introduce the concept of maxiroal fairness in which the terrmnation of a fair allocation algorithm is related to maximal reuse of the channel under a given fairness metric. The fairness metric can be freely interpreted as the expected link traffic load demands, link priorities, etc. Since respective demands for timeslot allocation will not necessarily be equal. we define fairness in terms of the closeness of allocation to respective link demands, while preserving the collision free ptoperty. The algorithm can be used in conjunction with existing link activation algorithms to provide a fairer and fuller utilization of the channel.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1986/CS/CS0397), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1986
To the main CS technical reports page
Computer science department, Technion