Departmental Papers (CIS)

Date of this Version

March 2006

Document Type

Journal Article

Comments

Copyright 2006 IEEE. Reprinted from 40th Annual Conference on Information Sciences and Systems, March 2006, 6 pages.

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.

Abstract

We consider a wireless system with multiple channels when each channel has several different transmission states. Different states are associated with different probabilities of successful transmissions. In such networks, we are faced with making transmission decisions in the presence of partial information about channel states. This (typically probabilistic) information about any channel can be refined by sending control packets in the channels. In presence of multiple alternative channels, this process of probing every channel to find the best one is onerous and resource consuming. There is a natural tradeoff between the resource consumed in probing and the estimate of channel state we can obtain. The desired tradeoff can be attained by judiciously determining which and how many channels to probe and also which channel to transmit. We present adaptive algorithms for provably approximating the desired tradeoffs within constant factors.

Share

COinS
 

Date Posted: 18 June 2008