Greedy Heuristic for Problem of Scheduling Directed Wireless Data
碩士 === 南華大學 === 資訊管理學研究所 === 95 === Since the resource of transmission bandwidth and the power of portable devices are much limited under the wireless network environment, an efficient and effective data broadcasting algorithm is important in disseminating information to mobile clients in wireless...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/my8tru |
| Summary: | 碩士 === 南華大學 === 資訊管理學研究所 === 95 === Since the resource of transmission bandwidth and the power of portable devices are much limited under the wireless network environment, an efficient and effective data broadcasting algorithm is important in disseminating information to mobile clients in wireless broadcast environment.
In this paper, we consider the problem of efficiently generating the broadcast schedule when there are possible data dependence exist between each broadcasted data item. By arranging the vertex set by topological sort with greedy strategy, one can generate a directed optimal linear broadcast schedule. One key issue related to data broadcasting is the technique used for server to organize data for clients accessing the broadcasted information more efficiently, which is in terms of the average response time. The short average response time can ensure the quality of service.
Our result shows that by using the proposed schemes one can achieve a better broadcast schedule which reduces average response time.
|
|---|