Broadcast Data Placement over Multiple Wireless Channels

Broadcast Data Placement over Multiple Wireless Channels

Dimitrios Katsaros (Aristotle University of Thessaloniki, Greece) and Yannis Manolopoulos (Aristotle University of Thessaloniki, Greece)
Copyright: © 2005 |Pages: 22
DOI: 10.4018/978-1-59140-568-9.ch005
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

The advances in computer and communication technologies made possible an ubiquitous computing environment were clients equipped with portable devices can send and receive data anytime and from anyplace. Due to the asymmetry in communication and the scarceness of wireless resources, data broadcast is widely employed as an effective means in delivering data to the mobile clients. For reasons like heterogeneous communication capabilities and variable quality of service offerings, we may need to divide a single wireless channel into multiple physical or logical channels. Thus, we need efficient algorithms for placing the broadcast data into these multiple channels so as to reduce the client access time. The present chapter discusses algorithms for placing broadcast data to multiple wireless channels, which cannot be coalesced into a lesser number of high-bandwidth channels, assuming that there are no dependencies among the transmitted data. We give an algorithm for obtaining the optimal placement to the channels and explain its limitation since it is computationally very demanding and thus unfeasible. Then, we present heuristic schemes for obtaining suboptimal solutions to the problem of reporting on their implementation cost and their relative performance.

Complete Chapter List

Search this Book:
Reset