Departmental Papers (ESE)

Abstract

We address the problem of attaining proportionally fair rates using Aloha protocols at the medium access layer. We consider a wireless network where all nodes need not be in transmission ranges of each other. We show how the attempt probabilities in Aloha protocols should be set so that the achieved rates are globally proportionally fair. For both slotted and unslotted Aloha,we argue that each node can compute its optimal attempt probability just by knowing some minimal information about the network topology in its two-hop radius.

Document Type

Journal Article

Date of this Version

October 2004

Comments

Copyright 2004 IEEE. Reprinted from IEEE Transactions on Automatic Control, Volume 49, Issue 10, October 2004, pages 1858-1862.
Publisher URL: http://ieeexplore.ieee.org/xpl/tocresult.jsp?isNumber=29559&page=2

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Keywords

Aloha networks, fairness, local information

Share

COinS
 

Date Posted: 20 February 2005

This document has been peer reviewed.