Class5-Congestion_Control

Class5-Congestion_Control - Work on Congestion Control in...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
EE/CS 652: Wireless Sensor Networks EE/CS 652: Wireless Sensor Networks Fall 2007 Fall 2007 Bhaskar Krishnamachari Assistant Professor, EE-S, CS University of Southern California Autonomous Networks Research Group http://ceng.usc.edu/~bkrishna/ bkrishna@usc.edu Lecture 5: Congestion Control Lecture 5: Congestion Control October 11, 2007 October 11, 2007
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Why Congestion Control? Very limited bandwidth, small buffer sizes Some applications can generate a lot of non-deterministic data
Background image of page 2
How is it different from the Internet? Link bandwidth depends on interfering traffic from nearby transmissions Losses due to channel error as well as congestion Fairness is a key concern, besides throughput and delay Can exploit traffic pattern (collection trees) Need not stick with a purely end to end mechanism
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Work on Congestion Control in WSN ARC (Woo et al. ) ESRT (Sankarasubramaniam et al. ) CODA (Wan et al. ) FRA (Ee & Bajcsy) Fusion (Hull et al. ) IFRC (Rangwala et al. ) WRCP (Sridharan, unpublished ) Queuing Basics Queues show a basic tradeoff between throughput and delay. Recall the M/M/1 queue E[N] = /(1- ), E[T] = E[N]/ = 1/( - ) Throughput Delay capacity Linear Approximation of Receiver Capacity Rate Optimization using Linear Programming Maximize some linear function of rates Subject to a) Receiver Bandwidth constraints b) Flow conservation constraints c) Fairness constraints Example: Max-Min Fairness Throughput-Fairness Tradeoff Objective function: min-rate + (1- ) [sum-rate / n]...
View Full Document

Page1 / 9

Class5-Congestion_Control - Work on Congestion Control in...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online