東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Cooperative computing techniques in ...

Kaewprapha, Phisan.

FindBook

Google Book

Amazon

博客來

Cooperative computing techniques in networked systems.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Cooperative computing techniques in networked systems./
作者:	Kaewprapha, Phisan.
面頁冊數:	189 p.
附註:	Source: Dissertation Abstracts International, Volume: 74-03(E), Section: B.
Contained By:	Dissertation Abstracts International74-03B(E).
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3542666
ISBN:	9781267708038

Cooperative computing techniques in networked systems.
Kaewprapha, Phisan.

Cooperative computing techniques in networked systems. - 189 p.

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

Thesis (Ph.D.)--Lehigh University, 2012.

In the first part, we study cooperative data communication, specifically, network-coded receiver cooperation for a single-source multiple-receiver broadcasting model. Cooperative communication has been studied mostly with the senders or relays doing the cooperative relaying. Less study has been done when the receiver side cooperate to each other. We develop network coding scheme for the receiver cooperation.

ISBN: 9781267708038Subjects--Topical Terms:

1669061
Engineering, Computer.

Cooperative computing techniques in networked systems.
LDR:05376nam 2200373 4500 001 1957319
005 20131202131334.5
008 150210s2012 ||||||||||||||||| ||eng d
020 $a 9781267708038
035 $a (UMI)AAI3542666
035 $a AAI3542666
040 $a UMI $c UMI
100 1 $a Kaewprapha, Phisan. $3 2092196
245 1 0 $a Cooperative computing techniques in networked systems.
300 $a 189 p.
500 $a Source: Dissertation Abstracts International, Volume: 74-03(E), Section: B.
500 $a Adviser: Tiffany Jing Li.
502 $a Thesis (Ph.D.)--Lehigh University, 2012.
520 $a In the first part, we study cooperative data communication, specifically, network-coded receiver cooperation for a single-source multiple-receiver broadcasting model. Cooperative communication has been studied mostly with the senders or relays doing the cooperative relaying. Less study has been done when the receiver side cooperate to each other. We develop network coding scheme for the receiver cooperation.
520 $a Network codes based on GF(2q) random-mixing are considered complex and prone to errors. Sparse binary random-mixing is considerably simpler, but for it to be space-preserving requires the involvement of a huge number of source packets (vectors). In our case, we propose a novel strategy of an offset sparse binary random mixing at the receiver side, in which the source vectors are firstly circularly shifted, each by a different random offset, before being XORed. This simple strategy cleverly compensates for the low degree of the binary field (because of fewer number of practical receivers who in the same cooperating set) by the large dimension of the vector space. This ensures the near linear-independence of the random binary superposition while enjoying solid code structure from the well-known class of quasi-cyclic low-density parity-check codes.
520 $a In the second part, we investigate efficient algorithm in cooperated spectrum sensing in wireless network, which is generally harsh environment caused by shadowing and/or fading. Spectrum sensing in cognitive radio considers two entities, the owner of the spectrum, both transmitters/receivers called primary users and the other set of users called secondary users, who are waiting to use the bandwidth whenever it is vacant. Each cycle consists of two stages, sense and occupy. The first step is a very important as it would help to ensure that the interference by the primary users will be minimized as well as utilizing most of the available time slot.
520 $a Cooperative sensing will improve the accuracy of the measuring step. Here, inspired by a well-known class of probabilistic inference problems, believe propagation and message passing algorithm, we model the network of the secondary users as Markov random fields and pull a group of secondary users to cooperate through distributed probabilistic inference. This results in an effective sensing and fusion strategy. The proposed framework subsumes belief propagation, as well as conventional weighted hard/soft combining (such as maximal ratio combining and equal gain combing). It can also account for the distance dependent correlation among individual sensing results by setting appropriate compatibility function. Theoretic upper and lower bounds are derived, demonstrating the significant gains made possible by effective cooperation. Extensive simulations confirm the analytical results.
520 $a We further study more into the theoretical ground of our distributed sensing framework: the belief propagation (BP) as well as a similar class of in-network computation algorithm called distributed consensus (DC). We detail the exact operations of these algorithms, unify them in the general formulation of linear dynamical systems, evaluate their convergences, and compare their behaviors. Our analysis provides useful insight into how the two algorithms arising from drastically different theoretical basis can serve a common purpose. Specifically, it is shown that belief propagation is an algorithm of ''less is more'' and hence favors sparse graphs, whereas distributed consensus is an algorithm of ''the more the merrier'' and hence favors dense graphs.
520 $a In the third part, we study the problem of cooperative localization of a large network of nodes in integer-coordinated unit disk graphs, a simplified but useful version of general random graph. Exploiting the property that the radius r sets clear cut on the connectivity of two nodes, we propose an essential philosophy that ''no connectivity is a useful information'' in unit disk graphs. Exercising this philosophy, we show that the conventional network localization problem can be re-formulated to significantly reduce the search space, and that global rigidity, a necessary and sufficient condition for the existence of unique solution in general graphs, is no longer necessary. (Abstract shortened by UMI.).
590 $a School code: 0105.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0464
690 $a 0544
710 2 $a Lehigh University. $b Electrical Engineering. $3 1022507
773 0 $t Dissertation Abstracts International $g 74-03B(E).
790 1 0 $a Li, Tiffany Jing, $e advisor
790 1 0 $a Kishore, Shalinee $e committee member
790 1 0 $a Yan, Zhiyuan $e committee member
790 1 0 $a Cheng, Liang $e committee member
790 $a 0105
791 $a Ph.D.
792 $a 2012
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3542666