Scheduling Algorithms and Bounds for Rateless Data Dissemination in Dense Wireless Networks

Many applications in wireless cellular networks rely on the ability of the network to reliably and efficiently disseminate data to a large client audience. The stochastic nature of packet loss across receivers and channel interference constraints between cells complicate this task, however. In this paper, the authors analyze the problem of minimizing the delay of data dissemination in dense multi-channel wireless cellular networks, using rateless coding transmission. They begin with an extreme value analysis of the delay in a single cell setting, and show that the growth rate of this random variable becomes deterministic as the client audience scales up. Next, they extend the analysis to multi-cell, multi-channel settings and derive tight performance bounds on the delay.

Provided by: Boston University Topic: Mobility Date Added: Feb 2012 Format: PDF

Find By Topic