Langberg, Michael and Sprintson, Alexander and Bruck, Jehoshua (2004) Optimal Schedules for Asynchronous Transmission of Discrete Packets. California Institute of Technology , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:2004.ETR062
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:2004.ETR062
In this paper we study the distribution of dynamic data over a broadcast channel to a large number of passive clients. Clients obtain the information by accessing the channel and listening for the next available packet. This scenario, referred to as packet-based or discrete broadcast, has many practical applications such as the distribution of weather and traffic updates to wireless mobile devices, reconfiguration and reprogramming of wireless sensors and downloading dynamic task information in battlefield networks. The optimal broadcast protocols require a high degree of synchronization between the server and the wireless clients. However, in typical wireless settings such degree of synchronization is difficult to achieve due to the inaccuracy of internal clocks. Moreover, in some settings, such as military applications, synchronized transmission is not desirable due to jamming. The lack of synchronization leads to large delays and excessive power consumption. Accordingly, in this work we focus on the design of optimal broadcast schedules that are robust to clock inaccuracy. We present universal schedules for delivery of up-to-date information with minimum waiting time in asynchronous settings.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Parallel and Distributed Systems Group|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format|
|Deposited By:||Imported from CaltechPARADISE|
|Deposited On:||15 Nov 2004|
|Last Modified:||26 Dec 2012 13:53|
Repository Staff Only: item control page