BodyQoS: Adaptive and Radio-Agnostic QoS for Body Sensor Networks PowerPoint PPT Presentation

presentation player overlay
About This Presentation
Transcript and Presenter's Notes

Title: BodyQoS: Adaptive and Radio-Agnostic QoS for Body Sensor Networks


1
BodyQoS Adaptive and Radio-Agnostic QoS for Body
Sensor Networks
  • Gang Zhou
  • College of William and Mary
  • Jian Lu
  • University of Virginia
  • Chieh-Yih Wan, Mark D. Yarvis
  • Intel Research
  • John A. Stankovic
  • University of Virginia

IEEE INFOCOM 2008
2
Hurricane Katrina Relief
3
911 Terrorist Attack
4
Health Monitoring During Emergency
  • Manual tracking of patient status, based on
    papers and phones, is the past
  • Real-time continuous monitoring, through body
    sensor networks, is the future

5
A Typical Body Sensor Network
Limb motion muscle activity
Heart rate blood oxygen saturation
Two-Lead EKG
6
Quality of Service for Body Sensor Networks
  • BodyQoS Goals
  • Priority-based admission control
  • Wireless resource scheduling
  • Providing effective bandwidth
  • Design Constraints
  • Heterogeneous resources
  • Heterogeneous radio platforms

Data
Control
7
BodyQoS Contributios
  • The first Running QoS System for Body Sensor
    Networks
  • Asymmetric Architecture
  • Most work for the aggregator
  • Little work for sensor nodes
  • Virtual MAC
  • Separate QoS scheduling from underlying real MAC
  • Easy to port to different radio platforms
  • Effective BW Allocation
  • Adaptive resource scheduling, so that
    statistically the delivered BW meets QoS
    requirements, even during interference

8
Asymmetric Architecture
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation


BodyQoS



9
Wireless Resource Abstraction
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

Tinterval Npkt Spkt TPkt TmaxPkt TminSleep
10
Wireless Resource Abstraction
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

Npkt Spkt TPkt TmaxPkt TminSleep
The length of each interval The length of each interval The length of each interval The length of each interval The length of each interval The length of each interval
Tinterval
11
Wireless Resource Abstraction
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

Tinterval Npkt Spkt TPkt TmaxPkt TminSleep
The maximum number of packets QoS Scheduler can send/receive within each interval, if there is no interference The maximum number of packets QoS Scheduler can send/receive within each interval, if there is no interference The maximum number of packets QoS Scheduler can send/receive within each interval, if there is no interference The maximum number of packets QoS Scheduler can send/receive within each interval, if there is no interference The maximum number of packets QoS Scheduler can send/receive within each interval, if there is no interference The maximum number of packets QoS Scheduler can send/receive within each interval, if there is no interference
Npkt
12
Wireless Resource Abstraction
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

Tinterval Npkt Spkt TPkt TmaxPkt TminSleep
The effective data payload size in each packet that can carry application data The effective data payload size in each packet that can carry application data The effective data payload size in each packet that can carry application data The effective data payload size in each packet that can carry application data The effective data payload size in each packet that can carry application data The effective data payload size in each packet that can carry application data
Spkt
13
Wireless Resource Abstraction
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

Tinterval Npkt Spkt TPkt TmaxPkt TminSleep
The minimum time needed to send out a packet, if there is no interference The minimum time needed to send out a packet, if there is no interference The minimum time needed to send out a packet, if there is no interference The minimum time needed to send out a packet, if there is no interference The minimum time needed to send out a packet, if there is no interference The minimum time needed to send out a packet, if there is no interference
Tpkt
14
Wireless Resource Abstraction
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

Tinterval Npkt Spkt TPkt TmaxPkt TminSleep
The maximum time needed to send out a packet or finally report giving up, if it suffers maximum backoffs/retransmissions The maximum time needed to send out a packet or finally report giving up, if it suffers maximum backoffs/retransmissions The maximum time needed to send out a packet or finally report giving up, if it suffers maximum backoffs/retransmissions The maximum time needed to send out a packet or finally report giving up, if it suffers maximum backoffs/retransmissions The maximum time needed to send out a packet or finally report giving up, if it suffers maximum backoffs/retransmissions The maximum time needed to send out a packet or finally report giving up, if it suffers maximum backoffs/retransmissions
TmaxPkt
15
Wireless Resource Abstraction
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

Tinterval Npkt Spkt TPkt TmaxPkt TminSleep
The minimum time for putting radio to sleep, which includes the sleeping/activation switch time and also considers the energy cost The minimum time for putting radio to sleep, which includes the sleeping/activation switch time and also considers the energy cost The minimum time for putting radio to sleep, which includes the sleeping/activation switch time and also considers the energy cost The minimum time for putting radio to sleep, which includes the sleeping/activation switch time and also considers the energy cost The minimum time for putting radio to sleep, which includes the sleeping/activation switch time and also considers the energy cost The minimum time for putting radio to sleep, which includes the sleeping/activation switch time and also considers the energy cost
TminSleep
16
Virtual MAC Operation
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

BWeffective
Delivered Bytes / Actual Time
17
Effective BW Allocation
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

The ideal case no Interference
The general case when interference is present
If application requests BW bi, BodyQoS allocates
BW bi
That is, in each interval Tinterval, QoS
scheduler requests VMAC to send/receive Di
packets within time TiDiTpkt
Minimum per packet transmission time
Interval length
Packet size
18
Effective BW Allocation
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

The general case when interference is present
Max. MAC Retrans. Time
H
H
Interference
Interference
19
Performance Evaluation Setup
20
Performance
  1. Adaptive QoS always delivers requested BW
  2. Delivered BWs for RTP-Like QoS and best-effort
    reduce when interference increase
  3. RTP-like QoS has better performance than
    best-effort

21
Conclusions
  • We designed, implemented, and evaluated the first
    Running QoS System for Body Sensor Networks
  • Asymmetric Architecture
  • Most work for the aggregator
  • Little work for sensor nodes
  • Virtual MAC
  • Separate QoS scheduling from underlying real MAC
  • Easy to port to different radio platforms
  • Effective BW Allocation
  • Adaptive resource scheduling, so that
    statistically the delivered BW meets QoS
    requirements, even during interference
  • For more information, visit www.cs.wm.edu/gzhou

22
The End
23
Effective BW Allocation
  1. Asymmetric Architecture
  2. Virtual MAC
  3. Effective BW Allocation

The general case when interference is present
Max. MAC Retrans. Time
H
H
Interference
Interference
24
Implementation
Easy to Port to Different Radio Platforms
Only need to modify VMAC
VMAC lt100 lines of code
BodyQoS 3700 lines of code
Most Work Done at the Aggregator
25
Evaluation -- Bandwidth Delivery Ratio
  1. Adaptive QoS always delivers requested BW
  2. Delivered BWs for RTP-Like QoS and best-effort
    reduce when interference increase
  3. RTP-like QoS has better performance than
    best-effort

Aggregator Side
26
Evaluation -- Data Buffer Fetching Speed
  1. Adaptive QoS always maintains 4Kbps fetching
    speed
  2. Fetching speeds of RTP-Like QoS and best-effort
    reduce when interference is present
  3. Fetching speed of RTP-like QoS is higher than
    that of best-effort

Mote Side
Write a Comment
User Comments (0)
About PowerShow.com