Skip to main content
SpringerLink
Log in

Efficient heuristics for data broadcasting on multiple channels

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over each channel so that the average waiting time of the clients is minimized. Such a problem is known to be polynomially time solvable for uniform length data items, while it is computationally intractable for non-uniform length data items. In this paper, two new heuristics are proposed which exploit a novel characterization of optimal solutions for the special case of two channels and data items of uniform lengths. Sub-optimal solutions for the most general case of an arbitrary number of channels and data items of non-uniform lengths are provided. The first heuristic, called Greedy+, combines the novel characterization with the known greedy approach, while the second heuristic, called Dlinear, combines the same characterization with the dynamic programming technique. Such heuristics have been tested on benchmarks whose popularities are characterized by Zipf distributions, as well as on a wider set of benchmarks. The experimental tests reveal that Dlinear finds optimal solutions almost always, requiring good running times. However, Greedy+ is faster and scales well when changes occur on the input parameters, but provides solutions which are close to the optimum.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Acharya, R. Alonso, M. Franklin and S. Zdonik, Broadcast disks: data management for asymmetric communication environments, in: Proc. SIGMOD (May 1995).

  2. M.H. Ammar and J.W. Wong, The design of teletext broadcast cycles, Performance Evaluation 5(4) (1985) 235–242.

    Article  Google Scholar 

  3. M.H. Ammar and J.W. Wong, On the optimality of cyclic transmission in teletext systems, IEEE Transactions on Communications 35(11) (1987) 1159–1170.

    Article  Google Scholar 

  4. E. Ardizzoni, A.A. Bertossi, M.C. Pinotti, S. Ramaprasad, R. Rizzi and M.V.S. Shashanka, Optimal skewed data allocation on multiple channels with flat broadcast per channel, IEEE Transactions on Computers 54(5) (2005) 558–572.

    Google Scholar 

  5. A. Bar-Noy, R. Bhatia, J.S. Naor and B. Schieber, Minimizing service and operation costs of periodic scheduling, in: Proc. Ninth ACM-SIAM Symp. on Discrete Algorithms (SODA) (1998).

  6. L. Breslau, P. Cao, L. Fan, G. Phillips and S. Shenker, Web caching and Zipf-like distributions: evidence and implications, in: Proc. IEEE INFOCOM (1999).

  7. S. Frattasi, R.L. Olsen, M. De Sanctis, F.H.P. Fitzek and R. Prasad, Heterogeneous services and architectures for next-generation wireless networks, in: 2nd IEEE International Symposium on Wireless Communication Systems (2005) pp. 213–217.

  8. A.S. Goldstein and E.M. Reingold, A Fibonacci version of Kraft’s inequality applied to discrete unimodal search, SIAM Journal on Computing 22(4) (1993) 751–777.

    Google Scholar 

  9. T. Imielinski, S. Viswanathan and B.R. Badrinath, Energy efficient indexing on air, in: Proc. SIGMOD (May 1994).

  10. C. Kenyon and N. Schabanel, The data broadcast problem with non-uniform transmission time, in: Proc. Tenth ACM-SIAM Symp. on Discrete Algorithms (SODA) (1999).

  11. C. Kenyon, N. Schabanel and N. Young, Polynomial time approximation scheme for data broadcast, in: Proc. ACM Symp. on Theory of Computing (STOC) (2000) pp. 659–666.

  12. S.-C. Lo and A.L.P. Chen, Optimal index and data allocation in multiple broadcast channels, in: Proc. Sixteenth IEEE Int’l Conf. on Data Engineering (ICDE) (February 2000).

  13. W.C. Peng and M.S. Chen, Efficient channel allocation tree generation for data broadcasting in a mobile computing environment, Wireless Networks 9(2) (2003) 117–129.

    Google Scholar 

  14. K.A. Prabhakara, K.A. Hua and J. Oh, Multi-level multi-channel air cache designs for broadcasting in a mobile environment, in: Proc Sixteenth IEEE Int’l Conf. on Data Engineering (ICDE) (February 2000).

  15. I. Stojmenovic (eds), Handbook of Wireless Networks and Mobile Computing (Wiley, Chichester, 2002).

  16. N. Vaidya and S. Hameed, Log time algorithms for scheduling single and multiple channel data broadcast, in: Proc. Third ACM-IEEE Conf. on Mobile Computing and Networking (MOBICOM) (September 1997).

  17. W.G. Yee, Efficient data allocation for broadcast disk arrays, Technical Report, GIT-CC-02-20, Georgia Institute of Technology (2001).

  18. W.G. Yee, S. Navathe, E. Omiecinski and C. Jermaine, Efficient data allocation over multiple channels at broadcast servers, IEEE Transactions on Computers 51(10) (2002) 1231–1236.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Mathematics, University of Perugia, 06123, Perugia, Italy

    S. Anticaglia, F. Barsi, L. Iamele & M. C. Pinotti

  2. Department of Computer Science, University of Bologna, 40127, Bologna, Italy

    A. A. Bertossi

