{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

WRCP_EE652 - WIRELESSRATE CONTROLPROTCOL Krishnamachari...

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

View Full Document Right Arrow Icon
    WIRELESS RATE  CONTROL PROTCOL Avinash Sridharan and Bhaskar  Krishnamachari Autonomous Networks Research Group Ming Hsieh Dept. Electrical Engineering, University of Southern California
Background image of page 1

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

View Full Document Right Arrow Icon
    Whats WRCP ? WRCP is a rate control algorithm that operates with  the precise knowledge of the capacity available in a  wireless sensor network.  The result, fast convergence, small queue size,  hopefully small delays
Background image of page 2
    Whats Novel About it? Defining the notion of capacity in wireless  networks is difficult. There are no point to point links just broadcast  domains. Hence we model the graph as node capacitated  graph rather then a link capacitated graph. 
Background image of page 3

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

View Full Document Right Arrow Icon
    Link capacitated vs Node capacitated
Background image of page 4
    How does a linear capacity region help ?
Background image of page 5

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

View Full Document Right Arrow Icon
    How does the capacity region for TinyOS CSMA look ?
Background image of page 6
    What does the boundary of the capacity region mean ?
Background image of page 7

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

View Full Document Right Arrow Icon
    Why should it hold for Multiple senders
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}