Presentation is loading. Please wait.

Presentation is loading. Please wait.

Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science.

Similar presentations


Presentation on theme: "Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science."— Presentation transcript:

1 Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science

2 Objective Reducing energy consumption of battery powered devices, e.g., Laptops and Handhelds, in wireless networks –Wireless communication is power intensive –Node movement can be exploited to reduce energy use in communication

3 Movement Prediction Observation: Reduced distance between communicating peers ⇒ Reduced transmission power requirement ⇒ Energy saving –Assuming network interface has transmission power control capability –Single hop communication – obvious –Multi hop communication – expected

4 Power Saving Strategy If likely to move closer to the target, postpone communication for a future time –Assuming application can tolerate some delay k. Needs movement prediction –Based on movement history –Consumes energy itself

5 Network Structure Mobile nodes are moving within a rectangular plane We divide the network into virtual grids Each grid has a unique grid ID

6 Assumptions Each node knows its own position – GPS Each mobile host maintains a sequence of n previous grid IDs Simplifying assumption –Target is fixed –Every mobile node knows the target’s location Fixed target assumption can be relaxed –Both communicating peers are mobile

7 Notations History of node h: S h = {x 1, x 2, …, x n } A window of size l (for i ≤ n-l+1 ): W(i,i+l-1) = {x i, x i+1, …, x i+l-1 } Distance between two grids i and j : d(i,j)

8 Example Average Distance (AD) Algorithm [TMC 05] Calculate the average distance between a mobile node and the target over all windows of size k in the mobile node's movement history as: If the current distance between the mobile node and the target is greater than avg, then the mobile node decides to postpone the communication, or else it communicates immediately. Less Computational overhead Takes into consideration the actual distance

9 AD Algorithm Example

10 Energy Use in Movement Tracking Continuous movement tracking requires device to be turned on –Idle device can consume significant energy Movement sampling –Device put to sleep between sampling instants –More frequent sampling => higher accuracy –How often and when to sample?

11 System / Communication Energy Tradeoff

12 Communication energy Sleep period System energy Total energy Sleep period Optimal Sleep period

13 Adaptive Wakeup Scheduler If postponement algorithm finds a good position to communicate, then increase sleep time by delta –Can afford to sleep more after successful transmission Else, decrease sleep time by delta –Need to work harder to find a good position for sending

14 Adaptive Wakeup Algorithms Speed based adaptation (SBA) –Faster movement  more frequent updates Delay budget based adaptation (DBA) –Less time until deadline  more frequent updates

15 Adaptive Wakeup Algorithms (Cont’d) Position based adaptation (PoBA) –Position estimated at next wakeup instant, based on nodal speed and direction –Wakeup chosen at ``good’’ position estimate Performance based adaptation (PeBA) –Distance savings compared between current and last updates –Decreased saving  reduced sleep

16 Sensor Implementation Berkeley Mica mote –TR1000 916.5 MHz network interface –256 level power control (radio output voltage proportional to square of input data pin current) –GPS would add 12—24 mW in operation TinyOS –Sleep by snooze component –Power control by pot component

17 Sensor System Architecture

18 Implementation Architecture Positioning System Operating System Services Application Transmission Scheduler Sleep Scheduler Power Manager

19 Transmission scheduler –Implements postponement algorithm Variable length of movement history Variable delay budget (application specific) –Buffers packets until decision to transmit Adaptive wakeup scheduler –Implements adaptive wakeup algorithm for position sampling –Wakes up at sampling instant –Adjusts next sleep period

20 Measurement Setup

21 Constant Power Supply Multimeter Sensor R + ++ - --

22 Energy Estimation by Component Multimeter setup measures total system energy use Energy breakdown by selectively turning off system components / activities –Radio network interface turned on / off –Packet actually sent / not sent (but deleted from transmission queue) –Energy difference between configurations gives estimates of component energy use

23 System Parameters Input parameters –Length of history maintained –Application delay budget –Mobility scenario –Fixed vs adaptive wakeup Output parameters –Energy use and percentage saving (total and component) –Percentage distance saving –Actual postponement delay –Number of wakeups for position sampling

24 Average Speed of Mobility Scenarios Scenariom/sKm/sMiles/s Walker27.24.5 Runner310.86.8 Bicycle72515.6 Vehicle (local) 207245 Vehicle (highway) 3010867.5 Airplane80288180

25 Experimental Scenario

26 Current Drawn (mA) for Fixed Sleeping Strategy ConfigurationWith Prediction No Prediction Send / all on0.6490.893 No send / radio on 0.4580.429 No send / radio off 0.2990.284

27 Current Drawn (mA) by System Component ComponentsWith Prediction No Prediction Packet transmission 0.1910.464 Radio interface (idle) 0.1590.180 Others (CPU, memory) 0.2990.284

28 Postponement Delay

29 Communication Distance

30 Total Energy Percentage

31 Energy Consumption of Sending

32 System Energy Consumption with radio interface off

33 System Performance at Different Fixed Sleep Periods Sleep timeDistanceDelayWakeups 12.080.931.93 22.211.551.77 32.872.561.52 43.241.871.47 54.253.181.23

34 Adaptive vs Fixed Wakeup Performance Sleep timeDistanceWakeupsCurrent (mA) 12.081.930.712 22.211.770.687 32.871.520.666 43.241.470.638 54.251.230.640 Adaptive2.851.490.558

35 Total Energy Consumption

36 Percentage Distance Saving vs Sleep Period and Delay Budget

37 Percentage Energy Saving vs Sleep Period and Delay Budget

38 Percentage Distance Saving (Bicycle)

39 Percentage Energy Saving (Bicycle)

40 Number of Wakeups (Bicycle)

41 Actual Postponement Delay (Bicycle)

42 Percentage Distance Saving vs Mobility Scenario

43 Percentage Energy Saving vs Mobility Scenario

44 Number of System Wakeups vs Mobility Scenario

45 Performance Comparison between Sampling Strategies SchedulerPower (mW) Distance saving WakeupsDelay Baseline18.0485.2%04.83 Fixed 19.6485.2%5.714.83 Fixed 29.6353.3%4.677.34 Fixed 48.8740.7%3.5410.16 Fixed 88.905.1%1.806.40 DBA8.1944.8%3.179.66

46 Conclusions Node movement prediction can reduce the energy cost of wireless network communication However, need to balance against energy cost of movement prediction Adaptive sampling schedule works well based on operating conditions –Simulations + measurements on sensor prototype –Saves substantial energy by putting device to sleep –Outperforms fixed sleep period in general, since optimal sleep period is hard to determine a priori


Download ppt "Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science."

Similar presentations


Ads by Google