Presentation is loading. Please wait.

Presentation is loading. Please wait.

Idle Communication Power Lei Guo, Xiaoning Ding, Haining Wang, Qun Li, Songqing Chen, and Xiaodong Zhang Exploiting to Improve Wireless Network Performance.

Similar presentations


Presentation on theme: "Idle Communication Power Lei Guo, Xiaoning Ding, Haining Wang, Qun Li, Songqing Chen, and Xiaodong Zhang Exploiting to Improve Wireless Network Performance."— Presentation transcript:

1 Idle Communication Power Lei Guo, Xiaoning Ding, Haining Wang, Qun Li, Songqing Chen, and Xiaodong Zhang Exploiting to Improve Wireless Network Performance and Energy Efficiency

2 Challenges in Wireless System Design Energy saving is not easy –Limited battery capacity in wireless devices –High power consumption in wireless communication High performance costs energy and fairness –Wireless users demand high throughput, but … – A high throughput device needs less sleep. – A channel allocation mechanism can favor some but degrade performance of others. Can we win both instead of addressing the trade-off?

3 Power Consumption for Wireless Communication Energy consumption % A standard way to save energy –Put the WNI into sleep when idle (for a 5 V device) > 50% total energy up to 10% total energy high power mode 450 mA low power mode 15 mA

4 802.11 Power Saving Plan in its Basic Infrastructure Mode Access point –Buffer data for sleeping stations –Broadcast beacon with TIM periodically (100 ms) Sleeping station –Wake up periodically to receive beacon –Poll access point to receive data –Sleep again Access Point Internet Traffic Indication Map (TIM) sleeping station wake up poll receive data

5 Observations of IEEE 802.11 Protocol A client/server model –Each station independently communicates with AP –AP serves a station one at a time via the channel. The saving mode affects TCP traffic –Increasing RTT and decreasing throughput. Performance anomaly (Infocom’03) –Non-uniform transfer rates between different stations to AP due to distance and obstacle condition differences. –A low speed station has low channel utilization rate. Waste energy while a station is waiting for its turn. –Idle communication power due to strong dependency

6 Performance Anomaly in WLAN Multiple channel rates in PHY –Larger coverage –Varying channel conditions Same MAC control for all channel rates –Same opportunity to get channel –Different channel holding time for sending frame Performance anomaly (INFOCOM’03) –All stations have the same flow rate –Unfair to high channel rate stations –Low channel utilization

7 Existing Solutions to address the Limits Reducing idle communication power by –Traffic prediction: bounded slowdown (MOBICOM’02) –Self-tuning with application hints (MOBICOM’03) –Limits: case by case, and accuracy can vary. Address the performance anomaly –Time-based fairness scheduling: a constant time unit is given to each station (USENIX 04) –Limits: poorly conditioned stations suffer: fast is faster, and slow is slower. (energy: 1 bit = CPU 10,000 cycles) Our work: to win both performance and energy subject to fair scheduling.

8 Source of Idle Communication Power While the channel is used by one station, idle communication power is wasted in many other stations AP Wireless performance anomaly makes this power waste worse, but also with an opportunity.

9 Outline Motivation and rationale System model and algorithms System design and implementation Performance evaluation Conclusion

10 Restructure a Wireless Network to P2P model to Enable Multi-hop Relays To help low channel rate stations to Increase throughput and extend network coverage AP X

11 Effectiveness of Relays is from Strong Dependency Slow stations become faster –Completing the data transfer ahead of the unit time. –Equivalent to move the station closer to AP or improve the station’s communication condition. Fast stations serve as proxies for slow stations –Performance improvement of slow stations reduced the waste of idle communication powers of fast stations --- shortening the waiting time. Effective P2P coordination among stations is the key.

12 Incentive and Fairness to Fast Stations Why not sleep or wait, but proxy/relay for others? –Sleep lowers throughput, and wait wastes energy. –Idle communication energy can be used –The saved time in slow stations should be contributed. How do we handle fairness? –A proxy should be given incentive for its service –For either proxy or client, the throughput and energy efficiency should be improved after relays.

13 Rationale Energy efficiency: – effective number of bits delivered per energy unit Self-incentive multi-hop relay –Use channel time to pay the relay service A win-win solution ThroughputEnergy efficiency ProxyIncrease ClientIncrease

14 Outline Motivation and rationale System model and algorithms System design and implementation Performance evaluation Conclusion

