Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications...
-
date post
20-Dec-2015 -
Category
Documents
-
view
216 -
download
0
Transcript of Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications...
![Page 1: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/1.jpg)
Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks
IEEE Communications Society 2004
Chi Ma, Ming Ma and Yuanyuan Yang
![Page 2: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/2.jpg)
Outline Introduction Data-Centric Energy Efficient Scheduling
Communication-Centric Initialization Phase Characteristics of the traffic in sensor networks Data-centric scheduling phase
Power Shutdown Scheme Performance Comparisons with Existing
Protocol Conclusion
![Page 3: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/3.jpg)
Introduction Previous work:
Predictive power management strategy Only highly correlated requests can benefit from
it Markov Chain method based on historic data
analysis [7] point out that this is not suitable for today’s
low energy and low computation sensor Power mode scheduling
Does not distinguish between the routing data and the sensing data
![Page 4: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/4.jpg)
Introduction
All previous work assume that both sensing and routing packets come as homogeneous traffic
They propose DCe2S (Data-centric energy efficient scheduling) to minimizing the power dissipated under heterogeneous packet traffic
![Page 5: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/5.jpg)
Data-Centric Energy Efficient Scheduling
DCe2S protocol consists of two phases: 1. Communication-centric initialization
phase 2. Data-centric scheduling phase
![Page 6: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/6.jpg)
Communication-Centric Initialization Phase
Determine node’s lengths of sleep according to sensor density (not uniform)
IAR Energy dissipation Probability to lose packet Higher density (after CCI)
![Page 7: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/7.jpg)
Communication-Centric Initialization Phase
:the probability the packet is not lose of node p
:numbers of neighbor of node k Given , if any routing node i of sending
node p has that ,then the can be guaranteed at sending node p
P
IARp
IARp
IARp IARp
IARp
![Page 8: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/8.jpg)
![Page 9: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/9.jpg)
Characteristics of the traffic in sensor networks
There are two types of data: Sensing packets Routing packets
Previously proposed protocols assume that both types of traffic follow are homogeneous Poisson distribution
Apparently, it cannot model real traffic (ex. traffic monitoring)
Even the sensing traffic is homogeneous, the routing traffic cannot not be homogeneous
![Page 10: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/10.jpg)
Characteristics of the traffic in sensor networks
Path length
Sensing traffic
![Page 11: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/11.jpg)
Characteristics of the traffic in sensor networks There are k path Traffic out of Di : t : latency for each node Consider traffic from A
Consider traffic from both A and C
![Page 12: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/12.jpg)
Characteristics of the traffic in sensor networks
When sensing traffic is heterogeneous Poisson traffic
Suppose A has sensing rate of
When ,the case is equivalent to A broadcasts packets at homogeneous rate , and A` broadcasts after t1
And is the same
![Page 13: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/13.jpg)
Data-Centric Scheduling Algorithm
Use exponentially weighted average time to combine and to obtain
is a threshold means a sudden change A sliding window with size W is used to
cache the recent packet arrival intervals
![Page 14: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/14.jpg)
//exponentially weighted
//average of the window
![Page 15: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/15.jpg)
Power Shutdown Scheme
DCS algorithm uses the shut-down scheme in [8]
The shut-down latency for turning on/off : Sensing unit 30ms Transmitter 5ms Receiver 5ms
![Page 16: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/16.jpg)
Power Shutdown Scheme
![Page 17: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/17.jpg)
Power Shutdown Scheme
Derive a set of sleep time threshold{Tth,k}
if ti<Tth,k will result net energy loss
next event
![Page 18: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/18.jpg)
Performance Comparisons with Existing Protocol
The Time Out Protocol Node switches to sleeping blindly for a
time period of Tout
The Greedy Protocol Without any power control protocol
The Power Mode Scheduling Protocol (PMS)
![Page 19: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/19.jpg)
Power dissipation (homogeneous)
100ms500ms
![Page 20: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/20.jpg)
Packet Loss Rate (homogeneous)
61.4% better than Greedy
31% better than PMS
Unstable because of predict
![Page 21: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/21.jpg)
Heterogeneous traffic 1000 packets First phase: 200 packets Second phase: 400 packets Third phase: 400 packets Packet Lost Rate
![Page 22: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/22.jpg)
Power dissipation (heterogeneous)
![Page 23: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/23.jpg)
Packet Loss Rate (heterogeneous)
Events are not uniformly distributed
![Page 24: Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d415503460f94a1c24a/html5/thumbnails/24.jpg)
Conclusions
They first prove the routing traffic is heterogeneous with Poisson sensing traffic
Then proposed a well defined power model to extend the lifetime without compromising their performance
Presented DCe2S in this paper and try to achieve maximum lifetime