Algorithms for Network Coded Gossiping in Urban Areas

Shahriar Etemadi Tajbakhsh (ANU)

APPLIED SIGNAL PROCESSING SERIES

DATE: 2013-10-03
TIME: 10:00:00 - 11:00:00
LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
In this talk, we introduce an architecture for disseminating popular contents to a large group of wireless clients spread over a large (urban) area. This area is partitioned to M cells and there is a base station at each cell which is able to broadcast to the clients within its radio coverage. This architecture is hybrid in nature: each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Afterwards the clients cooperate with each other by exchanging random linear combinations of the blocks they have already received to obtain the remainder of information while they move randomly over this area. We propose delay efficient algorithms and energy efficient algorithms for such a delay tolerant system. The coral part of these algorithms is a local voting system to select transmitting clients at each time. Also we propose delay efficient algorithms for multi-session information dissemination where each client might be interested in an arbitrary subset of information sessions. These algorithms are local scheduling mechanisms to select sessions for transmission and the clients in charge for that.