Broadcasting in a communications network has been the subject of many studies in recent years. The studies vary in their assumptions governing the behavior of the network and in their objectives with respect to the network. Almost all the work to date uses the unit transmission time assumption, that
Scheduling broadcasts in wireless networks
β Scribed by Bala Kalyanasundaram; Kirk R. Pruhs; Mahendran Velauthapillai
- Publisher
- Springer US
- Year
- 2001
- Tongue
- English
- Weight
- 160 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1094-6136
- DOI
- 10.1002/jos.87
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider problems involving how to schedule broadcasts in a pulled-based data-dissemination service, such as the DirecPC system, where data requested by the clients is delivered via broadcast. In particular, we consider the case where all the data items are of equal size and preemption is not allowed. We give an o ine O(1)-speed O(1)-approximation algorithm for the problem of minimizing the average response time. We provide worst-case analysis, under various objective functions, of the online algorithms that have appeared in the literature, namely, Most Requests First, First Come First Served, and Longest Wait First.
π SIMILAR VOLUMES
## Abstract Nextβgeneration 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fineβgrained QoS to users in such networks poses the twoβdimensional challenge of assigning both power (rate) and
## Abstract In this paper we propose a new broadcasting algorithm. In the proposed method we significantly reduce the broadcast overhead and also improve the broadcast delivery ratio in mobile networks. A novel traffic isolation method has been used which reduces the control message exchange. The p