東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Data retrieval for multi-item reques...

Lu, Zaixin.

FindBook

Google Book

Amazon

博客來

Data retrieval for multi-item requests in the multi-channel wireless broadcasting environments.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Data retrieval for multi-item requests in the multi-channel wireless broadcasting environments./
作者:	Lu, Zaixin.
面頁冊數:	92 p.
附註:	Source: Dissertation Abstracts International, Volume: 74-09(E), Section: B.
Contained By:	Dissertation Abstracts International74-09B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3564631
ISBN:	9781303136986

Data retrieval for multi-item requests in the multi-channel wireless broadcasting environments.
Lu, Zaixin.

Data retrieval for multi-item requests in the multi-channel wireless broadcasting environments. - 92 p.

Source: Dissertation Abstracts International, Volume: 74-09(E), Section: B.

Thesis (Ph.D.)--The University of Texas at Dallas, 2013.

Wireless data broadcasting is an efficient way to disseminate data to a large number of users in the mobile communication environments. In many applications, such as stock quotes, flight schedules and traffic reports, the users may want to download multiple data items at one time and the application may require the support of a multichannel architecture. In this dissertation, we study the problem of downloading a set of data items from multiple wireless broadcasting channels. We divide the data retrieval problem into different situations to carry on the analysis. To maximize the number of downloads given a deadline, we study the Largest Number Data Retrieval (LNDR) problem. We prove that the decision LNDR problem is NP-hard, and we propose an approximation algorithm for it with provable performance ratio. To minimize the response time for downloading a set of data items, we study the Least Time Data Retrieval (LTDR) problem. We develop a deterministic algorithm and a randomized algorithm for different cases of LTDR. To minimize the power consumption for downloading a set of data items, we study the Minimum Cost Data Retrieval (MCDR) problem. When only considering the power consumption in channel switching, we prove that MCDR has a polynomial time O(log k)-factor approximation solution where k is the number of requested data items and there exists no polynomial time o(log k)-factor approximation solution for MCDR, unless P ≠ NP. When considering the power consumption in both doze model and channel switching, we prove that MCDR is NP-hard to approximate to within any nontrivial factor, and we propose a heuristic algorithm to reduce the power consumption. We also provide simulation results to demonstrate the practical efficiency of the proposed algorithms. The simulation results show that significantly better performances can be obtained by using our data retrieval scheduling methods at the client side.

ISBN: 9781303136986Subjects--Topical Terms:

523869
Computer science.

Data retrieval for multi-item requests in the multi-channel wireless broadcasting environments.
LDR:02824nmm a2200265 4500 001 2069871
005 20160524150716.5
008 170521s2013 ||||||||||||||||| ||eng d
020 $a 9781303136986
035 $a (MiAaPQ)AAI3564631
035 $a AAI3564631
040 $a MiAaPQ $c MiAaPQ
100 1 $a Lu, Zaixin. $3 2165524
245 1 0 $a Data retrieval for multi-item requests in the multi-channel wireless broadcasting environments.
300 $a 92 p.
500 $a Source: Dissertation Abstracts International, Volume: 74-09(E), Section: B.
500 $a Advisers: Weili Wu; Dingzhu Du.
502 $a Thesis (Ph.D.)--The University of Texas at Dallas, 2013.
520 $a Wireless data broadcasting is an efficient way to disseminate data to a large number of users in the mobile communication environments. In many applications, such as stock quotes, flight schedules and traffic reports, the users may want to download multiple data items at one time and the application may require the support of a multichannel architecture. In this dissertation, we study the problem of downloading a set of data items from multiple wireless broadcasting channels. We divide the data retrieval problem into different situations to carry on the analysis. To maximize the number of downloads given a deadline, we study the Largest Number Data Retrieval (LNDR) problem. We prove that the decision LNDR problem is NP-hard, and we propose an approximation algorithm for it with provable performance ratio. To minimize the response time for downloading a set of data items, we study the Least Time Data Retrieval (LTDR) problem. We develop a deterministic algorithm and a randomized algorithm for different cases of LTDR. To minimize the power consumption for downloading a set of data items, we study the Minimum Cost Data Retrieval (MCDR) problem. When only considering the power consumption in channel switching, we prove that MCDR has a polynomial time O(log k)-factor approximation solution where k is the number of requested data items and there exists no polynomial time o(log k)-factor approximation solution for MCDR, unless P ≠ NP. When considering the power consumption in both doze model and channel switching, we prove that MCDR is NP-hard to approximate to within any nontrivial factor, and we propose a heuristic algorithm to reduce the power consumption. We also provide simulation results to demonstrate the practical efficiency of the proposed algorithms. The simulation results show that significantly better performances can be obtained by using our data retrieval scheduling methods at the client side.
590 $a School code: 0382.
650 4 $a Computer science. $3 523869
690 $a 0984
710 2 $a The University of Texas at Dallas. $b Computer Science. $3 1682289
773 0 $t Dissertation Abstracts International $g 74-09B(E).
790 $a 0382
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3564631