# Robust and adaptive communication under uncertain interference

### Anand D. Sarwate

###
EECS Department

University of California, Berkeley

Technical Report No. UCB/EECS-2008-86

July 17, 2008

### http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-86.pdf

In the future, wireless communication systems will play an increasingly integral role in society. Cutting-edge application areas such as cognitive radio, ad-hoc networks, and sensor networks are changing the way we think about wireless services. The demand for ubiquitous communication and computing requires flexible communication protocols that can operate in a range of conditions. This thesis adopts and extends a mathematical model for these communication systems that accounts for uncertainty and time variation in link qualities. The arbitrarily varying channel (AVC) is an information theoretic channel model that has a time varying state with no statistical description. We assume the state is chosen by an adversarial jammer, reflecting the demand that our constructions work for all state sequences. In this thesis we show how resources such as secret keys, feedback, and side-information can help communication under this kind of uncertainty. In order to put our results in context we provide a detailed taxonomy of the known results on AVCs in a unified setting. We then prove new results on list decoding with constrained states, a relaxation of the main problem in which the receiver may output a short list of possible messages. In particular, we show constant list sizes can achieve capacity under an average-error criterion and that a list size $L$ can achieve within $O(1/L)$ from the capacity under a maximal-error criterion, complementing the known results for unconstrained state sequences. If the encoder and decoder share a secret key, they can use a randomized code to make their communication more robust. An important practical consideration in using joint randomization for communication schemes is the tradeoff between key size and error probability. Inspired by ad-hoc networks, we propose a new AVC model called the AVC with ``nosy noise,'' in which the jammer can observe the transmitted codeword non-causally. We show that a key size of $O(\log n)$ bits is sufficient to achieve capacity for codes of blocklength $n$ in this model as well as in the case for the standard AVC. If a secure feedback channel is available, the key can be shared via feedback. Limited feedback can also be used to adapt the rate to the actual channel state sequence. We develop an AVC framework for rateless coding and show schemes that achieve rates arbitrarily close to the empirical mutual information. Finally, we address the Gaussian version of the AVC, where we show that a key size of $O(\log n)$ bits is again sufficient to achieve capacity. This result allows us to find an achievable rate region for degraded broadcast channels. In the case where randomized coding is infeasible, we show how a known interference signal at the transmitter can enlarge the capacity region. This result has applications to watermarking and a model for spectrum-sharing communication systems.

**Advisor:** Michael Gastpar

BibTeX citation:

@phdthesis{Sarwate:EECS-2008-86, Author = {Sarwate, Anand D.}, Title = {Robust and adaptive communication under uncertain interference}, School = {EECS Department, University of California, Berkeley}, Year = {2008}, Month = {Jul}, URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-86.html}, Number = {UCB/EECS-2008-86}, Abstract = {In the future, wireless communication systems will play an increasingly integral role in society. Cutting-edge application areas such as cognitive radio, ad-hoc networks, and sensor networks are changing the way we think about wireless services. The demand for ubiquitous communication and computing requires flexible communication protocols that can operate in a range of conditions. This thesis adopts and extends a mathematical model for these communication systems that accounts for uncertainty and time variation in link qualities. The arbitrarily varying channel (AVC) is an information theoretic channel model that has a time varying state with no statistical description. We assume the state is chosen by an adversarial jammer, reflecting the demand that our constructions work for all state sequences. In this thesis we show how resources such as secret keys, feedback, and side-information can help communication under this kind of uncertainty. In order to put our results in context we provide a detailed taxonomy of the known results on AVCs in a unified setting. We then prove new results on list decoding with constrained states, a relaxation of the main problem in which the receiver may output a short list of possible messages. In particular, we show constant list sizes can achieve capacity under an average-error criterion and that a list size $L$ can achieve within $O(1/L)$ from the capacity under a maximal-error criterion, complementing the known results for unconstrained state sequences. If the encoder and decoder share a secret key, they can use a randomized code to make their communication more robust. An important practical consideration in using joint randomization for communication schemes is the tradeoff between key size and error probability. Inspired by ad-hoc networks, we propose a new AVC model called the AVC with ``nosy noise,'' in which the jammer can observe the transmitted codeword non-causally. We show that a key size of $O(\log n)$ bits is sufficient to achieve capacity for codes of blocklength $n$ in this model as well as in the case for the standard AVC. If a secure feedback channel is available, the key can be shared via feedback. Limited feedback can also be used to adapt the rate to the actual channel state sequence. We develop an AVC framework for rateless coding and show schemes that achieve rates arbitrarily close to the empirical mutual information. Finally, we address the Gaussian version of the AVC, where we show that a key size of $O(\log n)$ bits is again sufficient to achieve capacity. This result allows us to find an achievable rate region for degraded broadcast channels. In the case where randomized coding is infeasible, we show how a known interference signal at the transmitter can enlarge the capacity region. This result has applications to watermarking and a model for spectrum-sharing communication systems.} }

EndNote citation:

%0 Thesis %A Sarwate, Anand D. %T Robust and adaptive communication under uncertain interference %I EECS Department, University of California, Berkeley %D 2008 %8 July 17 %@ UCB/EECS-2008-86 %U http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-86.html %F Sarwate:EECS-2008-86