For more information about this meeting, contact Manfred Denker.
|Title:||Stochastic models for random-access wireless networks|
|Seminar:||Seminar on Probability and its Application|
|Speaker:||Peter van de Ven, IBM T.J. Watson Research Lab|
|Random-access algorithms such as the Carrier-Sense Multiple-Access (CSMA) protocol provide a popular mechanism for distributed medium access control in large-scale wireless networks. We study the performance of these networks using a model closely related to stochastic loss networks and to the hard-core model.
Random-access networks may exhibit severe unfairness in throughput, in the sense that some nodes receive consistently higher throughput than others. We study the unfairness in saturated networks, and adapt the random-access CSMA protocol to remove the unfairness completely. These models primarily pertain to a saturated scenario where nodes always have packets to transmit. In reality however, the buffers may occasionally be empty as packets are randomly generated and transmitted over time. The resulting interplay between the activity states and the buffer contents gives rise to quite complicated queueing dynamics, and even stablishing the stability criteria is usually a serious challenge. We explicitly identify the stability conditions in a few relevant scenarios, and illustrate the difficulties arising in other cases.|
Room Reservation Information
|Date:||02 / 24 / 2012|
|Time:||02:20pm - 03:20pm|