15 System Model Time based fairness in the shared radio channel Consequence of multi-hop relays –Proxy: throughput  idle time  energy efficiency  –Client: channel rate  throughput  S1S1 S2S2 …SiSi …SnSn t i =  t = 1/n 1 round idle SqSq Client SpSp Proxy S0S0 AP

16 The Proxy: throughput tidlertritritritritritritritritri trtr SpSp SqSq reward throughput 

17 The Proxy: energy tidlertritritritritritritritritri t trtr reduced idle & receive time x Ptx Pt P t > P r (power consumption gap) t x P r = No energy loss

18 The Client Throughput gain Energy utility gain tt x 0,p xp,qxp,q ypqypq xp,qxp,q ypqypq tt tt SpSp SqSq SqSq Client SpSp Proxy S0S0 AP xp,qxp,q tt x Rp,qx Rp,q x R 0,q > If

19 Outline Motivation and rationale System model and algorithms System design and implementation Performance evaluation Conclusion

20 Channel Scheduling Traditional WLAN equal chance to occupy channel Low rate STA High rate STA b4b t 4t Overall bandwidth: 1.6b

21 Channel Scheduling Traditional WLAN Dominant Low Rate Transmission Bandwidth Inefficient Energy Inefficient Lengthened Active Time equal chance to occupy channel Low rate STA High rate STA

22 Channel Scheduling TBF(Time Based Fairness) WLAN equal transmission time Low rate STA High rate STA Overall bandwidth: 2.0b b4b

23 Channel Scheduling TBF(Time Based Fairness) WLAN Low-rate transmission still occupies a large percentage of channel time At the cost of the throughput and energy consumption of the low rate STA equal transmission time Low rate STA High rate STA

24 Token-based Channel Scheduling A token is a ticket for a data transfer (RX/TX) in one time unit AP initially distributes an equal amount of tokens to each station (fairness). A pair of RX & TX consumes one token. A token bucket is used in channel scheduling. Multi-hop relays are operated under token exchanges. The token mechanism provides incentive to fast stations: receive more time units than relays needed.

25 packets A Token Bucket Associated with Each Station tokens from AP Overflow! Re-allocate to other stations by AP Token Bucket Packet Queue Transmitter 1 token per packet

26 Channel Scheduling tokens from AP Overall bandwidth: 2.8b

27 Maintaining a Routing Table in AP AP S1S1 STAProxyRoute S1S1 ---R(0,1) S2S2 ---R(0,2) S3S3 S2S2 R(0,3) S4S4 S2S2 R(0,4) S2S2 S3S3 S4S4 HopStationRoute 1SelfR(0,2) 2S3S3 R(2,3) S4S4 R(2,4) HopStationRoute 1S2S2 R(0,2) 2SelfR(2,3)

28 Put Them Together: Selfish Forwarding - SFW Proxy discovery and selection –A poorly conditioned client broadcasts a relay request –One or more stations bet to relay with a price (tokens). AP assigns a relaying station for clients based on the second price auction in game theory. Channel scheduling – AP distributes tokens without any enforcement. –The relaying actions are determined by token exchanges among stations. Multi-hop routing is done by a routing table in AP

29 SFW System Implementation Access Point –NetGear MA311 802.11b PCI wireless adaptor –HostAP linux driver version 0.1.3 Wireless Stations –NetGear MA401 802.11b PCMCIA wireless adaptor –ORiNOCO linux driver version 0.15rc2

30 Outline Motivation and rationale System model and algorithms System design and implementation Performance evaluation Conclusion

31 Protocols Compared in Experiments DCF –Most widely used protocol in 802.11b network –Distributed Coordination Function TBF –Time-based Fairness (USENIX 2004) SFW –Selfish Forwarding (our own)

32 Single Client Experiment AP 11Mbps 1Mbps slow link!

33 Channel allocation scheme Performance Evaluation 1 proxy (P), 1 client (Q) energy efficiency (Mb/J) throughput (Mbps) 16% 170% 266%

34 Multi-clients Experiment AP 11Mbps 1Mbps

35 Performance Evaluation Proxy throughput gain 1 proxy, multiple clients

36 Conclusion Exclusive communications between AP and stations create idle communication power. Wireless performance anomaly is an opportunity. P2P based Selfish Forwarding Protocol –Improve performance and energy efficiency for everyone –Make the channel sharing and scheduling more fair. It is easy to implement for practical usage.

37 Thank you!


Download ppt "Idle Communication Power Lei Guo, Xiaoning Ding, Haining Wang, Qun Li, Songqing Chen, and Xiaodong Zhang Exploiting to Improve Wireless Network Performance."

Similar presentations


Ads by Google