Allocating data for broadcasting over wireless channels subject to transmission errors

Broadcasting is an efficient and scalable way of transmitting data over wireless channels to an unlimited number of clients. In this paper the problem of allocating data to multiple channels is studied, assuming flat data scheduling per channel and the presence of unrecoverable channel transmission errors. The objective is that of minimizing the average expected delay experienced by the clients. Two different channel error models are considered: the Bernoulli model and the simplified Gilbert–Elliot one. In the former model, each packet transmission has the same probability to fail and each transmission error is independent from the others. In the latter one, bursts of erroneous or error-free packet transmissions due to wireless fading channels are modeled. Particular cases are detected where optimal solutions can be found in polynomial time. For general cases, simulations show that good sub-optimal solutions can be found on benchmarks whose item popularities follow Zipf distributions.

[1]  William Turin,et al.  Performance Analysis of Digital Transmission Systems , 1990 .

[2]  Mostafa H. Ammar.  Response Time in a Teletext System: An Individual User's Perspective , 1987, IEEE Trans. Commun..

[3]  Claire Mathieu,et al.  The Data Broadcast Problem with Non-Uniform Transmission Times , 1999, SODA '99.

[4]  Arbee L. P. Chen,et al.  Optimal index and data allocation in multiple broadcast channels , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[5]  Wai Gen Yee.  Efficient Data Allocation For Broadcast Disk Arrays , 2002 .

[6]  Tomasz Imielinski,et al.  Energy efficient indexing on air , 1994, SIGMOD '94.

[7]  Alan A. Bertossi,et al.  Efficient heuristics for data broadcasting on multiple channels , 2008, Wirel. Networks.

[8]  Kien A. Hua,et al.  Multi-level multi-channel air cache designs for broadcasting in a mobile environment , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[9]  Jakub Marecek,et al.  Handbook of Approximation Algorithms and Metaheuristics , 2010, Comput. J..

[10]  Rafael Alonso,et al.  Broadcast Disks: Data Management for Asymmetric Communication Environments , 1994, Mobidata.

[11]  Shamkant B. Navathe,et al.  Efficient Data Allocation over Multiple Channels at Broadcast Servers , 2002, IEEE Trans. Computers.

[12]  Mostafa H. Ammar,et al.  The Design of Teletext Broadcast Cycles , 1985, Perform. Evaluation.

[13]  Andreas Willig,et al.  Redundancy concepts to increase transmission reliability in wireless industrial LANs , 2005, IEEE Transactions on Industrial Informatics.

[14]  Nitin H. Vaidya,et al.  Log-time algorithms for scheduling single and multiple channel data broadcast , 1997, MobiCom '97.

[15]  Ming-Syan Chen,et al.  Efficient Channel Allocation Tree Generation for Data Broadcasting in a Mobile Computing Environment , 2003, Wirel. Networks.

[16]  Alan A. Bertossi,et al.  Optimal skewed data allocation on multiple channels with flat broadcast per channel , 2005, IEEE Transactions on Computers.

[17]  Randeep Bhatia,et al.  Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.

[18]  Polychronis Koutsakis.  Scheduling and call admission control for burst-error wireless channels , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[19]  Laurence B. Milstein,et al.  Error statistics in data transmission over fading channels , 1998, IEEE Trans. Commun..

[20]  Teofilo F. Gonzalez.  Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Heuristics* , 2007 .

[21]  Ivan Stojmenovic,et al.  Handbook of Wireless Networks and Mobile Computing , 2002 .

[22]  Mostafa H. Ammar,et al.  On the optimality of cyclic transmission in teletext systems , 1985, 1985 24th IEEE Conference on Decision and Control.

[23]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[24]  Claire Mathieu,et al.  Polynomial-time approximation scheme for data broadcast , 2000, STOC '00.

[25]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[26]  W. Andrew,et al.  LO, and A. , 1988 .