General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice...
-
Upload
clifford-parsons -
Category
Documents
-
view
220 -
download
0
description
Transcript of General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice...
![Page 1: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/1.jpg)
General Theory of Wireless Networks with Side Information
Ahmad Khoshnevis, Debashis DashRice University
Nokia SeminarFebruary 10, 2006
![Page 2: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/2.jpg)
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?
![Page 3: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/3.jpg)
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
q2
q1 S1
S2
q3
S3
![Page 4: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/4.jpg)
How Much Overhead?
Second Question: What is the minimum amount of overhead? How can it be reduced?
![Page 5: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/5.jpg)
Observation
• If S1 knows q2 and S2 knows q1
– No need for handshaking
– TDMA scheduling– No collision
• As load increases– Probability of queue empty reduces– Network utility increases
Having the “side information” aboutQueue states, increases the utilization
1
2q2
q1 S1
S2
D
![Page 6: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/6.jpg)
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=
q1 S11
2q2
S2
D
t
S2
S1
t1t2
c
![Page 7: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/7.jpg)
Performance
![Page 8: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/8.jpg)
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
![Page 9: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/9.jpg)
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?
![Page 10: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/10.jpg)
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
S S’X
S.Enc
C.E
nc
New Source Model
![Page 11: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/11.jpg)
Channel Model
• Discrete memoryless channel
• The channel is described by P{Y|X1,X2}
![Page 12: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/12.jpg)
Formulating the Problem
![Page 13: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/13.jpg)
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
![Page 14: General Theory of Wireless Networks with Side Information Ahmad Khoshnevis, Debashis Dash Rice University Nokia Seminar February 10, 2006.](https://reader036.fdocuments.in/reader036/viewer/2022062311/5a4d1b017f8b9ab059986992/html5/thumbnails/14.jpg)
Road Map
• Improving the Model– More interesting case is conferencing
• Find I(M1,M2;Y|S’1,S’2)• Properties of solution space and possible solution for special
cases