東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Issues in ad hoc wireless networks.

Cheng, Xiuzhen.

FindBook

Google Book

Amazon

博客來

Issues in ad hoc wireless networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Issues in ad hoc wireless networks./
作者:	Cheng, Xiuzhen.
面頁冊數:	109 p.
附註:	Major Adviser: Ding-Zhu Du.
Contained By:	Dissertation Abstracts International63-03B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3047621
ISBN:	0493617329

Issues in ad hoc wireless networks.
Cheng, Xiuzhen.

Issues in ad hoc wireless networks. - 109 p.

Major Adviser: Ding-Zhu Du.

Thesis (Ph.D.)--University of Minnesota, 2002.

This thesis provides algorithms to solve several problems related to resource-efficient routing in ad hoc wireless networks and power-aware connectivity maintenance in wireless sensor networks.

ISBN: 0493617329Subjects--Topical Terms:

626642
Computer Science.

Issues in ad hoc wireless networks.
LDR:03288nam 2200313 a 45 001 933693
005 20110506
008 110506s2002 eng d
020 $a 0493617329
035 $a (UnM)AAI3047621
035 $a AAI3047621
040 $a UnM $c UnM
100 1 $a Cheng, Xiuzhen. $3 582089
245 1 0 $a Issues in ad hoc wireless networks.
300 $a 109 p.
500 $a Major Adviser: Ding-Zhu Du.
500 $a Source: Dissertation Abstracts International, Volume: 63-03, Section: B, page: 1423.
502 $a Thesis (Ph.D.)--University of Minnesota, 2002.
520 $a This thesis provides algorithms to solve several problems related to resource-efficient routing in ad hoc wireless networks and power-aware connectivity maintenance in wireless sensor networks.
520 $a Recent research shows that with the introduction of a virtual backbone which is in charge of control packets dissemination, routing protocol overhead in ad hoc wireless networks can be effectively decreased. In this thesis, I first propose two distributed time/message efficient approximation algorithms to compute the virtual backbone. Both algorithms have linear message complexities. Algorithm I is cost-aware, which accommodates the strict network resources. Algorithm II is degree-aware, which generates the best result in literature so far to our knowledge. Simulation results and theoretical analysis show that both algorithms perform well.
520 $a In this study, the virtual backbone is approximated by a “minimum connected dominating set (MCDS)” in unit-disk graphs. This is a NP-Hard problem. Other than the two efficient heuristics mentioned above, We also design a Polynomial Time Approximation Scheme (PTAS) for MCDS in unit-disk graphs. This tells that theoretically MCDS in unit-disk graphs can be approximated to any degree.
520 $a Broadcast in ad hoc wireless networks is another challenging problem. We propose a heuristic to construct a broadcast tree rooted at the source. This broadcast tree has two features: it contains as many leaves as possible; and it favors hosts with lower cost. These features not only improve the broadcast efficiency but also balance routing burden in the whole network.
520 $a Finally we propose a novel idea of maintaining connectivity by introducing relay sensors in wireless sensor networks. We formulate the problem to the NP-hard network optimization problem named <italic>Steiner Minimum Tree with Minimum number of Steiner Points</italic> (<italic>SMT-MSP</italic>) and present two approximate solutions. We also study the topology improvement by simulation when one or more relay sensors are introduced. The performance parameters under consideration include <italic>P</italic>, the total per node minimum power needed to maintain connectivity, and <italic>D</italic>, the maximum degree in the topology maintained by <italic>P</italic>. Simulation study shows that with the introduction of relay sensors, we achieve better performance, especially for sparse topology.
590 $a School code: 0130.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Minnesota. $3 676231
773 0 $t Dissertation Abstracts International $g 63-03B.
790 $a 0130
790 1 0 $a Du, Ding-Zhu, $e advisor
791 $a Ph.D.
792 $a 2002
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3047621