1. General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006

2. Wireless Networks High data rate –WiMax, Mesh –802.11x –4G Irony –Current protocols such as 802.11 cause 30-50% non-data communication (overhead) First question: Is existence of protocols necessary?

3. Why Protocols? Queues have time-varying state –Might be empty sometimes In effect, # of active nodes is time varying Design for Max # of user is conservative –Underutilized network for many traffic “Active” management of queue states = Medium Access Protocols q2q2 q1q1 S1S1 S2S2 q3q3 S3S3

4. How Much Overhead? Second Question: What is the minimum amount of overhead? How can it be reduced?

5. Observation If S 1 knows q 2 and S 2 knows q 1 –No need for handshaking –TDMA scheduling –No collision As load increases –Probability of queue empty reduces –Network utility increases Having the “side information” about Queue states, increases the utilization 1 2 q2q2 q1q1 S1S1 S2S2 D

6. Implementation of the idea Perfect carrier sense  no collision While q1 and q2 non empty –TDMA guarantees no collision When –q1 and q2 are empty –|t1-t2| <  –Collision happens Collision resolution takes resources –Modeled as wasted time,  c Probability of Collision is determined by probability of q1=q2=  q1q1 S1S1 1 2 q2q2 S2S2 D t S2S2 S1S1 t1t1 t2t2 cc

7. Performance

8. Generalization In general “side information” –Queue state –Number of nodes –Battery life, … Catch The “side information” is not of interest, data is Gathering “side information” requires resources –Perfect information causes a lot of overhead –Partial information gives more room for data, but more uncertainty

9. Fundamental Tradeoff There is a tradeoff between amount of side information and total throughput of a network. What is the maximum data rate for a given amount of side information?

10. New Source Model There are two information need to be transmitted –The actual data, M –The source state, S The message –Conveys useful information –Need to be sent error free The source state –Can’t be sent perfectly (takes all the capacity) –The rate of source information is controlled by distortion between S and S’ M SS’ X S.Enc C.Enc New Source Model

11. Channel Model Discrete memoryless channel The channel is described by P{Y|X 1,X 2 }

12. Formulating the Problem

13. Additional Insights Particularly in our approach –Generalization of side information & being independent of interpretation –Addressing penalty associated with knowing side information Considered in earlier models –Is extendable to a network with arbitrary number of users –Simultaneously can answer both question Total network throughput Per user throughput

14. Road Map Improving the Model –More interesting case is conferencing Find I(M 1,M 2 ;Y|S’ 1,S’ 2 ) Properties of solution space and possible solution for special cases