Authors
  1. S. Anticaglia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Barsi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. A. Bertossi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. L. Iamele
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. M. C. Pinotti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. C. Pinotti.

Additional information

This work has been supported by ISTI-CNR under the BREW research grant.

Stefano Anticaglia received the bachelor’s degree in Computer Science from the University of Perugia (Italy) in 2005. At present, he is a student in the master’s of Computer Science of the University of Perugia.

Ferruccio Barsi received the doctor engineering degree from the University of Pisa, Italy, in 1969. From 1969 to 1992 he has been with he National Council of Research at the Istituto di Elaborazione dell’Informazione, Pisa. Since 1992, he is a Full Professor of Computer Science in the Mathematics and Computer Science Department of the University of Perugia, Italy.

His main contributions are in the areas of computer architecture, error-control coding, systems diagnosis, VLSI design, digital signal processing, and computer graphics. He is currently involved in researches concerning network security and wireless communications.

Alan Bertossi was born in London (England) in 1956. He got the Laurea Degree summa cum laude in Computer Science from the University of Pisa (Italy) in 1979. Afterwards, he worked as a System Programmer and Designer. From 1983 to 1994 he was with the University of Pisa as a Research Associate first, and later as an Associate Professor. From 1995 to 2002 he was with the University of Trento (Italy), as a Full Professor. Since 2002, he has been with the Department of Computer Science of the University of Bologna (Italy), as a Professor of Computer Science.

His main research interests are the computational aspects of high-performance, parallel, VLSI, distributed, fault-tolerant, and real-time systems. He has published about 40 refereed papers on international journals, as well as several papers in international conferences, workshops, and encyclopedias. He has authored a book (on design and analysis of algorithms, in Italian) and he served as a guest coeditor for special issues of Algorithmica, Discrete Applied Mathematics, and Mobile Networks and Applications. He is a member of the editorial board of Information Processing Letters. His biography is included in the 1999 edition of Who’s Who in the World and in the 2000 edition of Who’s Who in Science and Engineering. Since 1999, he has been a scientific collaborator at the Institute of Information Sciences and Technologies of the Italian National Research Council (ISTI-CNR, Pisa, Italy). During 2001–2003, he was the national coordinator of an Italian research project on algorithms for wireless networks.

Lucio Iamele received the bachelor’s degree in Computer Science from the University of Perugia (Italy) in 2004. At present, he is working at Noranet (Italy) as a system programmer and designer.

M. Cristina Pinotti received the Dr. degree cum laude in Computer Science from the University of Pisa, Italy, in 1986. During 1987–1999 she was a Researcher with the National Council of Research at the Istituto di Elaborazione dell’Informazione, Pisa. From 2000–2003 she was an Associate Professor at the University of Trento. From 2004, she is a Full Professor at the University of Perugia. In 1994 and 1995 she was a Research Associate at the Department of Computers Sciences, University of North Texas, Denton, TX. In 1997 she visited the Department of Computer Science, Old Dominion University, Norfolk, VA (USA).

Her research interests are in wireless networks, sensor networks, design and analysis of algorithms, data broadcasting, channel assignment problems, graph coloring, multiprocessor interconnection networks, design and analysis of parallel algorithms, parallel data structures, distributed computer arithmetic, residue number systems, VLSI special purpose architectures. She has published about 50 refereed papers on international journals, in international conferences and workshops. She has been a guest co-editor for special issues of Mobile Networks and Applications, Wireless Networks and Journal of Parallel and Distributed Computing. She is a member of the editorial board of International Journal of Parallel, Emergent and Distributed Systems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anticaglia, S., Barsi, F., Bertossi, A.A. et al. Efficient heuristics for data broadcasting on multiple channels. Wireless Netw 14, 219–231 (2008). https://doi.org/10.1007/s11276-006-9146-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-9146-x

Keywords

Search

Navigation